Δ additive and Δ ultra-additive maps, Gromov's trees, and the Farris transform

  • Authors:

  • A. Dress;B. Holland;K. T. Huber;J. H. Koolen;V. Moulton;J. Weyer-Menkhoff

  • Affiliations:

  • Max-Planck-Institut fuer Mathematik in den Naturwissenschaften, Inselstrasse 22-26, D-04103 Leipzig, Germany;Division of Applied Mathematics, KAIST, 373-1 Kusongdong, Yusongku, Daejon 305 701, Korea;School of Computing Sciences, University of East Anglia, Norwich, NR4 7TJ, UK;Division of Applied Mathematics, KAIST, 373-1 Kusongdong, Yusongku, Daejon 305 701, Korea;School of Computing Sciences, University of East Anglia, Norwich, NR4 7TJ, UK;University of Goettingen, Institute of Microbiology and Genetics, Department of Bioinformatics, Goldschmidtstr. 1, 37077 Geottingen, Germany

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2005

Quantified Score

Hi-index 0.04

Visualization

Abstract

In phylogenetic analysis, one searches for phylogenetic trees that reflect observed similarity between a collection of species in question. To this end, one often invokes two simple facts: (i) Any tree is completely determined by the metric it induces on its leaves (which represent the species). (ii) The resulting metrics are characterized by their property of being additive or, in the case of dated rooted trees, ultra-additive. Consequently, searching for additive or ultra-additive metrics A that best approximate the metric D encoding the observed similarities is a standard task in phylogenetic analysis. Remarkably, while there are efficient algorithms for constructing optimal ultra-additive approximations, the problem of finding optimal additive approximations in the l"1 or l"~ sense is NP-hard. In the context of the theory of @d-hyperbolic groups, however, good additive approximations A of a metric D were found by Gromov already in 1988 and shown to satisfy the bound@?D-A@?"~=