An overview of phylogeny reconstruction

Handbook of Computational Molecular Biology

Volumn , Issue , 2005, Pages 19.1-19.39

  Linder, C Randal ^a   Warnow, Tandy ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85145635310     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (88)

1. A. Aho, Y. Sagiv, T. Szymanski, and J. Ullman. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. In Proc. 16th Ann. Allerton Conf. on Communication, Control, and Computing, pages 54-63, 1978.
2. D.A. Bader, B.M.E. Moret, and M. Yan. A linear-time algorithm for computing inversion distances between signed permutations with an experimental study. Journal of Computational Biology, 8(5):483-491, 2001.
3. O.R.P. Bininda-Emonds, editor. Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, volume 3 of Computational Biology. Kluwer Academics, 2004.
4. R. Boyer, A. Hunt, and S.M. Nelesen. A compressed format for collections of phylogenetic trees and improved consensus performance. Proceedings of the 5th Workshop on Algorithmics in Bioinformatics (WABI 2005), 2005. Lecture Notes in Bioinformatics, Springer, LNBI 3692.
5. D.R. Brooks and D.A. McLennan. Phylogeny, Ecology, and Behavior. University of Chicago Press, Chicago, 1991.
6. D. Bryant. A classification of consensus methods for phylogenetics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1991.
7. R.M. Bush, C.A. Bender, K. Subbarao, and N.J. Cox et al. Predicting the evolution of human influenza A. Science, 286:1921-1925, 1999.
8. A. Caprara. Formulations and complexity of multiple sorting by reversals. In S. Istrail, P.A. Pevzner, and M.S. Waterman, editors, Proceedings ofthe Third Annual International Conference on Computational Molecular Biology (RECOMB-99), pages 84-93, 1999.
9. J.T. Chang. Full reconstruction of Markov models on evolutionary trees: identifiability and consistency. Mathematical Biosciences, 137:51-73, 1996.
10. J.T. Chang. Inconsistency of evolutionary tree topology reconstruction methods when substitution rates vary across characters. Mathematical Biosciences, 134:189-215, 1996.
11. B. Chor and T. Tuller. Maximum likelihood of evolutionary trees is hard. In Proceedings ofthe 9th annual international conference on Research in Computational Molecular Biology (RECOMB) 2005, pages 296-310, 2005.
12. N. Eriksen. Approximating the expected number of inversions given the number of breakpoints. In Proceedings of the Workshop on Algorithms for Bio-Informatics (WABI), volume 2452, pages 316-330, 2002. Lecture Notes in Computer Science.
13. N. Eriksen and A. Hultman. Estimating the expected reversal distance after a fixed number of reversals. Advances of Applied Mathematics, 32:439-453, 2004.
14. S.N. Evans and T. Warnow. Unidentifiable divergence times in rates-across-sites models. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1:130-134, 2005.
15. J. Felsenstein. Cases in which parsimony and compatibility methods will be positively misleading. Systematic Zoology, 27:401-410, 1978.
16. J. Felsenstein. Evolutionary trees from DNA sequences: a maximum likelihood approach. Journal ofMolecular Evolution, 17:368-376, 1981.
17. J. Felsenstein. Inferring Phylogenies. Sinauer Associates, Sunderland, Massachusetts, 2004.
18. W. Fitch. Toward defining the course of evolution: minimum change for a specified tree topology. Systematic Biology, 20:406-416, 1971.
19. L. R. Foulds and R. L. Graham. The Steiner problem in phylogeny is NP-complete. Advances in Applied Mathematics, 3:43-49, 1982.
20. O. Gascuel, editor. Mathematics of Evolution and Phylogeny. Oxford Univ. Press, 2005.
21. G. Giribet. Exploring the behavior of POY, a program for direct optimization of molecular data. Cladistics, 17:S60-S70, 2001.
22. P.A. Goloboff. Analyzing large data sets in reasonable times: solution for composite optima. Cladistics, 15:415-428, 1999.
23. A.D. Gordon. Consensus supertrees: the synthesis of rooted trees containing overlapping sets of labeled leaves. Journal of Classification, 3:335-348, 1986.
24. GRAPPA (genome rearrangements analysis under parsimony and other phylogenetic algorithms). http://www.cs.unm.edu/~moret/GRAPPA/.
25. D. Grauer and W.H. Li. Fundamentals ofMolecular Evolution. Sinauer Publishers, 2000.
26. D. Gusfield and L. Wang. New uses for uniform lifted alignments, 1999. DIMACS Series on Discrete Math and Theoretical Computer Science.
27. S. Hannenhalli and P.A. Pevzner. Towards computational theory of genome rearrangements. Computer Science Today: Recent Trends and Developments. Lecture Notes in Computer Science, 1000:184-202, 1995.
28. S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proc. of the 27th Annual Symposium on the Theory of Computing (STOC 95), pages 178-189, 1995. Las Vegas, Nevada.
29. S. Hannenhalli and P.A. Pevzner. Transforming mice into men (polynomial algorithm for genomic distance problem). In Proc. of the 36 Annual Symposium on Foundations ofComputer Science (FOCS 95), pages 581-592, 1995. Milwaukee, Wisconsin.
30. P.H. Harvey and M.D. Pagel. The Comparative Method in Evolutionary Biology. Oxford University Press, Oxford, 1991.
31. I. Holmes and W.J. Bruno. Evolutionary HMMs: a Bayesian approach to multiple alignment. Bioinformatics, 17(9):803-820, 2001.
32. J.P. Huelsenbeck, J.J. Bull, and C.W. Cunningham. Combining data in phylogenetic analysis. Trends in Ecology and Evolution, 11(4):152-158, 1996.
33. J.P. Huelsenbeck and R. Ronquist. MrBayes: Bayesian inference of phylogeny. Bioinformatics, 17:754-755, 2001.
34. W. Just. Computational complexity of multiple sequence alignment with SP-score. Journal of Computational Biology, 8(6):615-623, 2001.
35. S. Kannan, T. Warnow, and S. Yooseph. Computing the local consensus of trees. SIAM J. Computing, 27(6):1695-1724, 1995.
36. J. Kim and T. Warnow. Tutorial on phylogenetic tree estimation, 1999. Presented at the ISMB 1999 conference, available on-line at http://kim.bio.upenn.edujkim/media/ISMBtutorial.pdf.
37. B. Knudsen. Optimal multiple parsimony alignment with affine gap cost using a phylogenetic tree. In G. Benson and R. D. M. Page, editors, Workshop on Algorithms for Bioinformatics (WABI), volume 2812 of Lecture Notes in Computer Science, pages 433-446. Springer, 2003.
38. C.R. Linder and B.M.E. Moret. Tutorial on reticulate evolution. Presented at the DIMACS workshop on reticulate evolution, and available online at http://dimacs.rutgers.edu/Workshops/Reticulated_WG/slides/slides.html.
39. B. Ma, M. Li, and L. Zhang. On reconstructing species trees from gene trees in terms of duplications and losses. In Proc. 2nd Ann. Int l Conf. Comput. Mol. Biol. (RECOMB98), 1998.
40. W. Maddison. Gene trees in species trees. Systematic Biology, 46(3):523-536, 1997.
41. M.L. Metzker, D.P. Mindell, X.M. Liu, and R.G. Ptak et al. Molecular evidence of HIV-1 transmission in a criminal case. Proceedings of the National Academy of Sciences of the United States of America, 99(22):14292-14297, 2002. OCT 29.
42. I. Miklos, G. A. Lunter, and I. Holmes. A "long indel" model for evolutionary sequence alignment. Molecular Biology and Evolution, 21(3):529-540, 2004.
43. B. Moret, L.S. Wang, T. Warnow, and S. Wyman. New approaches for reconstructing phylogenies based on gene order. In Proceedings of 9th Int l Conf. on Intelligent Systems for Molecular Biology (ISMB'01), pages 165-173, 2001.
44. B.M.E. Moret, L. Nakhleh, T. Warnow, and C.R. Linder et al. Phylogenetic networks: modeling, reconstructibility, and accuracy. IEEE/ACM Transactions on Computational Biology and Biocomputing, 1(1), 2004.
45. L. Nakhleh, J. Sun, T. Warnow, and C.R. Linder et al. Towards the development of computational tools for evaluating phylogenetic network reconstruction methods. In Proc. 8th Pacific Symp. on Biocomputing (PSB 2003), 2003.
46. M. Nei, S. Kumar, and S. Kumar. Molecular Evolution and Phylogenetics. Oxford University Press, 2003.
47. K.C. Nixon. The parsimony ratchet, a new method for rapid parsimony analysis. Cladistics, 15:407-414, 1999.
48. S.P. Otto and J. Whitton. Polyploid incidence and evolution. Annual Review of Genetics, 34:401-437, 2000.
49. R. Page. Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas. Systematic Biology, 43:58-77, 1994.
50. R. Page. GeneTree: comparing gene and species phylogenies using reconciled trees. Bioinformatics, 14(9):819-820, 1998.
51. R. Page and M. Charleston. From gene to organismal phylogeny: reconciled trees and the gene tree/species tree problem. Molecular Phylogeny and Evolution, 7:231-240, 1997.
52. R. Page and M. Charleston. Reconciled trees and incongruent gene and species trees. In B. Mirkin, F. R. McMorris, F. S. Roberts, and A. Rzehtsky, editors, Mathematical hierarchies in biology, volume 37. American Math. Soc., 1997.
53. R. Page and E. Holmes. Molecular Evolution: A phylogenetic approach. Blackwell Publishers, 1998.
54. C.A. Phillips and T. Warnow. The asymmetric median tree: a new model for building consensus trees. Discrete Applied Mathematics, 71:311-335, 1996.
55. D. Posada and K.A. Crandall. Modeltest: testing the model of DNA substitution. Bioinformatics, 14(9):817-818, 1998.
56. D.R. Powell, L. Allison, and T.I. Dix. Fast, optimal alignment of three sequences using linear gap costs. Journal of Theoretical Biology, 207:325-336, 2000.
57. R. Ravi and J.D. Kececioglu. Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree. Discrete Applied Mathematics, 88:355-366, November 1998.
58. B.D. Redelings and M.A. Suchard. Joint Bayesian estimation of alignment and phylogeny. Systematic Biology, 54(3):401-418, 2005.
59. D.F. Robinson and L.R. Foulds. Comparison of phylogenetic trees. Mathematical Biosciences, 53:131-147, 1981.
60. U. Roshan, B.M.E. Moret, T.L. Williams, and T. Warnow. Performance of supertree methods on various dataset decompositions. In O.R.P. Bininda-Emonds, editor, Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, pages 301-328, 2004. Volume 3 of Computational Biology, Kluwer Academics, (Andreas Dress, series editor).
61. U. Roshan, B.M.E. Moret, T.L. Williams, and T. Warnow. Rec-I-DCM3: A fast algorithmic technique for reconstructing large phylogenetic trees. In Proc. IEEE Computer Society Bioinformatics Conference (CSB 2004), 2004. Stanford University.
62. N. Saitou and M. Nei. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4:406-425, 1987.
63. D. Sankoff and M. Blanchette. Multiple genome rearrangement and breakpoint phylogeny. Journal ofComputational Biology, 5:555-570, 1998.
64. D. Sankoff and R.J. Cedergren. Simultaneous comparison of three or more sequences related by a tree. In Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison, pages 253-264. Addison-Wesley, 1983. Chapter 9.
65. B. Schwikowski and M. Vingron. The deferred path heuristic for the generalized tree alignment problem. Journal of Compututational Biology, 4(3):415-431, 1997.
66. C. Semple and M. Steel. Phylogenetics. Oxford Series in Mathematics and its Applications, 2004.
67. A. Siepel and D. Haussler. Phylogenetic hidden Markov models. In R. Nielsen, editor, Statistical methods in molecular evolution, pages 325-351. Springer, 2005.
68. M.A. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9:91-116, 1992.
69. M.A. Steel. The maximum likelihood point for a phylogenetic tree is not unique. Systematic Biology, 43(4):560-564, 1994.
70. M.A. Steel. Recovering a tree from the leaf colourations it generates under a Markov model. Applied Mathematics Letters, 7(2):19-24, 1994.
71. M.A. Steel and D. Penny. Parsimony, likelihood, and the role of models in molecular phylogenetics. Molecular Biology and Evolution, 17(6):839-850, 2000.
72. M.A. Steel,L.A.Szekely, and M.D. Hendy. Reconstructing trees when sequence sites evolve at variable rates. Journal of Computational Biology, 1:153-163, 1994.
73. J. Stoye, D. Evers, and F. Meyer. Rose: generating sequence families. Bioinformatics, 14(2):157-163, 1998.
74. K.M. Swenson, M. Marron, J.V. Earnest-DeYoung, and B.M.E. Moret. Approximating the true evolutionary distance between two genomes. In Proc. 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05), Vancouver (Canada). SIAM Press, 2005.
75. D. L. Swofford. PAUP*: Phylogenetic analysis using parsimony (and other methods), 1996. Sinauer Associates, Sunderland, Massachusetts, Version 4.0.
76. D.L. Swofford, G.J. Olsen, P.J. Waddell, and D.M. Hillis. Phylogenetic inference. In D.M. Hillis, C. Moritz, and B.K. Mable, editors, Molecular Systematics. Sinauer Associates, Sunderland, Massachusetts, 1996.
77. J.D. Thompson, D.G. Higgins, and T.J. Gibson. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice. Nucleic Acids Research, 22:4673-4680, 1994.
78. J.L. Thorne, H. Kishino, and J. Felsenstein. An evolutionary model for maximum likelihood alignment of DNA sequences. Journal of Molecular Evolution, 33:114-124, 1991.
79. J.L. Thorne, H. Kishino, and J. Felsenstein. Inching towards reality: An improved likelihood model of sequence evolution. Journal of Molecular Evolution, 34:3-16, 1992.
80. C. Tuffley and M. Steel. Links between maximum likelihood and maximum parsimony under a simple model of site substitution. Bulletin of Mathematical Biology, 59:581-607, 1997.
81. L. Wang and T. Jiang. On the complexity of multiple sequence alignment. Journal of Computational Biology, 1:337-348, 1994.
82. L. Wang, T. Jiang, and D. Gusfield. A more efficient approximation scheme for tree alignment. SIAM Journal of Computing, 30(1):283-299, 2000.
83. L.S. Wang. Exact-IEBP: A new technique for estimating evolutionary distances between whole genomes. In Lecture Notes for Computer Sciences No. 21Ą9: Proceedings for the First Workshop on Algorithms in BioInformatics (WABI 01), pages 175-188, 2001.
84. L.S. Wang and T. Warnow. Estimating true evolutionary distances between genomes. In Proceedings of the Thirty-Third Annual ACM Symposium on the Theory of Computing (STOC'01), pages 637-646, 2001.
85. T. Warnow, B.M. Moret, and K. St. John. Absolute convergence: true trees from short sequences. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 01), pages 186-195, 2001.
86. W. Wheeler. Optimization alignment: the end of multiple sequence alignment in phylogenetics? Cladistics, 12:1-9, 1996.
87. M. Wilkinson. Common cladistic information and its consensus representation: reduced Adams and reduced cladistic consensus trees and profiles. Syst. Biol., 43 (3):343-368, 1994.
88. Z. Yang. Maximum-likelihood estimation of phylogeny from DNA sequences when substitution rates differ over sites. Molecular Biology and Evolution, 10:1396-1401, 1996.