An algorithm to find all sorting reversals

Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB

Volumn , Issue , 2002, Pages 281-290

  Siepel, Adam C ^a  

^a University of California Santa Cruz   (United States)

Author keywords

Genome rearrangements; Sorting by reversals

Indexed keywords

ALGORITHMS; MOLECULAR BIOLOGY; PROBLEM SOLVING; SORTING;

GENOME ARRANGEMENTS; PERMUTATIONS;

COMPUTATIONAL COMPLEXITY;

EID: 0036376081     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study
2. Genome rearrangements and sorting by reversals
3. A very elementary presentation of the Hannenhalli-Pevzner theory
4. Experiments in computing sequences of reversals
5. Parametric genome rearrangement
6. Sorting by reversals is difficult
7. Algorithms for constructing comparative maps
8. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals)
9. A faster and simpler algorithm for sorting signed permutations by reversals
10. High frequency of inversions during eukaryote gene order evolution
11. New approaches for reconstructing phylogenies from gene-order data
12. Lengths of chromosomal segments conserved since divergence of man and mouse
13. Multiple genome rearrangement and breakpoint phylogeny
14. Early eukaryote evolution based on mitochondrial gene order breakpoints
15. Genome rearrangement
16. Conserved segment identification
17. Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome
18. Exact algorithms for the reversal median problem
19. Estimating the number of conserved segments between species using a chromosome-based model