The following pages link to (Q4410150):
Displaying 38 items.
- Minimum evolution using ordinary least-squares is less robust than neighbor-joining (Q263431) (← links)
- Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope (Q263784) (← links)
- A `stochastic safety radius' for distance-based tree reconstruction (Q289927) (← links)
- Facets of the balanced minimal evolution polytope (Q304049) (← links)
- Reconstruction of certain phylogenetic networks from their tree-average distances (Q383120) (← links)
- Approximating the balanced minimum evolution problem (Q433835) (← links)
- Polyhedral geometry of phylogenetic rogue taxa (Q545631) (← links)
- The neighbor-net algorithm (Q550258) (← links)
- Robustness of phylogenetic inference based on minimum evolution (Q611949) (← links)
- An algebraic hypothesis about the primeval genetic code architecture (Q733255) (← links)
- Fast neighbor joining (Q1019174) (← links)
- Melzak algorithm for phylogenetic spaces (Q1405934) (← links)
- Estimating phylogenetic trees from pairwise likelihoods and posterior probabilities of substitution counts (Q1783523) (← links)
- On the consistency of the minimum evolution principle of phylogenetic inference (Q1868712) (← links)
- On the approximability of the fixed-tree balanced minimum evolution problem (Q2047219) (← links)
- Fast and accurate branch support calculation for distance-based phylogenetic placements (Q2163944) (← links)
- An information theory perspective on the balanced minimum evolution problem (Q2183221) (← links)
- Tumor classification using phylogenetic methods on expression data (Q2187663) (← links)
- Fishing for minimum evolution trees with neighbor-nets (Q2350587) (← links)
- Neighborhoods of trees in circular orderings (Q2352433) (← links)
- Split-facets for balanced minimal evolution polytopes and the permutoassociahedron (Q2359121) (← links)
- The balanced minimum evolution problem under uncertain data (Q2446823) (← links)
- Consistent formulas for estimating the total lengths of trees (Q2486066) (← links)
- Reconstruction of large phylogenetic trees: a parallel approach (Q2500323) (← links)
- An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees (Q2569414) (← links)
- A tutorial on the balanced minimum evolution problem (Q2670555) (← links)
- Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets (Q2784454) (← links)
- The balanced minimum evolution problem (Q2815445) (← links)
- Modeling the distribution of distance data in Euclidean space (Q2979650) (← links)
- Combinatorics of least-squares trees (Q3073998) (← links)
- Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species (Q3225114) (← links)
- Large-Scale Multiple Sequence Alignment and Phylogeny Estimation (Q4992756) (← links)
- Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? (Q4992757) (← links)
- Testing for genetic mutation of seasonal influenza virus (Q5058221) (← links)
- (Q5111799) (← links)
- A novel approach to phylogenetic trees: <i>d</i>‐Dimensional geometric Steiner trees (Q5191133) (← links)
- The minimum evolution problem: Overview and classification (Q5191134) (← links)
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem (Q6106606) (← links)
