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

DOI10.1145/3110290zbMath1427.68131MaRDI QIDQ4973890

Markus L. Schmid

Publication date: 6 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3110290

zbMATH Keywords

parameterised complexity; multivariate algorithmics; hard string problems

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W32: Algorithms on strings