Comparing and aggregating partially resolved trees

Theoretical Computer Science

Volumn 412, Issue 48, 2011, Pages 6634-6652

  Bansal, Mukul S ^a,b   Dong, Jianrong ^b   Fernández Baca, David ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Iowa State University   (United States)

Author keywords

Aggregation; Computational biology; Consensus; Hausdorff distance; Phylogenetic trees; Quartet distance; Triplet distance

Indexed keywords

COMPUTATIONAL BIOLOGY; CONSENSUS; HAUSDORFF DISTANCE; PHYLOGENETIC TREES; QUARTET DISTANCE; TRIPLET DISTANCE;

ALGORITHMS; BIOINFORMATICS; BIOLOGY; GEOMETRY; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; TOPOLOGY; TREES (MATHEMATICS);

PLANT EXTRACTS;

EID: 80053938817     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.08.027     Document Type: Article

References (50)

1. E.N. Adams III. N-trees as nestings: complexity, similarity, and consensus Journal of Classification 3 2 1986 299 317
2. N. Ailon, M. Charikar, and A. Newman Aggregating inconsistent information: ranking and clustering STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of Computing 2005 ACM Press New York, NY, USA 684 693 (Pubitemid 43098641)
3. B. Allen, and M. Steel Subtree transfer operations and their induced metrics on evolutionary trees Annals of Combinatorics 5 2001 1 13
4. M.S. Bansal, J. Dong, D. Fernández-Baca, Comparing and aggregating partially resolved trees. arXiv:0906.5089v1.
5. J.P. Barthélemy, and F.R. McMorris The median procedure for n-trees Journal of Classification 3 1986 329 334
6. J.J. Bartholdi, C.A. Tovey, and M.A. Trick Voting schemes for which it can be difficult to tell who won the election Social Choice and Welfare 6 1989
7. V. Berry, T. Jiang, P.E. Kearney, M. Li, and H.T. Wareham Quartet cleaning: improved algorithms and simulations Proceedings of the 7th Annual European Symposium on Algorithms LNCS vol. 1643 1999 Springer 313 324
8. O.R.P. Bininda-Emonds Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life Series on Computational Biology vol.~4 2004 Springer Berlin
9. C. Bonnard, V. Berry, and N. Lartillot Multipolar consensus for phylogenetic trees Systematic Biololgy 55 5 2006 837 843
10. G.S. Brodal, R. Fagerberg, and C.N.S. Pedersen Computing the quartet distance in time O (n log n) Algorithmica 38 2 2003 377 395
11. D. Bryant, Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis, Ph.D. thesis, Department of Mathematics, University of Canterbury, New Zealand, 1997.
12. D. Bryant A classification of consensus methods for phylogenetics M. Janowitz, F.-J. Lapointe, F. McMorris, B.B. Mirkin, F. Roberts, Bioconsensus Discrete Mathematics and Theoretical Computer Science vol.~61 2003 American Mathematical Society Providence, RI 163 185
13. J. Byrka, S. Guillemot, and J. Jansson New results on optimizing rooted triplets consistency Discrete Applied Mathematics 158 11 2010 1136 1147
14. C. Christiansen, T. Mailund, C.N. Pedersen, M. Randers, and M.S. Stissing Fast calculation of the quartet distance between trees of arbitrary degrees Algorithms for Molecular Biology 1 16 2006
15. J.A. Cotton, C.S. Slater, and M. Wilkinson Discriminating supported and unsupported relationships in supertrees using triplets Systematic Biology 55 2 2006 345 350
16. J.A. Cotton, and M. Wilkinson Quantifying the potential utility of phylogenetic characters Taxon 57 1 2008 1 6
17. D.E. Critchlow Metric Methods for Analyzing Partially Ranked Data Lecture Notes in Statist. vol.~34 1980 Springer-Verlag Berlin
18. D.E. Critchlow, D.K. Pearl, and C. Qian The triples distance for rooted bifurcating phylogenetic trees Systematic Biology 45 3 1996 323 334
19. W.H.E. Day Analysis of quartet dissimilarity measures between undirected phylogenetic trees Systematic Zoology 35 3 1986 325 333
20. P. Diaconis, and R. Graham Spearman's footrule as a measure of disarray Journal of the Royal Statistical Society, Series B 39 2 1977 262 268
21. A.C. Driskell, C. Ané, J.G. Burleigh, M.M. McMahon, B.C. O'Meara, and M.J. Sanderson Prospects for building the tree of life from large sequence databases Science 306 5699 2004 1172 1174 (Pubitemid 39488993)
22. C. Dwork, R. Kumar, M. Naor, D. Sivakumar, Rank aggregation methods for the web, in: Tenth International World Wide Web Conference, Hong Kong, May 2001.
23. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee Comparing partial rankings SIAM Journal of Discrete Mathematics 20 3 2006 628 648 (Pubitemid 47250574)
24. R. Fagin, R. Kumar, and D. Sivakumar Comparing top k lists SIAM Journal of Discrete Mathematics 2003
25. M. Farach, and M. Thorup Optimal evolutionary tree comparison by sparse dynamic programming Proc. 35th Annual Symposium on Foundations of Computer Science Piscataway, NJ 1994 IEEE Computer Society Press 770 779
26. J. Felsenstein, Inferring Phylogenies, Sinauer Assoc., Sunderland, Mass, 2003.
27. C.R. Finden, and A.D. Gordon Obtaining common pruned trees Journal of Classification 2 1 1985 225 276
28. D. Gusfield Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology 1997 Cambridge University Press Cambridge, New York, Melbourne
29. S. Kannan, T. Warnow, and S. Yooseph Computing the local consensus of trees SIAM Journal of Computing 27 6 1998 1695 1724 (Pubitemid 128691188)
30. M.-Y. Kao, T.-W. Lam, W.-K. Sung, and H.-F. Ting An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings Journal of Algorithms 40 2 2001 212 233 (Pubitemid 33667212)
31. J.G. Kemeny Mathematics without numbers Daedalus 88 1959 577 591
32. C.-M. Lee, L.-J. Hung, M.-S. Chang, C.-B. Shen, and C.-Y. Tang An improved algorithm for the maximum agreement subtree problem Information Processing Letters 94 5 2005 211 216 (Pubitemid 40643286)
33. W.P. Maddison Reconstructing character evolution on polytomous cladograms Cladistics 5 1989 365 377
34. F.R. McMorris, D.B. Meronk, and D.A. Neumann A view of some consensus methods for trees J. Felsenstein, Numerical Taxonomy 1983 Springer-Verlag 122 125
35. W. Piel, M. Sanderson, M. Donoghue, M. Walsh, Treebase. http://www.treebase.org. (accessed 02.02.07).
36. V. Ranwez, V. Berry, A. Criscuolo, P.-H. Fabre, S. Guillemot, C. Scornavacca, and E.J.P. Douzery PhySIC: A veto supertree method with desirable properties Systematic Biology 56 5 2007 798 817
37. V. Ranwez, A. Criscuolo, and E.J. Douzery Supertriplets: a triplet-based supertree approach to phylogenomics Bioinfomatics 26 ISMB 2010 2010 i115 i123
38. D.F. Robinson, and L.R. Foulds Comparison of phylogenetic trees Mathematical Biosciences 53 1981 131 147 (Pubitemid 11129084)
39. C. Scornavacca, Supertree methods for phylogenomics, Ph.D. thesis, University of Montpellier II, Montpellier, France, December 2009.
40. C. Scornavacca, V. Berry, E.J.P. Douzery, and V. Ranwez PhySIC IST: cleaning source trees to infer more informative supertrees BMC Bioinformatics 9 2008 413
41. C. Semple, and M. Steel Phylogenetics Oxford Lecture Series in Mathematics 2003 Oxford University Press Oxford
42. S. Snir, and S. Rao Using max cut to enhance rooted trees consistency IEEE/ACM Transactions on Computational Biology and Bioinformatics 3 4 2006 323 333 (Pubitemid 44950082)
43. S. Snir, and S. Rao Quartets maxcut: a divide and conquer quartets algorithm IEEE/ACM Transactions on Computational Biology and Bioinformatics 7 4 2010 704 718
44. M. Steel, and D. Penny Distributions of tree comparison metrics some new results Systematic Biology 42 2 1993 126 141
45. M.A. Steel, Distributions on bicoloured evolutionary trees. Ph.D. thesis, Massey University, 1989.
46. M. Stissing, C.N.S. Pedersen, T. Mailund, G.S. Brodal, and R. Fagerberg Computing the quartet distance between evolutionary trees of bounded degree D. Sankoff, L. Wang, F. Chin, APBC Advances in Bioinformatics and Computational Biology vol.~5 2007 Imperial College Press 101 110
47. C. Stockham, L.-S. Wang, T. Warnow, Statistically based postprocessing of phylogenetic analysis by clustering, in: ISMB, 2002, pp. 285293.
48. M.S. Swenson, R. Suri, C.R. Linder, and T. Warnow An experimental study of quartets maxcut and other supertree methods Algorithms for Molecular Biology 6 2011 7
49. J.L. Thorley, M. Wilkinson, and M.A. Charleston The information content of consensus trees A. Rizzi, A. Vichi, H.H. Bock, Advances in Data Science and Classification. Studies in Classification, Data Analysis, and Knowledge Organization 1998 Springer Berlin 91 98
50. M. Wilkinson Majority-rule reduced consensus trees and their use in bootstrapping Molecular Biology and Evolution 13 3 1996 437 444 (Pubitemid 26066095)