A more efficient algorithm for perfect sorting by reversals

DOI10.1016/J.IPL.2007.10.012MaRDI QIDQ963340zbMATH OpenOpenAlexFDO

Authors Sèverine Bérard, Cedric Chauve, Christophe Paul

Publication date 19 April 2010

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

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

zbMATH Keywords

algorithmscommon intervalssorting by reversals

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Combinatorial Pattern Matching
• Average-case analysis of perfect sorting by reversals
• Advances on sorting by reversals
• Average-Case Analysis of Perfect Sorting by Reversals

Cites work

• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 2171552 (Why is no real title available?)
• Advances on sorting by reversals
• Algorithms and Computation
• Algorithms – ESA 2005
• Average-Case Analysis of Perfect Sorting by Reversals
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions

Cited in

(7)

• Advances on sorting by reversals
• Replacement sort revisited: The ``gold standard unearthed!
• Average-case analysis of perfect sorting by reversals
• Computing and Combinatorics
• Average-Case Analysis of Perfect Sorting by Reversals
• A survey of the algorithmic aspects of modular decomposition
• Sorting signed permutations by reversals using link-cut trees

This page was built for publication: A more efficient algorithm for perfect sorting by reversals

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