Evolutionary Puzzles: An Introduction to Genome Rearrangement
- Mathieu Blanchette
- … show all 1 hide
This paper is intended to serve as an introduction to genome rearrangement and its use for inferring phylogenetic trees. We begin with a brief description of the major players of the field (chromosomes, genes, etc.) and the types of mutations that can affect them, focussing obviously on genome rearrangement. This leads to a simple mathematical representation of the data (the order of the genes on the chromosomes), and the operations that modify it (inversions, transpositions, and translocations).
We then consider the problem of inferring phylogenetic (evolutionary) trees from genetic data. We briefly present the two major approaches to solve this problem. The first one, called distance matrix method, relies on the estimation of the evolutionary distance between each pair of species considered. In the context of gene order data, a useful measure of evolutionary distance is the minimum number of basic operations needed to transform the gene order of one species into that of another. This family of algorithmic problems has been extensively studied, and we review the major results in the field.
The second approach to inferring phylogenetic trees consists of finding a minimal Steiner tree in the space of the data considered, whose leaves are the species of interest. This approach leads to much harder algorithmic problems. The main results obtained here are based on a simple evolutionary metric, the number of breakpoints.
Throughout the paper, we report on various biological data analyses done using the different techniques discussed. We also point out some interesting open problems and current research directions.
- V. Bafna and P. A. Pevzner. Sorting by transpositions. Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 95), 614–623, 1995.
- Bafna, V., Pevzner, P. A. (1995) Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome. Molecular Biology and Evolution 12: pp. 239-246
- Blanchette, M., Kunisawa, T., Sankoff, D. (1998) Gene order breakpoint evidence in animal mitochondrial phylogeny. Journal of Molecular Evolution 49: pp. 193-203 CrossRef
- Blanchette, M., Kunisawa, T., Sankoff, D. (1996) Parametric genome rearrangement. Gene 172: pp. 11-17
- A. Caprara. Sorting by Reversals is Difficult. Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB 97), 75–83, 1997.
- Cosner, M. E., Jansen, R. K., Moret, B. M. E., Raubeson, L. A., Wang, L. S., Warnow, T., and Wyman, S.. A new fast heuristic for computing the breakpoint phylogeny and a phylogenetic analysis of a group of highly rearranged chloroplast genomes.Proc. 8th Int’l Conf. on Intelligent Systems for Molecular Biology ISMB-2000, San Diego, 104–115, 2000.
- S. Hannenhalli and P. A. Pevzner. Transforming men into mice (polynomial algorithm for genomic distance problem). Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science, 581–592, 1995.
- H. Kaplan, R. Shamir and R. E. Tarjan. Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 97), 1997.
- Kececioglu, J., Sankoff, D. (1995) Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13: pp. 180-210 CrossRef
- E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys The Travelling Salesman Problem. John Wiley and Sons, 1985.
- I. Pe’er and R. Shamir. The median problems for breakpoints are NP-complete. Electronic Colloquium on Computational Complexity, Technical Report 98-071, 1998.
- Sankoff, D., Blanchette, M. (1998) Multiple genome rearrangement and breakpoint phylogeny. Journal of Computational Biology 5: pp. 555-570 CrossRef
- Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B. F., Cedergren, R. (1992) Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proceedings of the National Academy of Sciences USA 89: pp. 6575-6579 CrossRef
- Swoórd, D. L., G. J, O., P. J, W., D. M, Hillis. In: Hillis, D. M., Moritz, C., Mable, B. K. eds. (1996) In Molecular Systematics. Sinauer Assoc., Sunderland, MA. Ch., pp. 407-514
- Watterson, G. A., Ewens, W. J., Hallet, T. E., Morgan, A. (1982) The chromosome inversion problem. Journal of Theoretical Biology 99: pp. 1-7 CrossRef
- Evolutionary Puzzles: An Introduction to Genome Rearrangement
- Book Title
- Computational Science - ICCS 2001
- Book Subtitle
- International Conference San Francisco, CA, USA, May 28—30, 2001 Proceedings, Part II
- pp 1003-1011
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 1. School of Computer Science, Cybernetics and Electronic Engineering, University of Reading
- 2. Innovative Computing Lab, Computer Sciences Department, University of Tennessee
- 3. Computer Science Department, California State University
- 4. The Queen’s University of Belfast, School of Computer Science
- Author Affiliations
- 5. Department of Computer Science and Engineering, University of Washington, Box 352350, Seattle, WA, 98195-2350, USA
To view the rest of this content please follow the download PDF link above.