Add to ORKGAMS Subject Classification: 52B05 Abstract. A characterization is given to the distance between subtrees of a tree defined as the shortest path length between subtrees. This is a generalization of the four-point condition for tree metrics. For this, we use the theory of the tight span and obtain an extension of the famous result by Dress that a metric is a tree metric if and only if its tight span is a tree
International audienceIn this paper we consider structural comparison of sequences, that is, to comp...
We compute the k smallest spanning trees of a point set in the planar Euclidean metric in time O(n l...
We prove optimal extension results for roughly isometric relations between metric ( $${\mathbb{R}}$$...
A characterization is given to the distance between subtrees of a tree defined as the shortest path ...
Abstract. Tight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studie...
Tight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studied by other...
AbstractTight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studied ...
We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of ...
AbstractThe concept of tight extensions of a metric space is introduced, the existence of an essenti...
Abstract. In this paper we consider structural comparison of sequences, that is, to compare sequence...
Abstract. Time-span tree is a stable and consistent representation of musical structure since most e...
grantor: University of TorontoThe concept of a spanner of a graph has received a lot of at...
grantor: University of TorontoThe concept of a spanner of a graph has received a lot of at...
. We consider the problem of fitting an n \Theta n distance matrix D by a tree metric T . Let "...
International audienceIn this paper we consider structural comparison of sequences, that is, to comp...
International audienceIn this paper we consider structural comparison of sequences, that is, to comp...
We compute the k smallest spanning trees of a point set in the planar Euclidean metric in time O(n l...
We prove optimal extension results for roughly isometric relations between metric ( $${\mathbb{R}}$$...
A characterization is given to the distance between subtrees of a tree defined as the shortest path ...
Abstract. Tight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studie...
Tight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studied by other...
AbstractTight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studied ...
We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of ...
AbstractThe concept of tight extensions of a metric space is introduced, the existence of an essenti...
Abstract. In this paper we consider structural comparison of sequences, that is, to compare sequence...
Abstract. Time-span tree is a stable and consistent representation of musical structure since most e...
grantor: University of TorontoThe concept of a spanner of a graph has received a lot of at...
grantor: University of TorontoThe concept of a spanner of a graph has received a lot of at...
. We consider the problem of fitting an n \Theta n distance matrix D by a tree metric T . Let "...
International audienceIn this paper we consider structural comparison of sequences, that is, to comp...
International audienceIn this paper we consider structural comparison of sequences, that is, to comp...
We compute the k smallest spanning trees of a point set in the planar Euclidean metric in time O(n l...
We prove optimal extension results for roughly isometric relations between metric ( $${\mathbb{R}}$$...