A more efficient algorithm for perfect sorting by reversals

DOI10.1016/J.IPL.2007.10.012zbMATH Open1186.68143OpenAlexW2088853706MaRDI QIDQ963340FDOQ963340

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

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

zbMATH Keywords

algorithmscommon intervalssorting by reversals

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances on sorting by reversals
• Algorithms – ESA 2005
• Algorithms and Computation
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Average-Case Analysis of Perfect Sorting by Reversals

Cited In (7)

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

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)