Consensus Strings with Small Maximum Distance and Small Distance Sum - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Consensus Strings with Small Maximum Distance and Small Distance Sum

Résumé

The parameterised complexity of consensus string problems (Closest String, Closest Sub-string, Closest String with Outliers) is investigated in a more general setting, i. e., with a bound on the maximum Hamming distance and a bound on the sum of Hamming distances between solution and input strings. We completely settle the parameterised complexity of these generalised variants of Closest String and Closest Substring, and partly for Closest String with Outliers; in addition, we answer some open questions from the literature regarding the classical problem variants with only one distance bound. Finally, we investigate the question of polynomial kernels and respective lower bounds.
Fichier principal
Vignette du fichier
closestStrRadSuLipicsMFCSProc.pdf (670.85 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-01930623 , version 1 (22-11-2018)

Identifiants

Citer

Laurent Bulteau, Markus L. Schmid. Consensus Strings with Small Maximum Distance and Small Distance Sum. 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)., Aug 2018, Liverpool, United Kingdom. ⟨10.4230/LIPIcs.MFCS.2018.1⟩. ⟨hal-01930623⟩
159 Consultations
103 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More