A more efficient algorithm for perfect sorting by reversals

DOI10.1016/j.ipl.2007.10.012zbMath1186.68143OpenAlexW2088853706MaRDI QIDQ963340

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)

Related Items (3)

AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Average-Case Analysis of Perfect Sorting by Reversals

Cites Work

• Unnamed Item
• Unnamed Item
• Advances on sorting by reversals
• Average-Case Analysis of Perfect Sorting by Reversals
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Algorithms – ESA 2005
• Algorithms and Computation

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