Efficient data structures and a new randomized approach for sorting signed permutations by reversals

DOI10.1007/3-540-44888-8_13MaRDI QIDQ3550834zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Elad Verbin

Publication date 6 April 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44888-8_13

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Sorting signed permutations by reversals, revisited
• Combinatorial Pattern Matching
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Genome Rearrangements and Sorting by Reversals
• scientific article; zbMATH DE number 1947393

Cited in

(10)

• Sorting signed permutations by reversals, revisited
• Advances on sorting by reversals
• SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS
• A simpler and faster 1.5-approximation algorithm for sorting by transpositions
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Transforming cabbage into turnip
• Some problems on Cayley graphs
• On the average number of reversals needed to sort signed permutations
• Sorting permutations with fixed pinnacle set
• Sorting signed permutations by reversals using link-cut trees

This page was built for publication: Efficient data structures and a new randomized approach for sorting signed permutations by reversals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550834)