On the nearest neighbour interchange distance between evolutionary trees

Journal of Theoretical Biology

Volumn 182, Issue 4, 1996, Pages 463-467

  Li, Ming ^a   Tromp, John ^a,b   Zhang, Louxin ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b CW1 ^*  (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER ANALYSIS; EVOLUTION; PHYLOGENY; PRIORITY JOURNAL;

EID: 0030597058     PISSN: 00225193     EISSN: None     Source Type: Journal    
DOI: 10.1006/jtbi.1996.0188     Document Type: Article

References (14)

1. BOLAND, R. P., BROWN, E. K. & DAY, W. H. E. (1983). Approximating minimum-length-sequence metrics: a cautionary note. Math. Soc. Sci. 4, 261-270.
2. BROWN, E. K. & DAY, W. H. E. (1984) A computationally efficient approximation to the nearest neighbour interchange metric, J. Classification 1, 93-124.
3. CULIK II, K. & WOOD, D. (1982). A note on some tree similarity measures, Inf. Proc. Letts. 15, 39-42.
4. DAY, W. H. E. (1983). Properties of the Nearest Neighbour Interchange Metric for Trees of Small Size J. theor. Biol. 101, 275-288.
5. GAREY, M. R. & JOHNSON, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
6. JARVIS, J. P., LUEDEMAN, J. K. & SHIER, D. R. (1983a). Counter-examples in measuring the distance between binary trees, Math. Soc. Sci. 4, 271-274.
7. JARVIS, J. P., LUEDEMAN, J. K. & SHIER, D. R. (1983) Comments on computing the similarity of binary trees, J. theor. Biol. 100, 427-433.
8. KŘIVÁNEK, M. (1986). Computing the Nearest Neighbour Interchange Metric for Unlabeled Binary Trees is NP-Complete, J. Class. 3, 55-60.
9. KING, V. & WARNOW, T. Nov. 4 (1994). On Measuring the nni Distance Between Two Evolutionary Trees, DIMACS mini workshop on combinatorial structures in molecular biology, Rutgers University.
10. MOORE, G. W., GOODMAN, M. & BARNABAS, J. (1973). An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets, J. theor. Biol. 38, 423-457.
11. PAPADIMITRIOU, C. H. & YANNAKAKIS, M. (1991). Optimization, approximation, and complexity classes, J. Comp. Syst. Sci. 43, 425-440.
12. ROBINSON, D. F. (1971). Comparison of Labeled Trees with Valency Three, J. Combin. Theor. 11, 105-119.
13. SLEATOR, D., TARJAN, R. & THURSTON, W. (1992). Short encodings of evolving structures, SIAM J. Discrete Math. 5, 428-450.
14. WATERMAN, M. S. & SMITH, T. F. (1978). On the Similarity of Dendrograms, J. theor. Biol. 73, 789-800.