Average-Case Analysis of Perfect Sorting by Reversals

DOI10.1007/978-3-642-02441-2_28zbMath1247.68070arXiv1201.0940OpenAlexW2057075063MaRDI QIDQ3637122

Marni Mishna, Dominique Rossin, Cedric Chauve, Mathilde Bouvel

Publication date: 7 July 2009

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.0940

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorics in computer science (68R05)

Related Items (1)

A more efficient algorithm for perfect sorting by reversals

Uses Software

• OEIS

Cites Work

• Finding pattern matchings for permutations
• Advances on sorting by reversals
• A more efficient algorithm for perfect sorting by reversals
• Simple permutations and pattern restricted permutations
• Transforming cabbage into turnip
• Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
• The On-Line Encyclopedia of Integer Sequences
• Comparative Genomics
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Average-Case Analysis of Perfect Sorting by Reversals