Sorting signed permutations by reversals using link-cut trees

DOI10.1016/j.ipl.2017.12.005zbMath1426.68072OpenAlexW2777308084MaRDI QIDQ1705654

Irena Rusu

Publication date: 16 March 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.12.005

zbMATH Keywords

algorithmslink-cut treesorting by reversals

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Unnamed Item
• \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges
• Advances on sorting by reversals
• A construction for sets of integers with distinct subset sums
• A data structure for dynamic trees
• Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

This page was built for publication: Sorting signed permutations by reversals using link-cut trees