A linear-time algorithm for computing translocation distance between signed genomes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3109, Issue , 2004, Pages 323-332

  Li, Guojun ^a   Qi, Xingqin ^b   Wang, Xiaoli ^c   Zhu, Binhai ^a  

^a INSTITUTE OF SOFTWARE   (China)

^b SHANDONG UNIVERSITY   (China)

^c Montana State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; PATTERN MATCHING;

LINEAR-TIME ALGORITHMS;

GENES;

EID: 35048869608     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_24     Document Type: Article

References (8)

1. D. Sankoff. Edit distance for genomes comparison based on non-local operation. Proc. 3rd Ann. Symp. Combinatorial Pattern Matching, LNCS 644, pp.. 121-135, 1992.
2. D. Sankoff, G. Leduc, N. Antoine, B. Paquin, B. Lang and R. Cedergren. Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proc. Nat. Sci. USA, 89:6575-6579, 1992.
3. S. Hannenhalli. Polynomial-time algorithm for computing translocation distance between genomes. Discrete Applied Mathematics, 71: 137-151, 1996.
4. D. Bader, B. Moret and M. Yan. A linear-time algorithm for computing inversion distance between signed permutations with experimental study. J. Comput. Biol., 8:483-491, 2001.
5. V. Bafna and P. Pevzner. Genome rearrangements and sorting by reversals. SIAM J. Comput., 25:272-289, 1996.
6. J. Kececioglu and D. Sankoff. Exact and approximation algorithms for the reversal distance between two permutation. J. Algorithms 13(1/2): 180-210, 1995.
7. S. Hannenhalli and P. Pevzner. Transforming men into mice-polynomial algorithm for computing genomic distance problem. Proc. 36th IEEE Symposium on Foundations of Computer Science, pp. 581-592, 1995.
8. J. Kececioglu and R. Ravi. Of mice and men: evolutionary distances between genomes under translocation. Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 604-613, 1995.