Supertree Methods for Ancestral Divergence Dates and other Applications

作者: David Bryant , Charles Semple , Mike Steel

DOI: 10.1007/978-1-4020-2330-9_7

关键词:

摘要: There are many ways to combine rooted phylogenetic trees with overlapping leaf sets into a single “supertree”. The most widely used method is MRP (matrix representation parsimony analysis), but other direct methods have been developed recently. However, all these utilize typically only the discrete topology of input and ignore information that might be available. Based, for example, on fossil data or molecular dating techniques, this includes whether one particular divergence event occurred earlier later than another, actual time estimates events. ability include such in supertree construction could allow more accurate certain species divergences. This topical problem recent biological literature. In chapter, we describe way incorporate fast exact algorithm extends classic Build algorithm. approach somewhat flexible it allows any combination relative and/or absolute times. addition extension, last section chapter consists applications problems phylogenetics are, general, computationally challenging.

参考文章(22)
Roderic D.M. Page, Modified Mincut Supertrees workshop on algorithms in bioinformatics. pp. 537- 552 ,(2002) , 10.1007/3-540-45784-4_41
M. Farach, S. Kannan, T. Warnow, A robust model for finding optimal evolutionary trees Algorithmica. ,vol. 13, pp. 155- 179 ,(1995) , 10.1007/BF01188585
Mariana Constantinescu, David Sankoff, An efficient algorithm for supertrees Journal of Classification. ,vol. 12, pp. 101- 112 ,(1995) , 10.1007/BF01202270
D. Bryant, M. Steel, Extension Operations on Sets of Leaf-Labeled Trees Advances in Applied Mathematics. ,vol. 16, pp. 425- 453 ,(1995) , 10.1006/AAMA.1995.1020
Charles Semple, Mike Steel, Tree Reconstruction from Multi-State Characters Advances in Applied Mathematics. ,vol. 28, pp. 169- 184 ,(2002) , 10.1006/AAMA.2001.0772
Jean-Pierre Barthélemy, Alain Guénoche, Trees and proximity representations ,(1991)
Charles Semple, Mike Steel, A supertree method for rooted trees Discrete Applied Mathematics. ,vol. 105, pp. 147- 158 ,(2000) , 10.1016/S0166-218X(00)00202-X
Charles Semple, Reconstructing minimal rooted trees Discrete Applied Mathematics. ,vol. 127, pp. 489- 503 ,(2003) , 10.1016/S0166-218X(02)00250-0
F. R. McMorris, Tandy J. Warnow, Thomas Wimer, Triangulating Vertex-Colored Graphs SIAM Journal on Discrete Mathematics. ,vol. 7, pp. 296- 306 ,(1994) , 10.1137/S0895480192229273