Finding Consensus Strings with Small Length Difference Between Input and Solution Strings

DOI10.1007/978-3-662-48054-0_45zbMath1465.68114OpenAlexW2401288876MaRDI QIDQ2946423

Markus L. Schmid

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48054-0_45

zbMATH Keywords

parameterised complexityhard string problems

Mathematics Subject Classification ID

Algorithms on strings (68W32) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• On covering problems of codes
• On the parameterized intractability of motif search problems
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• On the complexity of finding common approximate substrings.
• Parametrized complexity theory.
• Closest Substring Problems with Small Distances

This page was built for publication: Finding Consensus Strings with Small Length Difference Between Input and Solution Strings