Consensus Strings with Small Maximum Distance and Small Distance 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 inpu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 82; číslo 5; s. 1378 - 1409
Hlavní autoři: Bulteau, Laurent, Schmid, Markus L.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.05.2020
Springer Nature B.V
Springer Verlag
Témata:
Algorithm Analysis and Problem Complexity
Algorithms
Bioinformatics
Complexity
Computational Complexity
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Algorithms
Data Structures and Information Theory
Lower bounds
Mathematics of Computing
Parameterization
Polynomials
Questions
Strings
Theory of Computation
Parameterised Complexity
Closest Substring
Kernelisation
Consensus String Problems
Closest String
ISSN:0178-4617, 1432-0541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-019-00647-9