Consensus Strings with Small Maximum Distance and Small Distance Sum

Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01930623
Contributor : Laurent Bulteau <>
Submitted on : Thursday, November 22, 2018 - 10:39:11 AM
Last modification on : Saturday, December 22, 2018 - 7:31:58 PM
Long-term archiving on : Saturday, February 23, 2019 - 1:16:25 PM

File

closestStrRadSuLipicsMFCSProc....
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Laurent Bulteau, Markus 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⟩

Share

Metrics

Record views

45

Files downloads

44