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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 82; H. 5; S. 1378 - 1409
Hauptverfasser:	Bulteau, Laurent, Schmid, Markus L.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.05.2020 Springer Nature B.V Springer Verlag
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!