Recovering Symbolically Dated, Rooted Trees from Symbolic Ultrametrics

57Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A well known result from cluster theory states that there is a 1-to-1 correspondence between dated, compact, rooted trees and ultrametrics. In this paper, we generalize this result yielding a canonical 1-to-1 correspondence between symbolically dated trees and symbolic ultrametrics, using an arbitrary set as the set of (possible) dates or values. It turns out that a rather unexpected new condition is needed to properly define symbolic ultrametrics so that the above correspondence holds. In the second part of the paper, we use our main result to derive, as a corollary, a theorem by H. J. Bandelt and M. A. Steel regarding a canonical 1-to-1 correspondence between additive trees and metrics satisfying the 4-point condition, both taking their values in abelian monoids. © 1998 Academic Press.

Cite

CITATION STYLE

APA

Böcker, S., & Dress, A. W. M. (1998). Recovering Symbolically Dated, Rooted Trees from Symbolic Ultrametrics. Advances in Mathematics, 138(1), 105–125. https://doi.org/10.1006/aima.1998.1743

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free