Recommendations
- A more efficient algorithm for perfect sorting by reversals
- Sorting with fixed-length reversals
- An approximation algorithm for sorting by reversals and transpositions
- Computing and Combinatorics
- Combinatorial Pattern Matching
- Improved bounds on sorting by length-weighted reversals
- Improved bounds on sorting with length-weighted reversals
- scientific article; zbMATH DE number 1303563
- Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Cites work
- scientific article; zbMATH DE number 1830749 (Why is no real title available?)
- scientific article; zbMATH DE number 5031986 (Why is no real title available?)
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- Combinatorial Pattern Matching
- Efficient data structures and a new randomized approach for sorting signed permutations by reversals
- Self-adjusting binary search trees
- Transforming cabbage into turnip
Cited in
(23)- Topological Morphing of Planar Graphs
- scientific article; zbMATH DE number 1786450 (Why is no real title available?)
- A very elementary presentation of the Hannenhalli-Pevzner theory
- Sorting permutations and binary strings by length-weighted rearrangements
- Reversals Cayley graphs of symmetric groups
- SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS
- Computing and Combinatorics
- Average-case analysis of perfect sorting by reversals
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- Cabbage can't always be transformed into turnip: decision algorithms for sorting by symmetric reversals
- An improved genetic algorithm for problem of genome rearrangement
- An audit tool for genome rearrangement algorithms
- Experimental and statistical analysis of sorting by reversals
- Replacement sort revisited: The ``gold standard unearthed!
- An efficient algorithm for one-sided block ordering problem under block-interchange distance
- An improved algorithm for sorting by block-interchanges based on permutation groups
- A more efficient algorithm for perfect sorting by reversals
- Polynomial-time sortable stacks of burnt pancakes
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
- Sorting signed permutations by reversals using link-cut trees
- Average-Case Analysis of Perfect Sorting by Reversals
- Combinatorial Pattern Matching
- Topological morphing of planar graphs
This page was built for publication: Advances on sorting by reversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876490)
