Recognizing Treelike k-Dissimilarities

BANDELT, H.-J. (1990), “Recognition of Tree Metrics,” SIAM Journal on Discrete Mathematics, 3, 1–6.

BANDELT, H.-J., and DRESS, A.W.M. (1994), “An Order-Theoretic Framework for Overlapping Clustering,” Discrete Mathematics, 136, 21–37.

BOCCI, C., and COOLS, F. (2009), “A Tropical Interpretation of m-Dissimilarity Maps,” Applied Mathematics and Computation, 212, 349–356.

BUNEMAN, P. (1971), “The Recovery of Trees fromMeasures of Dissimilarity,” in Mathematics in the Archaeological and Historical Sciences, eds. D.G. Kendall and P. Tautu, Edinburgh: Edinburgh University Press, pp. 387–395.

CHEPOI, V., and FICHET, B. (2007), “A Note on Three-Way Dissimilarities and Their Relationship with Two-Way Dissimilarities,” in Selected Contributions in Data Analysis and Classification, ed. P. Brito et al., Berlin: Springer, pp. 465–475.

CULBERSON, J., and RUDNICKI, P. (1989), “A Fast Algorithm for Constructing Trees from Distance Matrices,” Information Processing Letters, 30, 215–220.

DE SOETE, G. (1983), “A Least Squares Algorithm for Fitting Additive Trees to Proximity Data,” Psychometrika, 48, 621–626.

DEZA, M.-M., and ROSENBERG, I.G. (2000), “n-Semimetrics,” European Journal of Combinatorics, 21, 797–806.

DRESS, A.W.M., HUBER, K.T., KOOLEN, J., MOULTON, V., and SPILLNER, A. (2011), Basic Phylogenetic Combinatorics, Cambridge: Cambridge University Press.

DRESS, A.W.M., and STEEL,M. (2007), “Phylogenetic Diversity over an Abelian Group,” Annals of Combinatorics, 11, 143–160.

FAITH, D.P. (1992), “Conservation Evaluation and Phylogenetic Diversity,” Biological Conservation, 61, 1–10.

FELSENSTEIN, J. (2003), Inferring Phylogenies, Sunderland, Massachusetts: Sinauer Associates.

GORDON, A.D. (1987), “A Review of Hierarchical Classification,” Journal of the Royal Statistical Society. Series A. General, 150, 119–137.

GRISHIN, N. (1999), “A Novel Approach to Phylogeny Reconstruction from Protein Sequences,” Journal of Molecular Evolution, 48, 264–273.

HAYASHI, C. (1972), “Two Dimensional Quatification Based on the Measure of Dissimilarity Among Three Elements,” Annals of the Institute of Statistical Mathematics, 24, 251–257.

HEISER,W.J., and BENNANI, M. (1997), “Triadic Distance Models: Axiomatization and Least Squares Representation,” Journal of Mathematical Psychology, 41, 189–206.

JOLY, S., and LE CALVÉ, G. (1995), “Three-Way Distances,” Journal of Classification, 12, 191–205.

LEVY, D., YOSHIDA, R., and PACHTER, L. (2006), “Beyond Pairwise Distances: Neighbor-Joining with Phylogenetic Diversity Estimates,” Molecular Biology and Evolution, 23, 491–498.

PACHTER, L., and SPEYER, D. (2004), “Reconstructing Trees from Subtree Weights,” Applied Mathematics Letters, 17, 615–621.

RUBEI, E. (2011), “Sets of Double and Triple Weights of Trees,” Annals of Combinatorics, 15, 723–734.

SCHRIJVER, A. (1986), Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics, Chichester: John Wiley & Sons Ltd.

SEMPLE, C., and STEEL, M. (2003), Phylogenetics (Vol. 24), Oxford Lecture Series in Mathematics and Its Applications, Oxford: Oxford University Press.

SMOLENSKII, Y.A. (1962), “A Method for the Linear Recording of Graphs,” U.S.S.R. Computational Mathematics and Mathematical Physics, 2, 396–397.

STEEL, M. (2005), “Phylogenetic Diversity and the Greedy Algorithm,” Systematic Biology, 54, 527–529.

WARRENS, M.J. (2010), “n-Way Metrics,” Journal of Classification, 27, 173–190.

ZARETSKY, K. (1965), “Reconstruction of a Tree from the Distances Between Its Pendant Vertices,” Uspekhi Matematicheskikh Nauk (Russian Mathematical Surveys), 20, 90–92.