Parametric genome rearrangement

Gene

Volumn 172, Issue 1, 1996, Pages GC11-GC17

  Blanchette, Mathieu ^a   Kunisawa, Takashi ^b   Sankoff, David ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b TOKYO UNIVERSITY OF SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BACILLUS SUBTILIS; ESCHERICHIA COLI;

MITOCHONDRIAL DNA;

ALGORITHM; ARTICLE; BACILLUS SUBTILIS; CHROMOSOME INVERSION; DNA TRANSPOSITION; ESCHERICHIA COLI; GENE ORDER; GENE REARRANGEMENT; HUMAN; NONHUMAN; PHYLOGENY; PRIORITY JOURNAL;

ALGORITHMS; ANIMALS; BACILLUS SUBTILIS; DNA, MITOCHONDRIAL; DROSOPHILA; ESCHERICHIA COLI; GENE REARRANGEMENT; GENOMIC LIBRARY; HUMANS; INVERSION, CHROMOSOME;

EID: 0029993075     PISSN: 03781119     EISSN: None     Source Type: Journal    
DOI: 10.1016/0378-1119(95)00878-0     Document Type: Article

References (15)

1. Bafna, V. and Pevzner, P.A. (1993) Genome rearrangements and sorting by reversals. 34th Annu. IEEE Symp. Found. Computer Sci., SIAM J. Comput., pp. 148-157.
2. Bafna, V. and Pevzner, P.A. (1995) Sorting by transpositions. Proc. 6th Annu. ACM-SIAM Symp. Discrete Algorithms, pp. 614-623.
3. Hannenhalli, S. (1995) Polynomial algorithm for computing translocation distance between genomes. Proc. 6th Symp. Combinat. Pattern Matching, Springer-Verlag Lect. Notes Computer Sci., 162-176.
4. Hannenhalli, S., Chappey, C., Koonin, E.V. and Pevzner, P.A. (1996) Genome sequence comparison and scenarios for gene rearrangements: a test case. Genomics, in press.
5. Hannenhalli, S. and Pevzner, P.A. (1995) Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Proc. 27th Ann. ACM-SIAM Symp. Theory Comput., pp. 178-189.
6. Hannenhalli, S. and Pevzner, P.A. (1995) Transforming men into mice (polynomial algorithm for genomic distance problem). Proc. 36th Annu. Symp. Found. Computer Sci.
7. Kececioglu, J. and Ravi, R. (1995) Of mice and men. Evolutionary distances between genomes under translocation. Proc. 6th Annu. ACM-SIAM Symp. Discrete Algorithms, pp. 604-613.
8. Kececioglu, J. and Sankoff, D. (1992) Exact and approximation algorithms for sorting by reversals. Centre Rech. Math. Tech. Rep., (July) 1824.
9. Kececioglu, J. and Sankoff, D. (1993) Exact and approximation algorithms for the inversion distance between two chromosomes. Proc. 4th Symp. Combinat. Pattern Matching, Springer-Verlag Lect. Notes Computer Sci. 684, 87-105.
10. Kececioglu, J. and Sankoff, D. (1994) Efficient bounds for oriented chromosome inversion distance. Proc. 5th Symp. Combinat. Pattern Matching, Springer-Verlag Lect. Notes Computer Sci. 807, 307-325.
11. Kececioglu, J. and Sankoff, D. (1995) Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13, 180-210.
12. Kunisawa, T. (1994) Identification and chromosomal distribution of DNA segments conserved since divergence of Escherichia coli and Bacillus subtilis. J. Mol. Evol. 39.
13. Sankoff, D. (1992) Edit distance for genome comparison based on non-local operations. Proc. 3rd Symp. Combinat. Pattern Matching, Springer-Verlag Lect. Notes Computer Sci. 644, 121-135. (1992).
14. Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B.F. and Cedergren, R. (1992) Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89, 6575-6579.
15. Waterman, M.S., Eggert, M. and Lander, E. (1992) Parametric sequence comparison. Proc. Natl. Acad. Sci. USA 89, 6090-6093.