A linear-time algorithm for computing inversion distance between signed permutations with an experimental study

Journal of Computational Biology

Volumn 8, Issue 5, 2001, Pages 483-491

  Bader, D A ^a   Moret, B M E ^a   Yan, M ^a  

^a MSC01 1070   (United States)

Author keywords

Cycle graph; Inversion distance; Overlap forest; Overlap graph; Signed permutation; Sorting by reversals

Indexed keywords

ALGORITHM; ARTICLE; EXPERIMENTATION; GENE MUTATION; PRIORITY JOURNAL; SIMULATION; THEORETICAL STUDY;

ALGORITHMS; EVOLUTION; GENES; MODELS, BIOLOGICAL;

EID: 0034767147     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/106652701753216503     Document Type: Article

References (22)

1. Sorting permutations by transpositions
2. Genome rearrangements and sorting by reversals
3. Genome rearrangements and sorting by reversals
4. Sorting by transpositions
5. Fast sorting by reversal
6. Breakpoint phylogenies
7. Sorting by reversals is difficult
8. Sorting permutations by reversals and Eulerian cycle decompositions
9. A new fast heuristic for computing the breakpoint phylogeny and a phylogenetic analysis of a group of highly rearranged chloroplast genomes
10. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals)
11. A faster and simpler algorithm for sorting signed permutations by reversals
12. Toward an experimental method for algorithm simulation
13. Algorithms and experiments: The new (and old) methodology
14. A new implementation and detailed study of breakpoint analysis
15. Lengths of chromosome segments conserved since divergence of man and mouse
16. Chloroplast DNA systematics: A review of methods and data analysis
17. Chloroplast and mitochondrial genome evolution in land plants
18. Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants
19. Multiple genome rearrangement and breakpoint phylogeny