Rec-I-DCM3: A fast algorithmic technique for reconstructing large phylogenetic trees

Proceedings - 2004 IEEE Computational Systems Bioinformatics Conference, CSB 2004

Volumn , Issue , 2004, Pages 98-109

  Roshan, Usman W ^a   Warnow, Tandy ^a,b   Moret, Bernard M E ^c   Williams, Tiffani L ^c  

^a University of Texas at Austin   (United States)

^b HARVARD UNIVERSITY   (United States)

^c University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATIONAL METHODS; COMPUTER SIMULATION; COMPUTER SOFTWARE; ERRORS; GENES; GENETIC ALGORITHMS; HEURISTIC METHODS; ITERATIVE METHODS; MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION; POLYNOMIALS; TREES (MATHEMATICS);

DATASETS; MAXIMUM LIKELIHOOD (ML); MAXIMUM PARSIMONY (MP); PHYLOGENETIC TREES;

GENETIC ENGINEERING;

EID: 14044251530     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. O. Bininda-Emonds. Ratchet implementation in PAUP*4.0b10, 2003. Available from www.tierzucht.tum.de:8080/WWW/Homepages/Bininda-Emonds.
2. P. Buneman. A characterization of rigid circuit graphs. Discrete Mathematics, 9:205-212, 1974.
3. W. Fitch. Toward defining the course of evolution: minimum change for a specified tree topology. Syst. Zool., 20:406-416, 1971.
4. L. Foulds and R. Graham. The Steiner problem in phylogeny is NT-complete. Advances in Applied Mathematics, 3:43-49, 1982.
5. P. Goloboff. Analyzing large data sets in reasonable times: solution for composite optima. Cladistics, 15:415-428, 1999.
6. M. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, Inc., 1980.
7. D. Huson, S. Nettles, and T. Warnow. Disk-covering, a fast-converging method for phylogenetic tree reconstruction. Journal of Computational Biology, 6:369-386, 1999.
8. D. Huson, L. Vawter, and T. Warnow. Solving large scale phylogenetic problems using DCM2. In Proc. 7th Int'l Conf. on Intelligent Systems for Molecular Biology (ISMB'99), pages 118-129. AAAI Press, 1999.
9. M. Kallerjo, J. Farris, M. Chase, B. Bremer, and M. Fay. Simultaneous parsimony jackknife analysis of 2538 rbcL DNA sequences reveals support for major clades of green plants, land plants, seed plants, and flowering plants. Plant. Syst. Evol., 213:259-287,1998.
10. D. Maddison. The discovery and importance of multiple islands of most parsimonious trees. Systematic Biology, 42(2):200-210, 1991.
11. B. Maidak, J. Cole, T. Lilburn, C. P. Jr, P. Saxman, J. Stredwick, G. Garrity, B. Li, G. Olsen, S. Pramanik, T. Schmidt, and J. Tiedje. The RDP (ribosomal database project) continues. Nucleic Acids Research, 28:173-174, 2000.
12. C. Michener and R. Sokal. A quantitative approach to a problem in classification. Evolution, 11:130-162, 1957.
13. B. Moret. Towards a discipline of experimental algorithmics. In M. Goldwasser, D. Johnson, and C. McGeoch, editors. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, volume 59 of DIMACS Monographs, pages 197-213. AMS Press, 2002.
14. B. Moret and T. Warnow. Reconstructing optimal phylogenetic trees: A challenge in experimental algorithmics. In R. Fleischer, B. Moret, and E. Schmidt, editors, Experimental Algorithmics, volume 2547 of Lecture Notes in Computer Science, pages 163-180. Springer-Verlag, 2002.
15. L. Nakhleh, U. Roshan, K. St. John, J. Sun, and T. Warnow. Designing fast converging phylogenetic methods. In Proc. 9th Int'l Conf. on Intelligent Systems for Molecular Biology (ISMB'01), volume 17 of Bioinformatics, pages S190-S198. Oxford U. Press, 2001.
16. K. Nixon. The parsimony ratchet, a new method for rapid parsimony analysis. Cladistics, 15:407-414, 1999.
17. D. Quicke, J. Taylor, and A. Purvis. Changing the landscape: A new strategy for estimating large phytogenies. Systematic Biology, 50(1):60-66, 2001.
18. U. Roshan, B. Moret, T. Williams, and T. Warnow. Performance of supertree methods on various dataset decompositions. In O. Bininda-Emonds, editor, Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, volume 3 of Computational Biology, pages 301-328. Kluwer Academic Publishers, 2004.
19. N. Saitou and M. Nei. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4:406-425, 1987.
20. D. Soltis, P. Soltis, M. Chase, M. Mort, D. Albach, M. Zanis, V. Savolainen, W. Hahn, S. Hoot, M. Fay, M. Axtell, S. Swensen, L. Prince, W. Kress, K. Nixon, and J. Farris. Angiosperm phytogeny inferred from 18s rDNA, rbcL, and atpB sequences. Botanical Journal of the Linnean Society, 133:381-461, 2000.
21. D. Swofford. PAUP*: Phylogenetic analysis using parsimony (and other methods), 2002. Sinauer Associates, Sunderland, Mass., Version 4.0.
22. J. Tang and B. Moret. Scaling up accurate phylogenetic reconstruction from gene-order data. In Proc. 11th Int'l Conf. on Intelligent Systems for Molecular Biology ISMB'03, volume 19 (Suppl. 1) of Bioinformatics, pages i305-i312, 2003.
23. T. Warnow, B. Moret, and K. St. John. Absolute convergence: True trees from short sequences. In Proc. 12th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA'01), pages 186-195. SIAM Press, 2001.
24. T. Williams, B. M. T. Berger-Wolf, U. Roshan, and T. Warnow. The relationship between maximum parsimony scores and phylogenetic tree topologies. Technical Report TR-CS-2004-04, Department of Computer Science, The University of New Mexico, 2004.
25. J. Wuyts, Y. V. de Peer, T. Winkelmans, and R. D. Wachter. The European database on small subunit ribosomal RNA. Nucleic Acids Research, 30:183-185, 2002.