Prefix and Suffix Reversals on Strings

DOI10.1007/978-3-319-23826-5_17MaRDI QIDQ2949837zbMATH OpenOpenAlexFDO

Authors Guillaume Fertin, Loïc Jankowiak, Géraldine Jean

Publication date 2 October 2015

Published in String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-23826-5_17

Mathematics Subject Classification ID

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

Recommendations

• Prefix and suffix reversals on strings
• Prefix Reversals on Binary and Ternary Strings
• Prefix Reversals on Binary and Ternary Strings
• Prefix and suffix transreversals on binary and ternary strings
• Prefix transpositions on binary and ternary strings
• Sorting by prefix reversals and prefix transpositions
• Sorting strings by reversals and by transpositions
• (Prefix) reversal distance for (signed) strings with few blocks or small alphabets
• Sorting permutations by prefix and suffix versions of reversals and transpositions

Cites work

• Combinatorics of genome rearrangements.
• Prefix and suffix transreversals on binary and ternary strings
• Prefix Reversals on Binary and Ternary Strings
• Reversal distances for strings with few blocks or small alphabets
• Reversals and Transpositions Over Finite Alphabets
• Sorting permutations by prefix and suffix versions of reversals and transpositions
• Sorting strings by reversals and by transpositions
• Transforming cabbage into turnip

Cited in

(8)

• Prefix and suffix reversals on strings
• (Prefix) reversal distance for (signed) strings with few blocks or small alphabets
• Prefix Reversals on Binary and Ternary Strings
• Prefix and suffix transreversals on binary and ternary strings
• Prefix Reversals on Binary and Ternary Strings
• String rearrangement inequalities and a total order between primitive words
• Sorting permutations and binary strings by length-weighted rearrangements
• Sorting by multi-cut rearrangements

This page was built for publication: Prefix and Suffix Reversals on Strings

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