An efficient algorithm for the rooted triplet distance between galled trees
The authors present a faster approach for calculating the rooted triplet distance between two galled trees (a special case of phylogenetic networks in which all underlying cycles are vertex disjoint) and thus reduce the algorithm complexity from \(O(n^{2.687})\) to \(O(n\log{n})\), with \(n\) is the number of leaves. Following an overview of existing algorithms and a formal summary of concepts, the authors present the new approach based on a transformation of the input and the method developed for counting common resolved triplets and common fan triplets. For the entire collection see [Zbl 1365.92002].
- Computing the rooted triplet distance between galled trees by counting triangles
- Computing the rooted triplet distance between galled trees by counting triangles
- Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree
- Fast algorithms for the rooted triplet distance between caterpillars
- Cache oblivious algorithms for computing the triplet distance between trees
- Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
- Distance Approximating Trees: Complexity and Algorithms
- Determining the Hausdorff distance between trees in polynomial time
- ارائه الگوریتمی نوین برای حل مساله ساخت درخت فیلوژنتیک ریشهدار بر اساس سهتاییهای ریشهدار ورودی
- An efficient algorithm for the rooted triplet distance between galled trees
- Comparing and aggregating partially resolved trees
- Computing the rooted triplet distance between galled trees by counting triangles
- Fixed topology alignment with recombination
- scientific article; zbMATH DE number 3484087 (Why is no real title available?)
- On encodings of phylogenetic networks of bounded level
- An efficient algorithm for the rooted triplet distance between galled trees
- Computing the rooted triplet distance between galled trees by counting triangles
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
- Computing the rooted triplet distance between galled trees by counting triangles
- Algorithms for combining rooted triplets into a galled phylogenetic network
- ارائه الگوریتمی نوین برای حل مساله ساخت درخت فیلوژنتیک ریشهدار بر اساس سهتاییهای ریشهدار ورودی
- Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
- Algorithms and Computation
- Computing the rooted triplet distance between phylogenetic networks
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks
This page was built for publication: An efficient algorithm for the rooted triplet distance between galled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364900)
