Quartets and parameter recovery for the general Markov model of sequence mutation

Applied Mathematics Research eXpress

Volumn 2004, Issue , 2004, Pages 107-131

  Allman, Elizabeth S ^a   Rhodes, John A ^b  

^a UNIVERSITY OF SOUTHERN MAINE   (United States)

^b BATES COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 55449086015     PISSN: 16871200     EISSN: 16871197     Source Type: Journal    
DOI: 10.1155/s1687120004020283     Document Type: Article

References (18)

1. E. S. Allman and J. A. Rhodes, Phylogenetic invariants for the general Markov model of sequence mutation, Math. Biosci. 186 (2003), no. 2, 113-144.
2. H.-J. Bandelt and M. A. Steel, Symmetric matrices representable by weighted trees over a cancellative abelian monoid, SIAM J. Discrete Math. 8 (1995), no. 4, 517-525.
3. A. Ben-Dor, B. Chor, D. Graur, R. Ophir, and D. Pelleg, From four-taxon trees to phylogenies: the case of mammalian evolution, Proc. 2nd Annual International Conference of Computational Molecular Biology (RECOMB) (New York), 1998, pp. 9-19.
4. V. Berry, T. Jiang, P. Kearney, M. Li, and T. Wareham, Quartet cleaning: improved algorithms and simulations, Algorithms-ESA '99 (J. Nešetř il, ed.), Lecture Notes in Comput. Sci., vol. 1643, Springer, Berlin, 1999, pp. 313-324.
5. P. Buneman, The Recovery of Trees from Measures of Dissimilarity, Mathematics in the Archeological and Historical Sciences, Edinburgh University Press, Edinburgh, 1971, pp. 387-395.
6. J. T. Chang, Full reconstruction of Markov models on evolutionary trees: identifiability and consistency, Math. Biosci. 137 (1996), no. 1, 51-73.
7. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, 2nd ed., Undergraduate Texts in Mathematics, Springer-Verlag, New York, 1997.
8. P. L. Erdos, M. A. Steel, L. A. Székely, and T. J. Warnow, A few logs suffice to build (almost) all trees. I, Random Structures Algorithms 14 (1999), no. 2, 153-184.
9. L. D. Garcia, M. Stillman, and B. Sturmfels, Algebraic geometry of Bayesian networks, preprint, 2003, http://arXiv.org/abs/math.AG/0301255.
10. T. R. Hagedorn, Determining the number and structure of phylogenetic invariants, Adv. in Appl. Math. 24 (2000), no. 1, 1-21.
11. T. R. Hagedorn and L. F. Landweber, Phylogenetic invariants and geometry, J. Theoret. Biol. 205 (2000), no. 3, 365-376.
12. J. Harris, Algebraic Geometry. A First Course, Graduate Texts in Mathematics, vol. 133, Springer-Verlag, New York, 1992.
13. S. Hoşten and S. Sullivant, Gröbner bases and polyhedral geometry of reducible and cyclic models, J. Combin. Theory Ser. A 100 (2002), no. 2, 277-301.
14. M. Steel, Recovering a tree from the leaf colourations it generates under a Markov model, Appl. Math. Lett. 7 (1994), no. 2, 19-23.
15. M. A. Steel, L. Székely, and M. D. Hendy, Reconstructing trees from sequences whose sites evolve at variable rates, J. Comput. Biol. 1 (1994), no. 2, 153-163.
16. V. Strassen, Rank and optimal computation of generic tensors, Linear Algebra Appl. 52/53 (1983), 645-685.
17. K. Strimmer and A. von Haeseler, Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies, Mol. Biol. Evol. 13 (1996), 964-969.
18. B. Sturmfels and S. Sullivant, Toric ideals of phylogenetic invariants, to appear in J. Comput. Biol.