Original synteny

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

Volumn 1075, Issue , 1996, Pages 159-167

  Ferretti, Vincent ^a   Nadeau, Joseph H ^b   Sankoff, David ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b MONTREAL GENERAL HOSPITAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHROMOSOMES; PATTERN MATCHING;

EDIT DISTANCE; GENE ORDERS; GENE ORIENTATION; GENOME REARRANGEMENTS; MAPPING DATA; MEDIAN PROBLEM; PHYLOGENETIC INFERENCE; RECIPROCAL TRANSLOCATION;

GENES;

EID: 84957709258     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_13     Document Type: Conference Paper

References (6)

1. S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip, (polynomial algorithm for sorting signed permutations by reversals). Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995.
2. J. Kececioglu and D. Sankoff. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica, 13:180-210, 1995.
3. D. Sankoff, R.J. Cedergren, and G. Lapalme. Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA. Journal of Molecular Evolution, 7:133-149, 1976.
4. D. Sankoff, G. Leduc, N. Antoine, B. Paquin, B.F. Lang, and R. Cedergren. Gene order compaxisons for phylogenetic inference: Evolution of the mitochondrial genome. Proceedings of the National Academy of Sciences USA 89, 6575-6579, 1992.
5. I. A. Zakharov. Measurements of similarity of synteny groups and an analysis of genome rearrangements in the evolution of mammals. In Bioinformatics, supercomputing and complex genome analysis, H. Lim, J. Fickett and C Cantor (eds), World Scientific, 1993.
6. B. Das Gupta, T. Jiang, S. Kannan, M. Li, and Z. Sweedyk. Personal communication, March 1996.