The Complexity of String Partitioning

DOI10.1007/978-3-642-31265-6_13zbMath1358.68336arXiv1204.2201OpenAlexW2924094412MaRDI QIDQ2904489

Chris Thachuk, Ján Maňuch, Anne Condon

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.2201

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Algorithms on strings (68W32)

Related Items (2)

Computing Equality-Free String Factorisations ⋮ The complexity of string partitioning

This page was built for publication: The Complexity of String Partitioning