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

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.
Type de document :
Communication dans un congrès
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〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00906903
Contributeur : Guillaume Fertin <>
Soumis le : mercredi 20 novembre 2013 - 14:28:11
Dernière modification le : jeudi 5 avril 2018 - 10:36:48

Lien texte intégral

Identifiants

Collections

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〉

Partager

Métriques

Consultations de la notice

111