Advances on sorting by reversals
From MaRDI portal
Publication:876490
DOI10.1016/J.DAM.2005.02.033zbMATH Open1111.68029OpenAlexW2157761435MaRDI QIDQ876490FDOQ876490
Eric Tannier, Anne Bergeron, Marie-France Sagot
Publication date: 18 April 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.02.033
Cites Work
- Self-adjusting binary search trees
- Title not available (Why is that?)
- Transforming cabbage into turnip
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- Combinatorial Pattern Matching
- Title not available (Why is that?)
- Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals
Cited In (18)
- Title not available (Why is that?)
- Sorting permutations and binary strings by length-weighted rearrangements
- Reversals Cayley graphs of symmetric groups
- 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 audit tool for genome rearrangement algorithms
- 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
- Topological morphing of planar graphs
- Topological Morphing of Planar Graphs
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 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions 👍 👎
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)
