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

DOI10.1145/3110290zbMath1427.68131OpenAlexW2754226771MaRDI 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 complexitymultivariate algorithmicshard string problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

Related Items (4)

The complexity of binary matrix completion under diameter constraints ⋮ Unnamed Item ⋮ Closest substring problems for regular languages ⋮ Consensus strings with small maximum distance and small distance sum

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