FLIPPING LETTERS TO MINIMIZE THE SUPPORT OF A STRING

DOI10.1142/S0129054108005504MaRDI QIDQ3532136zbMATHOpenAlexFDO

Authors Giuseppe Lancia, Franca Rinaldi, Romeo Rizzi

Publication date 3 November 2008

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054108005504

zbMATH Keywords

parameterized complexitystring algorithmsDe Bruijn graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Integer programming (90C10) Combinatorics on words (68R15)

Recommendations

• String factorisations with maximum or minimum dimension
• Reversal distances for strings with few blocks or small alphabets
• (Prefix) reversal distance for (signed) strings with few blocks or small alphabets
• On the kernelization complexity of string problems
• On the kernelization complexity of string problems

This page was built for publication: FLIPPING LETTERS TO MINIMIZE THE SUPPORT OF A STRING

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3532136)