A robinson-foulds measure to compare unrooted trees with rooted trees

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

Volumn 7292 LNBI, Issue , 2012, Pages 115-126

  Górecki, Paweł ^a   Eulenstein, Oliver ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPARATIVE ANALYSIS; COMPARATIVE STUDIES; EMPIRICAL STUDIES; GENE TREE; LINEAR-TIME ALGORITHMS; PHYLOGENETIC TREES; PHYLOGENETICS; REAL DATA SETS; ROOTED TREES; ROOTINGS;

ALGORITHMS; BIOINFORMATICS; GENES;

TREES (MATHEMATICS);

EID: 84861151643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-30191-9_12     Document Type: Conference Paper

References (28)

1. Bansal, M.S., Burleigh, J.G., Eulenstein, O., Fernández-Baca, D.: Robinson-foulds supertrees. Algorithms for Molecular Biology 5, 18 (2010)
2. 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)
3. Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics 8, 409-423 (2004)
4. Bourque, M.: Abres de Steiner et reseaux dont varie l'emplagement de certains sommnets. PhD thesis, Department d'Informatique, University Montreáal, Montreáal (1978)
5. Bryant, D., Steel, M.: Computing the distribution of a tree metric. IEEE/ACM Trans. Comput. Biol. Bioinform. 6(3), 420-426 (2009)
6. Bryant, D., Tsang, J., Kearney, P.E., Li, M.: Computing the quartet distance between evolutionary trees. In: Symposium on Discrete Algorithms, pp. 285-286 (2000)
7. Chaudhary, R., Burleigh, J.G., Fernaández-Baca, D.: Fast Local Search for Unrooted Robinson-Foulds Supertrees. In: Chen, J., Wang, J., Zelikovsky, A. (eds.) ISBRA 2011. LNCS, vol. 6674, pp. 184-196. Springer, Heidelberg (2011)
8. Chen, F., Mackey, A.J., Stoeckert, C.J., Roos, D.S.: Orthomcl-db: querying a comprehensive multi-species collection of ortholog groups. Nucleic Acids Research 34(suppl.1), D363-D368
9. DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees. In: SODA, pp. 427-436 (1997)
10. Day, W.H.E.: Optimal algorithms for comparing trees with labeled leaves. Journal of Classification 2(1), 7-28 (1985)
11. Edgar, R.C.: MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research 32, 1792-1797 (2004)
12. Eulenstein, O., Mirkin, B., Vingron, M.: Duplication-based measures of difference between gene and species trees. J. Comput. Biol. 5(1), 135-148 (1998)
13. Felsenstein, J.: Inferring phylogenies. Sinauer Associates (2004)
14. Goodman, M., Czelusniak, J., Moore, G.W., Romero-Herrera, A.E., Matsuda, G.: Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Systematic Zoology 28(2), 132-163 (1979)
15. Goárecki, P., Tiuryn, J.: Dls-trees: A model of evolutionary scenarios. Theor. Comput. Sci. 359(1-3), 378-399 (2006)
16. Goárecki, P., Tiuryn, J.: Inferring phylogeny from whole genomes. Bioinformatics 23(2), e116-e222 (2007)
17. Guindon, S., Delsuc, F., Dufayard, J., Gascuel, O.: Estimating maximum likelihood phylogenies with PhyML. Methods Mol. Biol. 537, 113-137 (2009)
18. Mecham, C.A.: Theoretical and computational considerations of the compatibility of qualitative taxonomic characters. NATO ASI Series, vol. 1, pp. 304-314. Springer, Berlin (1983)
19. Mirkin, B., Muchnik, I.B., Smith, T.F.: A biologically consistent model for comparing molecular phylogenies. J. Comput. Biol. 2(4), 493-507 (1995)
20. Page, R.D.M.: Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas. Systematic Biology 43(1), 58-77 (1994)
21. Pattengale, N.D., Gottlieb, E.J., Moret, B.M.E.: Efficiently computing the robinson-foulds metric. J. Comput. Biol. 14(6), 724-735 (2007)
22. Robinson, D.F., Foulds, L.R.: Comparison of weighted labelled trees. Lecture Notes in Mathematics, vol. 748, pp. 119-126 (1979)
23. Sanderson, M., McMahon, M.: Inferring angiosperm phylogeny from est data with widespread gene duplication. BMC Evolutionary Biology 7(suppl.1) (2007)
24. Sayers, E.W., et al.: Database resources of the national center for biotechnology information. Nucleic Acids Research 37(suppl.1), D5-D15 (2009)
25. Semple, C., Steel, M.A.: Phylogenetics. Oxford University Press (2003)
26. Smith, A.: Rooting molecular trees: problems and strategies. Biol. J. Linn. Soc. 51, 279-292
27. Strimmer, K., von Haeseler, A.: Quartet puzzling: A quartet maximum likelihood method for reconstructing tree topologies. Molecular Biology and Evolution 13, 964-969 (1996)
28. Wheeler, W.: Nucleic acid sequence phylogeny and random outgroups. Cladistics - The International Journal of the Willi Hennig Society 51, 363-368 (1990)