Fast and accurate branch support calculation for distance-based phylogenetic placements
From MaRDI portal
Publication:2163944
Recommendations
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- Algorithms and Computation
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks
- DISTANCE-BASED PHYLOGENETIC ALGORITHMS: NEW INSIGHTS AND APPLICATIONS
- scientific article; zbMATH DE number 7205098
- Distance based methods in phylogenetic tree construction
Cites work
- A few logs suffice to build (almost) all trees. II
- Absolute convergence: True trees from short sequences
- Applying the bootstrap in phylogeny reconstruction
- Bootstrap methods: another look at the jackknife
- scientific article; zbMATH DE number 1945176 (Why is no real title available?)
- scientific article; zbMATH DE number 1746438 (Why is no real title available?)
- Likelihood-based tree reconstruction on a concatenation of aligned sequence data sets can be statistically inconsistent
- On the asymptotic accuracy of Efron's bootstrap
- Scalable and accurate phylogenetic placement using pplacer-XR
Cited in
(2)
Describes a project that uses
Uses Software
This page was built for publication: Fast and accurate branch support calculation for distance-based phylogenetic placements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163944)