Constructing Optimal Trees from Quartets

Journal of Algorithms

Volumn 38, Issue 1, 2001, Pages 237-259

  Bryant, David ^a   Steel, Mike ^b  

^a LIRMM   (France)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Algorithms; Consensus; Networks; Phylogenetic trees; Quartets

Indexed keywords

EID: 0348142485     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1133     Document Type: Article

References (38)

1. H.-J. Bandelt and A. Dress, Reconstructing the shape of a tree from observed dissimilarity data, Adv. Appl. Math. 7 (1986), 309-343.
2. H.-J. Bandelt and A. Dress, Weak hierarchies associated with similarity measures - an additive clustering technique, Bull. Math. Biol. 51 (1989), 133-166.
3. H.-J. Bandelt and A. Dress, A canonical decomposition theory for metrics on a finite set, Adv. Math. 92 (1992), 47-105.
4. H.-J. Bandelt and A. Dress, "A Relational Approach to Split Decomposition," Technical report, Universität Bielefeld, 1994.
5. M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCPs, and non-approximability - towards tight results, in "Proc. 36th Ann. Symp. Found. Comp. Sci. (FOCS)," pp. 422-431, 1995.
6. A. Ben-Dor, B. Chor, D. Graur, R. Ophir, and D. Pelleg, From four-taxon trees to phylogenies: the case of mammalian evolution, in "Proc. 2nd Annual Int. Conf. Comp. Mol. Biol. (RECOMB)," pp. 9-19, 1998.
7. V. Berry, "Méthodes et algorithmes pour reconstruire les arbres de l'Évolution," Ph.D. thesis, Université Montpellier II, 1997.
8. V. Berry and D. Bryant, Faster reliable phylogenetic analysis, in "Proc. 3rd Annual Int. Conf. Comp. Comp. Mol. Biol. (RECOMB)," pp. 59-68, 1999.
9. V. Berry, D. Bryant, P. Kearney, M. Li, T. Jiang, T. Wareham and H. Zhang, A practical algorithm for recovering the best supported edges in an evolutionary tree. Manuscript (1999).
10. V. Berry and O. Gascuel, Inferring evolutionary trees with strong combinatorial evidence, Theoret. Comput. Sci. 240(2) (2000), 271-298.
11. D. Bryant, Hunting for trees in binary character sets: efficient algorithms for extraction, enumeration, and optimization, J. Comput. Biol. 3 (1995), 275-288.
12. D. Bryant, "Building Trees, Hunting for Trees and Comparing Trees," Ph.D. thesis, University of Canterbury, NZ, 1997.
13. D. Bryant and M. Steel, Extension operations on sets of leaf-labelled trees, Adv. Appl. Math. 16 (1995), 425-453.
14. N. Colonius and H. H. Schulze, Tree structures for proximity data, British J. Math. Statist. Psych. 34 (1981), 167-180.
15. M. Csüros and M. Kao, Recovering evolutionary trees through harmonic greedy triplets, in "Proc. SODA," pp. 261-270, 1999.
16. W. H. E. Day and D. Sankoff, Computational complexity of inferring phylogenies by compatibility, Systems Zool. 35 (1986), 224-229.
17. M. C. H. Dekker, "Reconstruction Methods for Derivation Trees," Master's thesis, Department of Mathematics and Computer Science, Vrije Universiteit Amsterdam, 1986.
18. R. Dilworth, A decomposition theorem for partially ordered sets, Ann. of Math. 51 (1950), 161-165.
19. R. Downey and M. Fellows, Fixed-parameter tractability and completeness II, On completeness for W [1], Theoret. Comput. Sci. 141 (1996), 109-131.
20. A. Dress, Towards a theory of holistic clustering, in "Mathematical Hierarchies and Biology," pp. 271-289, Amer. Math. Soc., Providence, 1997.
21. A. Dress and D. Huson, Computing phylogenetic networks from split systems, manuscript, 1998.
22. A. Dress and M. Steel, Convex tree realizations of partitions, Math. Lett. 5 (1992), 3-6.
23. P. L. Erdös, M. Steel, L. Székeley, and T. Warnow, A few logs suffice to build (almost) all trees (1), Random Structures Algorithms 14 (1999), 153-184.
24. J. Farris, Estimating phylogenetic trees from distance matrices, Amer. Natur. 106 (951) (1972), 645-667.
25. M. Fellows, personal communication, 1997.
26. W. M. Fitch, A non-sequential method of constructing trees and hierarchical classifications, J. Mol. Evol. 18 (1981), 30-37.
27. M. Golumbic, "Algorithmic Graph Theory and Perfect Graphs," Academic Press, New York, 1980.
28. A. Gordon, Consensus supertrees: the synthesis of rooted trees containing overlapping sets of labelled leaves, J. Classification 3 (1986), 335-348.
29. D. H. Huson, S. Nettles, and T. Warnow, Obtaining highly accurate topology estimates of evolutionary trees from very short sequences, in "Proc. 3rd Annual Int. Conf. Comp. Mol. Biol. (RECOMB)," pp. 198-209, 1999.
30. T. Jiang, P. Kearney, and M. Li, Orchestrating quartets: approximation and data correction, in "Proc. 39th FOCS," pp. 416-425, 1998.
31. P. Kearney, The ordinal quartet method, in "Proc. 2nd Annual Int. Conf. Comp. Mol. Biol. (RECOMB)," pp. 125-134, 1998.
32. C. Korostensky and G. Gonnet, "Using Travelling Salesman Problem Algorithms for Evolutionary Tree Construction," Technical Report 322, ETH, Zurich, 1999.
33. V. Makarenkov and B. Leclerc, Circular orders of tree metrics, and their uses for the reconstruction and fitting of phylogenetic trees, in "Mathematical Hierarchies and Biology," pp. 183-208, Amer. Math. Soc., Providence, 1997.
34. F. R. McMorris, D. B. Meronk, and D. A. Neumann, A view of some consensus methods for trees, in "Numerical Taxonomy" (J. Felsenstein, Ed.), pp. 122-125, Springer-Verlag, Berlin/New York, 1983.
35. S. Sattath and A. Tversky, Additive similarity trees, Psychometrika 42 (1977), 319-345.
36. M. Steel, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification 9 (1992), 91-116.
37. K. Strimmer and A. von Haeseler, Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies, Mol. Biol. Evol. 13 (1996), 964-969.
38. S. Willson, Measuring inconsistency in phylogenetic trees, J. Theoret. Biol. 190 (1998), 15-36.