Reconciling taxonomy and phylogenetic inference: Formalism and algorithms for describing discord and inferring taxonomic roots

Algorithms for Molecular Biology

Volumn 7, Issue 1, 2012, Pages

  Matsen, Frederick A ^a   Gallagher, Aaron ^a  

^a Fred Hutchinson Cancer Research Center   (United States)

Author keywords

Algorithms; Branch and bound; Convex coloring; Dynamic program; Phylogenetics; Taxononomy

Indexed keywords

EID: 84860334363     PISSN: None     EISSN: 17487188     Source Type: Journal    
DOI: 10.1186/1748-7188-7-8     Document Type: Article

References (14)

1. Dalevi D, DeSantis T, Fredslund J, Andersen G, Markowitz V, Hugenholtz P. Automated group assignment in large phylogenetic trees using GRUNT: GRouping, Ungrouping, Naming Tool. BMC Bioinformatics 2007, 8:402. 10.1186/1471-2105-8-402, 2228325, 17949484.
2. McDonald D, Price M, Goodrich J, Nawrocki E, DeSantis T, Probst A, Andersen G, Knight R, Hugenholtz P. An improved Greengenes taxonomy with explicit ranks for ecological and evolutionary analyses of bacteria and archaea. The ISME Journal 2012, 6:610-618. 10.1038/ismej.2011.139, 3280142, 22134646.
3. Moran S, Snir S. Efficient approximation of convex recolorings. Journal of Computer and System Sciences 2007, 73:1078-1089.
4. Moran S, Snir S. Convex recolorings of strings and trees: Definitions, hardness results and algorithms. Journal of Computer and System Sciences 2008, 74(5):850-869.
5. Hein J, Jiang T, Wang L, Zhang K. On the complexity of comparing evolutionary trees. Discrete Applied Mathematics 1996, 71(1-3):153-169.
6. Bodlaender HL, Fellows MR, Langston MA, Ragan MA, Rosamond FA, Weyer M. Quadratic kernelization for convex recoloring of trees. Proceedings of COCOON 2007. Springer 2007, 86-96.
7. Berend D, Tassa T. Improved bounds on Bell numbers and on moments of sums of random variables. Probability and Mathematical Statistics 2010, 30(2).
8. Bachoore E, Bodlaender H. Convex recoloring of leaf-colored trees. Proc 3rd ACiD. Texts in Algorithmics 2006, 9:19-33.
9. Ponta O, Hüffner F, Niedermeier R. Speeding up dynamic programming for some NP-hard graph recoloring problems. Proceedings of the 5th international conference on Theory and applications of models of computation 2008, 490-501. Springer-Verlag.
10. Stamatakis A. RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models. Bioinformatics 2006, 22(21):2688. 10.1093/bioinformatics/btl446, 16928733.
11. Price M, Dehal P, Arkin A. FastTree 2-approximately maximum-likelihood trees for large alignments. PLoS One 2010, 5(3):e9490. 10.1371/journal.pone.0009490, 2835736, 20224823.
12. OCaml. , http://caml.inria.fr/ocaml/index.en.html
13. Tatusov R, Fedorova N, Jackson J, Jacobs A, Kiryutin B, Koonin E, Krylov D, Mazumder R, Mekhedov S, Nikolskaya A, et al. The COG database: an updated version includes eukaryotes. BMC Bioinformatics 2003, 4:41. 10.1186/1471-2105-4-41, 222959, 12969510.
14. Yap VB, Speed T. Rooting a phylogenetic tree with nonreversible substitution models. BMC Evolutionary Biology 2005, 5:2. 10.1186/1471-2148-5-2, 544347, 15629063.