Sorting permutations and binary strings by length-weighted rearrangements
From MaRDI portal
Publication:683752
DOI10.1016/J.TCS.2018.01.012zbMATH Open1386.68236OpenAlexW2787532231MaRDI QIDQ683752FDOQ683752
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
Recommendations
- Length-weighted \(\lambda\)-rearrangement distance
- Approximation algorithms for sorting by length-weighted prefix and suffix operations
- Improved bounds on sorting by length-weighted reversals
- Improved bounds on sorting with length-weighted reversals
- Approximation algorithms for sorting permutations by fragmentation-weighted operations
Genetics and epigenetics (92D10) Searching and sorting (68P10) Approximation algorithms (68W25) Algorithms on strings (68W32)
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Bounds for sorting by prefix reversal
- On the Diameter of the Pancake Network
- Pancake flipping is hard
- On average and highest number of flips in pancake sorting
- Sorting a bridge hand
- Transforming cabbage into turnip
- Advances on sorting by reversals
- On the problem of sorting burnt pancakes
- An \((18/11)n\) upper bound for sorting by prefix reversals
- An approximation algorithm for sorting by reversals and transpositions
- Sorting by Transpositions Is Difficult
- Title not available (Why is that?)
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- Sorting by prefix reversals and prefix transpositions
- Genome Rearrangements and Sorting by Reversals
- Combinatorial Pattern Matching
- Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions
- Algorithms – ESA 2005
- Bounding prefix transposition distance for strings and permutations
- Edit Distances and Factorisations of Even Permutations
- Algorithms for computational biology. First international conference, AlCoB 2014, Tarragona, Spain, July 1--3, 2014. Proceedings
- Approximation algorithms for sorting by length-weighted prefix and suffix operations
- Improved bounds on sorting by length-weighted reversals
- Prefix and Suffix Reversals on Strings
Cited In (8)
- Weighted Minimum-Length Rearrangement Scenarios.
- Title not available (Why is that?)
- Length-weighted \(\lambda\)-rearrangement distance
- Sorting circular binary strings with length weighted transpositions
- Indexing permutations for binary strings
- Approximation algorithms for sorting permutations by length-weighted short rearrangements
- Sorting parity encodings by reusing variables
- Improved bounds on sorting by length-weighted reversals
This page was built for publication: Sorting permutations and binary strings by length-weighted rearrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683752)
