The asymmetric median tree - A new model for building consensus trees

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

Volumn 1075, Issue , 1996, Pages 234-252

  Phillips, Cynthia ^a,b   Warnow, Tandy J ^a,b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; FORESTRY; OPTIMIZATION; PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

CONSENSUS TREES; DESIRABLE FEATURES; EVOLUTIONARY TREE; K-TREES; MAXIMUM INDEPENDENT SETS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME ALGORITHMS; THE STANDARD MODEL;

TREES (MATHEMATICS);

EID: 84857044524     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_18     Document Type: Conference Paper

References (23)

1. Amir, A., and Keselman, D. Maximum agreement subtree in a set of evolutionary trees - metrics and efficient algorithms, Proceedings, FOCS ’94.
2. Barthelemy, J.P., and McMorris, F.R. (1986), The median procedure for n-trees, Journal of Classification (3), pp. 329-334.
3. M. Bellare and M. Sudan, “Improved non-approximability results”, Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, (Montreal), ACM, pp. 184-193.
4. David Bryant, “Hunting for binary trees in binary character sets: efficient algorithms for extraction, enumeration, and optimization”, Research Report #124, Department of Mathematics and Statistics, Canterbury University, Christchurch, New Zealand, April 1995.
5. Day, W.H.E. (1985), Optimal algorithms for comparing trees with labelled leaves, Journal of Classification 2, pp. 7-28.
6. Day, W.H.E., and Sankoff, D. (1986), Computational complexity of inferring phytogenies by compatibility, Systematic Zoology, 35, pp. 224-229.
7. G.F Estabrook, C.S. Johnson Jr., and F.R. McMorris (1976), A mathematical foundation for the analysis of cladistic character compatibility, Math. Biosci. 29, pp. 181-187.
8. Estabrook, G.F., and McMorris, F.R. (1980), When is one estimate of evolutionary relationships a refinement of another?, J. Math. Biosci. 10, pp. 327-373.
9. M. Farach, T. Przytycka, and M. Thorup, On the agreement of many trees, Information Processing Letters, to appear.
10. M. Farach and M. Thorup, Sparse Dynamic Programming for Evolutionary Tree Comparison, SIAM J. on Computing.
11. Farach, M. and Thorup, M. (1994), Optimal evolutionary tree comparisons by sparse dynamic programming, Proceedings, FOCS ’94.
12. Garey, M.R. and Johnson, D.S, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, NY, 1979.
13. Gusfield, D. (1991), Efficient algorithms for inferring evolutionary trees, Networks pp. 19-28.
14. 2 5) algorithm for maximum matching in bipartite graphs, SIAM J. on Computing, 1975, pp. 225-231.
15. D. S. Johnson, “A catalog of complexity classes”, in Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, Elsevier science publishing company, Amsterdam, 1990, pp. 67-161.
16. Kao, Ming. Tree contractions and evolutionary trees, submitted for publication (1995).
17. McMorris, F.R. and Steel, M. (1994), The complexity of the median procedure for binary trees. Proceedings of the 4th Conference of the International Federation of Classification Societies, Paris 1993., to be published in the series “Studies in Classification, Data Analysis, and Knowledge Organization” by Springer Verlag.
18. Page, R. D. M. (1993), Genes, Organisms, and Areas: The Problem of Multiple Lineages, Systematic Biology, 42(1), 77-84.
19. Page, R. D. M. (1993), Reconciled Trees and Cladistic Analysis of Historical Associations Between Genes, Organisms, and Areas, manuscript.
20. N. Saitou and M. Nei, The neighbor-joining method: a new method for reconstructing evolutionary trees, Mol. Biol. Evol. 4: 406-25, 1987.
21. Steel, M.A., and Warnow, T.J. (1993), Kaikoura tree theorems: Computing the maximum agreement subtree, Information Processing Letters 48, pp. 72-82.
22. Wareham, H. T. (1985) "An Efficient Algorithm for Computing Ml Consensus Trees”, Honors Dissertation, Department of Computer Science, Memorial University of Newfoundland, St. John’s, Newfoundland.
23. Warnow, T.J. (1994), Tree compatibility and inferring evolutionary history, Journal of Algorithms, 16, pp. 388-407.