Steps toward accurate reconstructions of phylogenies from gene-order data

Journal of Computer and System Sciences

Volumn 65, Issue 3, 2002, Pages 508-525

  Moret, Bernard M E ^a   Tang, Jijun ^a   Wang, Li San ^b   Warnow, Tandy ^b  

^a University of New Mexico   (United States)

^b University of Texas at Austin   (United States)

Author keywords

Ancestral genome; Breakpoint analysis; Distance estimator; Evolutionary distance; Genome rearrangement; Inversion distance

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPHIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; TREES (MATHEMATICS);

ANCESTRAL GENOMES; BREAKPOINT ANALYSIS; DISTANCE ESTIMATOR; EVOLUTIONARY DISTANCE; GENOME REARRANGEMENT; INVERSION DISTANCE;

GENES;

EID: 23844520968     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00007-7     Document Type: Article

References (35)

1. K. Atteson, The performance of the neighbor-joining methods of phylogenetic reconstruction, Algorithmica 25 (2/3) (1999) 251-278.
2. D.A. Bader, B.M.E. Moret, GRAPPA runs in record time, HPC Wire 9 (47) (2000).
3. D.A. Bader, B.M.E. Moret, M. Yan, A linear-time algorithm for computing inversion distance between signed permutations with an experimental study, J. Comput. Biol. 8 (5) (2001) 483-491.
4. V. Bafna, P. Pevzner, Sorting permutations by transpositions, in: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA95, ACM Press, New York, 1995, pp. 614-623.
5. M. Blanchette, G. Bourque, D. Sankoff, Breakpoint phylogenies, in: S. Miyano, T. Takagi (Eds.), Genome Informatics 1997, Univ. Academy Press, Tokyo, 1997, pp. 25-34.
6. M. Blanchette, T. Kunisawa, D. Sankoff, Gene order breakpoint evidence in animal mitochondrial phylogeny, J. Mol. Evol. 49 (1998) 193-203.
7. D. Bryant, The complexity of the breakpoint median problem, Centre de Recherches Mathématiques, Technical Report CRM2579, Université de Montréal, 1998.
8. D. Bryant, A lower bound for the breakpoint phylogeny problem, in: Lecture Notes in Computer Science, Vol. 1848. Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM), Springer-Verlag, Berlin, 2000, pp. 235-247.
9. A. Caprara, Formulations and hardness of multiple sorting by reversals, in: Proceedings of the Third International Conference on Research in Computational Molecular Biology, RECOMB99, ACM Press, New York, 1999, pp. 84-93.
10. A. Caprara, G. Lancia, Experimental and statistical analysis of sorting by reversals, in: D. Sankoff, J.H. Nadeau (Eds.), Comparative Genomics, Kluwer Academic Publishers, Dordrecht, 2000, pp. 171-184.
11. W.J. Conover, Practical Nonparametric Statistics, 3rd Edition, John Wiley & Sons, New York, 1999.
12. M.E. Cosner, R.K. Jansen, B.M.E. Moret, L.A. Raubeson, L. Wang, T. Warnow, S.K. Wyman, An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae, in: D. Sankoff, J.H. Nadeau (Eds.), Comparative Genomics, Kluwer Academic Publishers, Dordrecht, 2000. pp. 99-122.
13. M.E. Cosner, R.K. Jansen, B.M.E. Moret, L.A. Raubeson, L. Wang, T. Warnow, S.K. Wyman, A new fast heuristic for computing the breakpoint phylogeny and experimental phylogenetic analyses of real and synthetic data, in: Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology ISMB-2000, 2000, pp. 104-115.
14. Workshop on Gene Order Dynamics, Comparative Maps and Multigene Families (DCAF), Montreal, Canada, August 2000.
15. DIMACS Workshop on Whole Genome Comparison, Piscataway, NJ, USA, February 2001.
16. S.R. Downie, J.D. Palmer, Use of chloroplast DNA rearrangements in reconstructing plant phylogeny, in: P. Soltis, D. Soltis, J.J. Doyle (Eds.), Plant Molecular Systematics, Chapman & Hall, London, 1992, pp. 14-35.
17. GRAPPA: Genome rearrangements analysis under parsimony and other phylogenetic algorithms, http://www.cs.unm.edu/~moret/GRAPPA/.
18. S. Hannenhalli, P. Pevzner, Transforming cabbage into turnip (polynomial algorithm for genomic distance problems), in: Proceedings of the 27th Symposium on the Theory of Computing, STOC95, ACM Press, New York, 1995, pp. 178-189.
19. M. Held, R.M. Karp, The travelling salesman problem and minimum spanning trees, Oper. Res. 18 (1970) 1138-1162.
20. R.K. Jansen, Personal communication, October 2000.
21. D.R. Maddison, D.L. Swofford, W.P. Maddison, Nexus: an extensible file format for systematic information, Sys. Biol. 46 (1997) 590-621.
22. B.M.E. Moret, D.A. Bader, T. Warnow, High-performance algorithm engineering for computational phylogenetics, in: Proceedings of the 2001 International Conference on Computational Science, San Francisco, CA, Lecture Notes in Computer Science, Vol. 2073-2074, Springer-Verlag, Berlin, 2001.
23. B.M.E. Moret, L.-S. Wang, T. Warnow, S. Wyman, New approaches for reconstructing phylogenies based on gene order, in: Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, ISMB 2001, Bioinformatics, Vol. 17, 2001, pp. S165-S173.
24. B.M.E. Moret, S.K. Wyman, D.A. Bader, T. Warnow, M. Yan, A new implementation and detailed study of breakpoint analysis, in: Proceedings of the Sixth Pacific Symposium on Biocomputing PSB 2001, World Scientific, Singapore, 2001, pp. 583-594.
25. J.H. Nadeau, B. A. Taylor, Lengths of chromosome segments conserved since divergence of man and mouse, Proceedings of the Academy of National Sciences USA 81 (1984) 814-818.
26. R.G. Olmstead, J.D. Palmer, Chloroplast DNA systematics: a review of methods and data analysis, Amer. J. Bot. 81 (1994) 1205-1224.
27. J.D. Palmer, Chloroplast and mitochondrial genome evolution in land plants, in: R. Herrmann (Ed.), Cell Organelles, Springer-Verlag, Berlin, 1992, pp. 99-133.
28. I. Pe'er, R. Shamir, The median problems for breakpoints are NP-complete, Electronic Colloquium Computational Complexity 71 (1998).
29. L.A. Raubeson, R.K. Jansen, Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants, Science 255 (1992) 1697-1699.
30. N. Saitou, M. Nei, The neighbor-joining method: a new method for reconstructing phylogenetic trees, Molecular Biology Evolution 4 (1987) 406-425.
31. D. Sankoff, M. Blanchette, Multiple genome rearrangement and breakpoint phylogeny, J. Comp. Biol. 5 (1998) 555-570.
32. D. Sankoff, M. Blanchette, Probability models for genome rearrangements and linear invariants for phylogenetic inference, in: Proceedings of the Third International Conference on Research in Computational Molecular Biology, RECOMB99, ACM Press, New York, 1999, pp. 302-309.
33. D. Swofford, G. Olson, P. Waddell, D. Hillis, Phylogenetic inference, in: D. Hillis, C. Moritz, B. Mable (Eds.), Molecular Systematics, 2nd Edition, Sinauer Associates, Switzerland, 1996 (Chapter 11).
34. L.-S. Wang, Exact-IEBP: a new technique for estimating evolutionary distances between whole genomes, in: Proceedings of the First Workshop on Algorithms in Bioinformatics WABI'01, Lecture Notes in Computer Science, Vol. 2149, Springer-Verlag, Århus, Denmark, Berlin, 2001, pp. 176-190.
35. L.-S. Wang, T. Warnow, Estimating true evolutionary distances between genomes, in: Proceedings of the 33th Annual Symposium on the Theory of Computing, STOC'01, ACM Press, New York, 2001, pp. 637-646.