Abstract
This paper addresses the problem of approximating a dissimilarity matrix by means of a reticulogram. A reticulogram represents an evolutionary structure in which the objects may be related in a non-unique way to a common ancestor. Dendrograms and additive (phylogenetic) trees are particular cases of reticulograms. The reticulogram is obtained by adding edges (reticulations) to an additive tree, gradually improving the approximation of the dissimilarity matrix. We constructed a reticulogram representing the evolution of 12 primates. The reticulogram not only improved the data approximation provided by the phylogenetic tree, but also depicted the homoplasy contained in the data, which cannot be expressed bv a tree topology. The algorithm for reconstructing reticulograms is part of the T-Rex software package, available at URL <http://www.fas.umontreal.ca/BIOL/legendre>.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
BANDELT, H.– J. (1995): Combination of Data in Phylogenetic Analysis. Plant Systematics and Evolution Supplementum, 9, 355–361
BANDELT, H.-J. and DRESS A.W.M. (1989): Weak Hierarchies Associated with Similarity Measures - An Additive Clustering Technique. Bulletin of Mathematical Biology, 51, 133–166
BANDELT, H.-J. and DRESS A.W.M. (1992): Split Decomposition: A New and Useful Approach to Phylogenetic Analysis of Distance Data. Molecular Phylogenetics and Evolution 1, 242–252
HAYASAKA, K., GOJOBORI, T., and HORAI, S. (1988): Molecular phylogeny and evolution of primate mitochondrial DNA. Molecular Biology and Evolution, 5, 626–644
KLAUER, K.C. and CARROLL, J.D. (1989): A Mathematical Programming Approach for Fitting General Graphs. Journal of Classification, 6, 247–270
MAKARENKOV, V. and LECLERC, B. (1999): An Algorithm for the Fitting of a Tree Metric According to a Weighted Least– Squares Criterion. Journal of Classification, 16, 3–27
MAKARENKOV, V. and LEGENDRE, P. (2000): General Network Representation of a Dissimilarity Matrix: Adding Reticulations to an Additive Tree. Journal of Classification (submitted)
MARGULIS, L. (1981): Symbiosis in Cell Evolution, San Francisco, CA: W. H. Freeman
ORTH, B. (1988): Representing Similarities by Distance Graphs: Monotonie Network Analysis (MONA). In: H. H. Bock (Ed.), Classification and related methods of data analysis, Amsterdam: North-Holland, 489–494
SAITOU, N. and NEI, M. (1987): The Neighbor-Joining Method: A New Method for Reconstructing Phylogenetic Trees. Molecular Biology and Evolution, 406–425
SONEA, S. and PANISSET, M. (1976): Pour une nouvelle bactériologie. Revue Canadienne de Biologie, 35, 103–167
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Makarenkov, V., Legendre, P. (2000). Improving the Additive Tree Representation of a Dissimilarity Matrix Using Reticulations. In: Kiers, H.A.L., Rasson, JP., Groenen, P.J.F., Schader, M. (eds) Data Analysis, Classification, and Related Methods. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59789-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-59789-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67521-1
Online ISBN: 978-3-642-59789-3
eBook Packages: Springer Book Archive