A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications

Laurent Bulteau 1 Guillaume Fertin 1 Christian Komusiewicz 1 Irena Rusu 1
1 LINA - Laboratoire d'Informatique de Nantes Atlantique
Abstract : Motivated by the study of genome rearrangements, the NP-hard Minimum Common String Partition problems asks, given two strings, to split both strings into an identical set of blocks. We consider an extension of this problem to unbalanced strings, so that some elements may not be covered by any block. We present an efficient fixed-parameter algorithm for the parameters number k of blocks and maximum occurrence d of a letter in either string. We then evaluate this algorithm on bacteria genomes and synthetic data.
Document type :
Conference papers
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-00906903
Contributor : Guillaume Fertin <>
Submitted on : Wednesday, November 20, 2013 - 2:28:11 PM
Last modification on : Thursday, April 5, 2018 - 10:36:48 AM

Links full text

arxiv

Identifiers

Collections

UNIV-NANTES | LINA | LINA-COMBI

Citation

Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu. A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. Springer. 13th Workshop on Algorithms in Bioinformatics (WABI2013), Sep 2013, Nice, France. 8126, pp.244-258, 2013, Lecture Notes in Bioinformatics. 〈10.1007/978-3-642-40453-5_19〉. 〈hal-00906903〉

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

113

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD