A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application

SIAM Journal on Computing

Volumn 30, Issue 6, 2000, Pages 1942-1961

  Jiang, Tao ^a   Kearney, Paul ^a   Li, Ming ^b  

^a University of California Riverside   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximation algorithm; Dense instance; Evolutionary tree; Quartet method; Smooth polynomial

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; RANDOM PROCESSES; RECURSIVE FUNCTIONS; THEOREM PROVING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHM; DENSE INSTANCE; EVOLUTIONAY TREES; POLYNOMIAL TIME APPROXIMATION SCHEME; QUARTET METHOD; QUARTET TOPOLOGIES; SMOOTH POLYNOMIAL;

POLYNOMIAL APPROXIMATION;

EID: 0035706064     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539799361683     Document Type: Article

References (17)

1. S. ARORA, A. FRIEZE, AND H. KAPLAN, A new rounding procedure for the assignment problem with applications to dense graph arrangement problems, in 37th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1996, pp. 21-30.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, in Proceedings of the 33rd IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, 1992, pp. 14-23.
3. A. BEN-DOR, B. CHOR, D. GRAUR, R. OPHIR, AND D. PELLEG, From four-taxon trees to phylogenies: The case of mammalian evolution, in Proceedings of the 2nd Annual International Conference on Computational Molecular Biology, ACM Press, 1998, pp. 9-19.
4. V. BERRY, private communication, LIRM, Montpellier, France, 1998.
5. V. BERRY AND O. GASCUEL, Inferring evolutionary trees with strong combinatorial evidence, in Proceedings of the 3rd Annual International Computing and Combinatorics Conference, Springer, 1997, pp. 111-123.
6. [G] D. BRYANT, Structures in Biological Classification, Ph.D. thesis, Department of Mathematics and Statistics, University of Canterbury, Canterbury, UK, 1997.
7. P. BUNEMAN, The recovery of trees from measures of dissimilarity, in Mathematics in the Archaeological and Historical Sciences, F. R. Hodson, D. G. Kendall, and P. Tautu, eds., Edinburgh University Press, Edinburgh, 1971, pp. 387-395.
8. P. ERDöS, M. STEEL, L. SZéKELY, AND T. WARNOW, Constructing big trees from short sequences, in Proceedings of the 24th International Colloquium on Automata, Languages, and Programming, Springer, 1997.
9. J. FELSENSTEIN, Evolutionary trees from DNA sequences: A maximum, likelihood approach, J. Molecular Evolution, 17 (1981), pp. 368-376.
10. J. FELSENSTEIN, Numerical methods for inferring evolutionary trees, Quarterly Review of Biology, 57 (1982), pp. 379-404.
11. P. E. KEARNEY, The ordinal quartet method, in Proceedings of the 2nd Annual International Conference on Computational Molecular Biology, ACM Press, 1998, pp. 125-134.
12. N. SAITOU AND M. NEI, The neighbor-joining method: A new method for reconstructing phylogenetic trees, Molecular Biology and Evolution, 4 (1987), pp. 406-425.
13. M. STEEL, The complexity of reconstructing trees from qualitative characters and subtrees, J. Classification, 9 (1992), pp. 91-116.
14. K. STRIMMER AND A. VON HAESELER, Quartet puzzling: A quartet maximum-likelihood method for reconstructing tree topologies, Molecular Biology and Evolution, 13 (1990), pp. 964-969.
15. D. L. SWOFFORD, G. J. OLSEN, P. J. WADDELL, AND D. M HILLIS, Phylogenetic inference, in Molecular Systematics, 2nd ed., D. M. Hillis, C. Moritz, and B. K. Mable, eds., Sinauer Associates, Sunderland, MA, 1996, pp. 407-514.
16. A. TE.MPLETON, Human origins and analysis of mitochondrial DNA sequences, Science, 255 (1991), p. 737.
17. L. VIGILANT, M. STONEKING, H. HARPENDING, H. HAWKES, AND A. C. WILSON, African populations and the evolution of human mitochondrial DNA, Science, 253 (1991), pp. 1503-1507.