A Class of General Supertree Methods for Nested Taxa

作者: Philip Daniel , Charles Semple

DOI: 10.1137/S0895480104441462

关键词:

摘要: Amalgamating smaller evolutionary trees into a single parent tree is an important task in biology. Traditionally, the (supertree) methods used for this amalgamation take collection of leaf-labeled as their input. However, it has been recently highlighted that, practice, such input somewhat limiting and that one would like supertree collections which some interior vertices, well all leaves, are labeled [R. D. M. Page, Phylogenetic Supertrees: Combining Information to Reveal Tree Life, O. Bininda-Emonds, ed., Kluwer, Dordrecht, The Netherlands, 2004, pp. 247--265]. In paper, we describe what appears be first approach constructing show any method using satisfies particular desirable properties.

参考文章(13)
David Bryant, Charles Semple, Mike Steel, Supertree Methods for Ancestral Divergence Dates and other Applications Springer, Dordrecht. pp. 129- 150 ,(2004) , 10.1007/978-1-4020-2330-9_7
Philip Daniel, Charles Semple, Supertree Algorithms for Nested Taxa Springer, Dordrecht. pp. 151- 171 ,(2004) , 10.1007/978-1-4020-2330-9_8
Roderic D. M. Page, Taxonomy, Supertrees, and the Tree of Life Springer, Dordrecht. pp. 247- 265 ,(2004) , 10.1007/978-1-4020-2330-9_12
Roderic D.M. Page, Modified Mincut Supertrees workshop on algorithms in bioinformatics. pp. 537- 552 ,(2002) , 10.1007/3-540-45784-4_41
Mariana Constantinescu, David Sankoff, An efficient algorithm for supertrees Journal of Classification. ,vol. 12, pp. 101- 112 ,(1995) , 10.1007/BF01202270
Edward N. Adams, N-trees as nestings: Complexity, similarity, and consensus Journal of Classification. ,vol. 3, pp. 299- 317 ,(1986) , 10.1007/BF01894192
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
A. V. Aho, Y. Sagiv, T. G. Szymanski, J. D. Ullman, Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions SIAM Journal on Computing. ,vol. 10, pp. 405- 421 ,(1981) , 10.1137/0210030