Retractions of finite distance functions onto tree metrics

Discrete Applied Mathematics

Volumn 91, Issue 1-3, 1999, Pages 215-233

  Moulton, Vincent ^a   Steel, Mike ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

4 point condition; Isolation index; Retraction; Trees

Indexed keywords

EID: 0000148103     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00128-0     Document Type: Article

References (20)

1. K. Atteson, The performance of neighbor-joining algorithms of phylogeny reconstruction, Proc. 3rd Ann. Int. Comput. Combinatorics Conf. 1997, pp. 101-110.
2. H.-J. Bandelt, Recognition of tree metrics, SIAM J. Discrete Math. 3 (1990) 1-6.
3. H.-J. Bandelt, A. Dress, Reconstructing the shape of a tree from observed dissimilarity data, Adv. Appl. Math. 7 (1986) 309-343.
4. H.-J. Bandelt, A. Dress, A canonical decomposition theory for metrics on a finite set, Adv. Math. 92 (1992) 47-105.
5. H.-J. Bandelt, A. Dress, A new and useful approach to phylogenetic analysis of distance data, Mol. Phyl. Evol. 1 (1992) 242-252.
6. B. Bowditch, Notes on Gromov's hyperbolicity criterion for path-metric spaces, in: E. Ghys, A. Haefliger, A. Verjovsky (Eds.), Group Theory from a Geometrical Viewpoint, World Scientific Publishing Co. Pte. Ltd., Singapore, 1991, pp. 64-167.
7. D. Bryant, and V. Moulton, A polynomial time algorithm for constructing the refined Buneman tree, Appl. Math. Lett. (1998), in press.
8. P. Buneman, The recovery of trees from measures of dissimilarity, in: F. Hodson, D. Kendall, P. Tautu (Eds.), Mathematics in the Archaeological and Historical Sciences, Edinburgh University Press, Edinburgh, 1971, pp. 387-395.
9. A. Dress, D. Huson, V. Moulton, Analyzing and visualizing sequence and distance data using SplitsTree, Discrete Appl. Math. 71 (1996) 95-110.
10. A. Dress, V. Moulton, W. Terhalle, T-Theory - an overview, Europ. J. Combin. 17 (1996) 161-175.
11. M. Farach, S. Kannan, Efficient algorithms for inverting evolution, Proc. 1996 ACM Symp. on the Foundations of Computer Science.
12. M. Gromov, Hyperbolic Groups, in: S. Gerstin (Ed.), Essays in Group Theory, MSRI Publ. vol. 8, Springer, Berlin, 1987, pp. 75-263.
13. D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks 21 (1991) 19-28.
14. D. Hillis, C. Moritz, K. Barbara, Molecular Systematics, 2nd. ed., Sinauer Associates Inc., 1996.
15. N. Jardine, R. Sibson, The construction of hierarchic and non-hierarchic classifications, Comput. J. 11 (1968) 177-184.
16. P.J. Lockhart, M.A. Steel, M.D. Hendy, D. Penny, Recovering evolutionary trees under a more realistic model of sequence evolution, Mol. Biol. Evol. 11 (1994) 605-612.
17. D. Robinson, L. Foulds, Comparison of weighted labelled trees, in: Lecture Notes in Mathematics, vol. 748, Springer, Berlin, 1979, pp. 119-129.
18. Y. A. Smolensky, A method for linear recording of graphs, USSR Comput. Math. Phys. 2 (1969) 396-397.
19. K. Wolf, P. Degens, On properties of additive tree algorithms, Conceptual and Numerical Analysis of Data, Proc. 13th Conf. of the Gesellschaft für Klasification, Springer, Berlin, 1989.
20. K. A. Zaretsky, Reconstruction of a tree from the distances between its pendant vertices, Uspekhi Math. Nauk, Russian Mathematical Surveys, 20 (1965) 90-92 (in Russian).