AbstractThe tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to be a tree metric, and has served as the foundation for numerous distance-based reconstruction methods in phylogenetics. Our main result is an extension of the tree-metric theorem to more general dissimilarity maps. In particular, we show that a tree with n leaves is reconstructible from the weights of the m-leaf subtrees provided that n ≥ 2m — 1
We study distorted metrics on binary trees in the context of phylogenetic reconstruction. Given a bi...
Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology....
Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology....
The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to ...
The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to ...
AbstractThe tree-metric theorem provides a necessary and sufficient condition for a dissimilarity ma...
Let T be a weighted tree with n numbered leaves and let D = (D (i, j))i, j be its distance matrix, s...
Let T be a weighted tree with n numbered leaves and let D = (D (i, j))i, j be its distance matrix, s...
Let T be a weighted tree with n numbered leaves and let D (D(i,j))(i,j) be its distance matrix, so D...
Let T be a weighted tree with n numbered leaves and let D = (D (i, j))i, j be its distance matrix, s...
AbstractThe definition of similarity measures for phylogenetic trees has been motivated by the compu...
The definition of similarity measures for phylogenetic trees has been motivated by the computation o...
Trees with positively weighted edges induce a natural metric on any subset of vertices, however not ...
Trees with positively-weighted edges induce a natural metric on any subset of vertices, however not ...
A (pseudo-)metric D on a finite set X is said to be a ‘tree metric ’ if there is a finite tree with ...
We study distorted metrics on binary trees in the context of phylogenetic reconstruction. Given a bi...
Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology....
Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology....
The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to ...
The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to ...
AbstractThe tree-metric theorem provides a necessary and sufficient condition for a dissimilarity ma...
Let T be a weighted tree with n numbered leaves and let D = (D (i, j))i, j be its distance matrix, s...
Let T be a weighted tree with n numbered leaves and let D = (D (i, j))i, j be its distance matrix, s...
Let T be a weighted tree with n numbered leaves and let D (D(i,j))(i,j) be its distance matrix, so D...
Let T be a weighted tree with n numbered leaves and let D = (D (i, j))i, j be its distance matrix, s...
AbstractThe definition of similarity measures for phylogenetic trees has been motivated by the compu...
The definition of similarity measures for phylogenetic trees has been motivated by the computation o...
Trees with positively weighted edges induce a natural metric on any subset of vertices, however not ...
Trees with positively-weighted edges induce a natural metric on any subset of vertices, however not ...
A (pseudo-)metric D on a finite set X is said to be a ‘tree metric ’ if there is a finite tree with ...
We study distorted metrics on binary trees in the context of phylogenetic reconstruction. Given a bi...
Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology....
Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology....
DOI
Add to ORKG