Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals

DOI10.1007/3-540-44888-8_13zbMath1279.68072OpenAlexW1603601122MaRDI QIDQ3550834

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

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

Related Items (6)

Advances on sorting by reversals ⋮ Sorting signed permutations by reversals using link-cut trees ⋮ Some problems on Cayley graphs ⋮ A simpler and faster 1.5-approximation algorithm for sorting by transpositions ⋮ Sorting signed permutations by reversals, revisited ⋮ Sorting permutations with fixed pinnacle set

This page was built for publication: Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals