A characterization of dissimilarity families of trees

Abstract: Let

c a l T = (T, w)

be a weighted finite tree with leaves

1, ..., n

.For any

I := i_{1}, ..., i_{k} s u b s e t 1, ..., n

, let

D_{I} (c a l T)

be the weight of the minimal subtree of

T

connecting

i_{1}, ..., i_{k}

; the

D_{I} (c a l T)

are called

k

-weights of

c a l T

. Given a family of real numbers parametrized by the

k

-subsets of

1, ..., n

,

{D_{I}}_{I i n 1, ..., n c h o o s e k}

, we say that a weighted tree

c a l T = (T, w)

with leaves

1, ..., n

realizes the family if

D_{I} (c a l T) = D_{I}

for any

I

. In 2006 Levy, Yoshida and Pachter defined, for any positive-weighted tree

c a l T = (T, w)

with

1, ..., n

as leaf set and any

i, j i n 1, ..., n

, the numbers

S_{i, j}

to be

s u m_{Y i n 1, ..., n - i, j c h o o s e k - 2} D_{i, j, Y} (c a l T)

; they proved that there exists a positive-weighted tree

c a l T' = (T^{'}, w^{'})

such that

D_{i, j} (c^{'} a l T) = S_{i, j}

for any

i, j i n 1, ..., n

and that this new tree is, in some way, similar to the given one. In this paper, by using the

S_{i, j}

defined by Levy, Yoshida and Pachter, we characterize families of real numbers parametrized by

1, ..., n c h o o s e k

that are the families of

k

-weights of weighted trees with leaf set equal to

1, ...., n

and weights of the internal edges positive.

Recommendations

Cites work

Cited in

(17)

This page was built for publication: A characterization of dissimilarity families of trees