Average-Case Analysis of Perfect Sorting by Reversals
From MaRDI portal
Publication:3637122
DOI10.1007/978-3-642-02441-2_28zbMath1247.68070arXiv1201.0940MaRDI QIDQ3637122
Cedric Chauve, Marni Mishna, Dominique Rossin, 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
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68R05: Combinatorics in computer science
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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