Fast local search for unrooted Robinson-Foulds supertrees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6674 LNBI, Issue , 2011, Pages 184-196

  Chaudhary, Ruchi ^a   Burleigh, J Gordon ^b   Fernández Baca, David ^a  

^a Iowa State University   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAST LOCAL SEARCHES; LOCAL SEARCH ALGORITHM; LOCAL SEARCH HEURISTICS; NP-HARD; SUPERTREE;

BIOINFORMATICS; BIOLOGY; HEURISTIC ALGORITHMS; PLANT EXTRACTS;

TREES (MATHEMATICS);

EID: 79955802504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21260-4_20     Document Type: Conference Paper

References (30)

1. Allen, B.L., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics 5, 1-13 (2001)
2. Bansal, M.S., Burleigh, J.G., Eulenstein, O., Fernández-Baca, D.: Robinson-Foulds supertrees. Algorithms for Molecular Biology 5, 18 (2010)
3. Baum, B.R.: Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. Taxon 41, 3-10 (1992)
4. Beck, R.M.D., Bininda-Emonds, O.R.P., Cardillo, M., Liu, F.R., Purvis, A.: A higher-level MRP supertree of placental mammals. BMC Evolutionary Biology 6, 93 (2006)
5. Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88-94. Springer, Heidelberg (2000)
6. Bininda-Emonds, O.R.P., Beck, R.M.D., Purvis, A.: Getting to the roots of matrix representation. Syst. Biol. 54, 668-672 (2005)
7. Bininda-Emonds, O.R.P., Cardillo, M., Jones, K.E., MacPhee, R.D.E., Beck, R.M.D., Grenyer, R., Price, S.A., Vos, R.A., Gittleman, J.L., Purvis, A.: The delayed rise of presentday mammals. Nature 446, 507-512 (2007)
8. Bininda-Emonds, O.R.P., Sanderson, M.J.: Assessment of the accuracy of matrix representation with parsimony analysis supertree construction. Systematic Biology 50, 565-579 (2001)
9. Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics 8, 409-423 (2004)
10. Cardillo, M., Bininda-Emonds, O.R.P., Boakes, E., Purvis, A.: A species-level phylogenetic supertree of marsupials. Journal of Zoology 264, 11-31 (2004)
11. Chen, D., Eulenstein, O., Fernández-Baca, D., Burleigh, J.G.: Improved heuristics for minimum-flip supertree construction. Evolutionary Bioinformatics 2, 347-356 (2006)
12. Creevey, C.J., McInerney, J.O.: Clann: Investigating phylogenetic information through supertree analyses. Bioinformatics 21(3), 390-392 (2005)
13. Davies, T.J., Barraclough, T.G., Chase, M.W., Soltis, P.S., Soltis, D.E., Savolainen, V.: Darwin's abominable mystery: insights from a supertree of the angiosperms. Proceedings of the National Academy of Sciences of the United States of America 101, 1904-1909 (2004)
14. Eulenstein, O., Chen, D., Burleigh, J.G., Fernández-Baca, D., Sanderson, M.J.: Performance of flip supertree construction with a heuristic algorithm. Systematic Biology 53, 299-308 (2003)
15. Ganapathy, G., Ramachandran, V., Warnow, T.: Better hill-climbing searches for parsimony. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol. 2812, pp. 245-258. Springer, Heidelberg (2003)
16. Ganapathy, G., Ramachandran, V., Warnow, T.: On contract-and-refine transformations between phylogenetic trees. In: SODA, pp. 900-909 (2004)
17. Goloboff, P.A.: Analyzing large data sets in reasonable times: Solutions for composite optima. Cladistics 15, 415-428 (1999)
18. Goloboff, P.A.: Minority rule supertrees? MRP, compatibility, and minimum flip display the least frequent groups. Cladistics 21, 282-294 (2005)
19. Holland, B., Penny, D., Hendy, M.: Outgroup misplacement and phylogenetic inaccuracy under a molecular clock - a simulation study. Syst. Biol. 52, 229-238 (2003)
20. Huelsenbeck, J., Bollback, J., Levine, A.: Inferring the root of a phylogenetic tree. Syst. Biol. 51, 32-43 (2002)
21. McMorris, F.R., Steel, M.A.: The complexity of the median procedure for binary trees. In: Proceedings of the International Federation of Classification Societies (1993)
22. Pisani, D., Wilkinson, M.: MRP, taxonomic congruence and total evidence. Systematic Biology 51, 151-155 (2002)
23. Pisani, D., Yates, A.M., Langer, M.C., Benton, M.J.: A genus-level supertree of the Dinosauria. Proceedings of the Royal Society of London 269, 915-921 (2002)
24. Purvis, A.: A modification to Baum and Ragan's method for combining phylogenetic trees. Systematic Biology 44, 251-255 (1995)
25. Ragan, M.A.: Phylogenetic inference based on matrix representation of trees.Molecular Phylogenetics and Evolution 1, 53-58 (1992)
26. Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Mathematical Biosciences 53, 131-147 (1981)
27. Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)
28. Smith, A.: Rooting molecular trees: problems and strategies. Biol. J. Linn. Soc. 51, 279-292 (1994)
29. Wheeler, W.: Nucleic acid sequence phylogeny and random outgroups. Cladistics 6, 363-368 (1990)
30. Yap, V., Speed, T.: Rooting a phylogenetic tree with nonreversible substitution models. BMC Evol. Biol. 5, 2 (2005)