Computing Equality-Free String Factorisations

DOI10.1007/978-3-319-20028-6_32zbMath1441.68200OpenAlexW2279704821MaRDI QIDQ3195710

Markus L. Schmid

Publication date: 20 October 2015

Published in: Evolving Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20028-6_32

zbMATH Keywords

FPTNP-hard string problemsstring factorisations

Mathematics Subject Classification ID

Combinatorics on words (68R15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Computing equality-free and repetitive string factorisations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parametrized complexity theory.
• The Complexity of String Partitioning
• Diverse Palindromic Factorization Is NP-complete
• Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis
• Fast Pattern Matching in Strings
• On the Exact Block Cover Problem

This page was built for publication: Computing Equality-Free String Factorisations