Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle
From MaRDI portal
Recommendations
- The minimum evolution distance-based approach to phylogenetic inference
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- Fast phylogeny reconstruction through learning of ancestral sequences
- New absolute fast converging phylogeny estimation methods with improved scalability and accuracy
- Robustness of phylogenetic inference based on minimum evolution
- Minimal Triangulation Algorithms for Perfect Phylogeny Problems
Cited in
(42)- Fast neighbor joining
- Melzak algorithm for phylogenetic spaces
- Estimating phylogenetic trees from pairwise likelihoods and posterior probabilities of substitution counts
- On the consistency of the minimum evolution principle of phylogenetic inference
- On the approximability of the fixed-tree balanced minimum evolution problem
- Fast and accurate branch support calculation for distance-based phylogenetic placements
- An information theory perspective on the balanced minimum evolution problem
- Tumor classification using phylogenetic methods on expression data
- Using \textsc{INC} within divide-and-conquer phylogeny estimation
- Fishing for minimum evolution trees with neighbor-nets
- Neighborhoods of trees in circular orderings
- Split-facets for balanced minimal evolution polytopes and the permutoassociahedron
- The balanced minimum evolution problem under uncertain data
- Consistent formulas for estimating the total lengths of trees
- Reconstruction of large phylogenetic trees: a parallel approach
- An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees
- Minimum evolution using ordinary least-squares is less robust than neighbor-joining
- Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
- A tutorial on the balanced minimum evolution problem
- Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets
- The balanced minimum evolution problem
- A `stochastic safety radius' for distance-based tree reconstruction
- Modeling the distribution of distance data in Euclidean space
- Facets of the balanced minimal evolution polytope
- Combinatorics of least-squares trees
- Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species
- Robustness of Greedy Type Minimum Evolution Algorithms
- Reconstruction of certain phylogenetic networks from their tree-average distances
- Approximating the balanced minimum evolution problem
- Optimizing the order of taxon addition in phylogenetic tree construction using genetic al\-go\-rithm
- Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
- Rearrangements in phylogenetic inference: compare, model, or encode?
- Testing for genetic mutation of seasonal influenza virus
- scientific article; zbMATH DE number 7205098 (Why is no real title available?)
- A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
- The minimum evolution problem: Overview and classification
- Polyhedral geometry of phylogenetic rogue taxa
- The minimum evolution distance-based approach to phylogenetic inference
- The neighbor-net algorithm
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem
- Robustness of phylogenetic inference based on minimum evolution
- An algebraic hypothesis about the primeval genetic code architecture
Describes a project that uses
Uses Software
This page was built for publication: Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410150)
