Sorting permutations and binary strings by length-weighted rearrangements
From MaRDI portal
Publication:683752
DOI10.1016/j.tcs.2018.01.012zbMath1386.68236OpenAlexW2787532231MaRDI QIDQ683752
Zanoni Dias, Carla Negri Lintzmayer, Guillaume Fertin
Publication date: 9 February 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.01.012
Searching and sorting (68P10) Genetics and epigenetics (92D10) Approximation algorithms (68W25) Algorithms on strings (68W32)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sorting by prefix reversals and prefix transpositions
- Pancake flipping is hard
- Approximation algorithms for sorting by length-weighted prefix and suffix operations
- On average and highest number of flips in pancake sorting
- Bounding prefix transposition distance for strings and permutations
- An \((18/11)n\) upper bound for sorting by prefix reversals
- Advances on sorting by reversals
- Improved bounds on sorting by length-weighted reversals
- An approximation algorithm for sorting by reversals and transpositions
- Bounds for sorting by prefix reversal
- On the problem of sorting burnt pancakes
- Algorithms for computational biology. First international conference, AlCoB 2014, Tarragona, Spain, July 1--3, 2014. Proceedings
- Prefix and Suffix Reversals on Strings
- Sorting by Transpositions Is Difficult
- Transforming cabbage into turnip
- Edit Distances and Factorisations of Even Permutations
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- On the Diameter of the Pancake Network
- Genome Rearrangements and Sorting by Reversals
- Combinatorial Pattern Matching
- Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions
- Algorithms – ESA 2005
- Sorting a bridge hand
This page was built for publication: Sorting permutations and binary strings by length-weighted rearrangements
