Consensus Strings with Small Maximum Distance and Small Distance Sum - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2020

Consensus Strings with Small Maximum Distance and Small Distance Sum

Résumé

The parameterised complexity of various consensus string problems (Closest String, Closest Substring, 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.

Dates et versions

hal-02382881 , version 1 (27-11-2019)

Identifiants

Citer

Laurent Bulteau, Markus L. Schmid. Consensus Strings with Small Maximum Distance and Small Distance Sum. Algorithmica, 2020, 82 (5), pp.1378-1409. ⟨10.1007/s00453-019-00647-9⟩. ⟨hal-02382881⟩
24 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More