Sorting circular permutations by reversal.

DOI10.1007/B11837MaRDI QIDQ5900764zbMATH OpenFDO

Authors Andrew Solomon, Paul J. Sutcliffe, Raymond Lister

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B11837

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics in computer science (68R05)

Recommendations

• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• scientific article; zbMATH DE number 1303563
• Genome Rearrangements and Sorting by Reversals
• Sorting with fixed-length reversals
• scientific article; zbMATH DE number 1263193

Cited in

(15)

• Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics
• Sorting on graphs by adjacent swaps using permutation groups
• Multiple genome rearrangement by swaps and by element duplications
• Sorting permutations by reversals through branch-and-price
• Finding Eulerian cycle decompositions and the rotation distance between binary trees
• Topological Morphing of Planar Graphs
• Topological morphing of planar graphs
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Kernelization of Whitney switches
• CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS
• Combinatorial Pattern Matching
• Circular permutations and genome shuffling
• Kernelization of Whitney Switches
• Switches in Eulerian graphs
• A review of metrics on permutations for search landscape analysis

This page was built for publication: Sorting circular permutations by reversal.

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