Frechet distance between weighted rooted trees
نویسندگان
چکیده
منابع مشابه
Weighted Minimum Backward Frechet Distance
The minimum backward Fréchet distance (MBFD) problem is a natural optimization problem for the weak Fréchet distance, a variant of the well-known Fréchet distance. In this problem, a threshold ε and two polygonal curves, T1 and T2, are given. The objective is to find a pair of walks on T1 and T2, which minimizes the union of the portions of backward movements while the distance between the movi...
متن کاملOn a matching distance between rooted phylogenetic trees
The Robinson–Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. U...
متن کامل4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملComputing the Rooted Triplet Distance between Galled Trees by Counting Triangles
Article history: Available online 11 October 2013
متن کاملDesigning an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natural comparison metric is the "Tree Edit Distance," the number of simple edit (insert/delete) operations needed to transform one tree into the other. Rooted-ordered trees, where the order between the siblings is significa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Matematychni Studii
سال: 2016
ISSN: 1027-4634
DOI: 10.15330/ms.48.2.165-170