Advances on sorting by reversals

DOI10.1016/j.dam.2005.02.033zbMath1111.68029OpenAlexW2157761435MaRDI QIDQ876490

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

zbMATH Keywords

computational biologygenome rearrangementreversal sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Biochemistry, molecular biology (92C40)

Related Items (13)

AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS ⋮ Topological morphing of planar graphs ⋮ An efficient algorithm for one-sided block ordering problem under block-interchange distance ⋮ Polynomial-time sortable stacks of burnt pancakes ⋮ Sorting signed permutations by reversals using link-cut trees ⋮ An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations ⋮ Sorting permutations and binary strings by length-weighted rearrangements ⋮ A more efficient algorithm for perfect sorting by reversals ⋮ Reversals Cayley graphs of symmetric groups ⋮ An improved algorithm for sorting by block-interchanges based on permutation groups ⋮ Topological Morphing of Planar Graphs ⋮ Average-Case Analysis of Perfect Sorting by Reversals ⋮ An Audit Tool for Genome Rearrangement Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Transforming cabbage into turnip
• Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals
• Self-adjusting binary search trees
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Combinatorial Pattern Matching

This page was built for publication: Advances on sorting by reversals