Prefix and Suffix Reversals on Strings

DOI10.1007/978-3-319-23826-5_17zbMath1453.68227OpenAlexW2224993064MaRDI QIDQ2949837

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

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

Related Items (2)

Prefix and suffix reversals on strings ⋮ Sorting permutations and binary strings by length-weighted rearrangements

Cites Work

• Unnamed Item
• Prefix and suffix transreversals on binary and ternary strings
• Pancake flipping is hard
• Sorting Strings by Reversals and by Transpositions
• Transforming cabbage into turnip
• 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

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