SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS

DOI10.1142/S0129054106004194MaRDI QIDQ5484911zbMATH OpenFDO

Authors Xingqin Qi, Guojun Li, Jichang Wu, Bingqiang Liu

Publication date 21 August 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

circularlinearsigned permutationfixed-length reversal

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Sorting signed permutations by reversals, revisited
• Sorting with fixed-length reversals
• Efficient data structures and a new randomized approach for sorting signed permutations by reversals
• On the average number of reversals needed to sort signed permutations
• Advances on sorting by reversals

Cites work

• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Sorting with fixed-length reversals

Cited in

(6)

• On reconstruction of signed permutations distorted by reversal errors
• Signed relative derangements, reversal distance, and the signed Hultman numbers.
• Sorting a permutation by best short swaps
• A topological framework for signed permutations
• Transforming cabbage into turnip
• Sorting by \(k\)-cuts on signed permutations

This page was built for publication: SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS

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