A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

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

Résumé

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.

Dates et versions

hal-00906903 , version 1 (20-11-2013)

Identifiants

Citer

Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu. A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. 13th Workshop on Algorithms in Bioinformatics (WABI2013), Sep 2013, Nice, France. pp.244-258, ⟨10.1007/978-3-642-40453-5_19⟩. ⟨hal-00906903⟩
76 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More