Cache oblivious algorithms for computing the triplet distance between trees
From MaRDI portal
Recommendations
- Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
- On the Scalability of Computing Triplet and Quartet Distances
- Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree
- Computing the rooted triplet distance between phylogenetic networks
- Computing the rooted triplet distance between phylogenetic networks
Cites work
- scientific article; zbMATH DE number 3484087 (Why is no real title available?)
- An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters
- Comparing and aggregating partially resolved trees
- Comparison of phylogenetic trees
- Computing quartet distance is equivalent to counting 4-cycles
- Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree
- Engineering a cache-oblivious sorting algorithm
- First draft of a report on the EDVAC
- Inferring evolutionary trees with strong combinatorial evidence
- On the Scalability of Computing Triplet and Quartet Distances
- Optimal algorithms for comparing trees with labeled leaves
Cited in
(5)- On the Scalability of Computing Triplet and Quartet Distances
- An efficient algorithm for the rooted triplet distance between galled trees
- Building a small and informative phylogenetic supertree
- A cubic-time algorithm for computing the trinet distance between level-1 networks
- Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
This page was built for publication: Cache oblivious algorithms for computing the triplet distance between trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5102045)
