The performance of neighbor-joining methods of phylogenetic reconstruction
From MaRDI portal
Publication:1125450
DOI10.1007/PL00008277zbMath0938.68747OpenAlexW2038876634MaRDI QIDQ1125450
Publication date: 7 February 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00008277
Related Items (36)
Combining polynomial running time and fast convergence for the disk-covering method. ⋮ Steps toward accurate reconstructions of phylogenies from gene-order data. ⋮ Consistency and inconsistency of consensus methods for inferring species trees from gene trees in the presence of ancestral population structure ⋮ Split-facets for balanced minimal evolution polytopes and the permutoassociahedron ⋮ Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges ⋮ Towards optimal distance functions for stochastic substitution models ⋮ Cyclic permutations and evolutionary trees ⋮ A `stochastic safety radius' for distance-based tree reconstruction ⋮ Characterizing local optima for maximum parsimony ⋮ An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances ⋮ Comparing evolutionary distances via adaptive distance functions ⋮ On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction ⋮ Phylogenetic placement problem: a hyperbolic embedding approach ⋮ Maximum likelihood estimates of pairwise rearrangement distances ⋮ A tutorial on the balanced minimum evolution problem ⋮ Robustness of phylogenetic inference based on minimum evolution ⋮ \( F_{S T}\) and the triangle inequality for biallelic markers ⋮ Expanding the class of global objective functions for dissimilarity-based hierarchical clustering ⋮ Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis ⋮ UPGMA and the normalized equidistant minimum evolution problem ⋮ `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers ⋮ Mathematical and simulation-based analysis of the behavior of admixed taxa in the neighbor-joining algorithm ⋮ Reconstructing trees from subtree weights. ⋮ The neighbor-net algorithm ⋮ A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences ⋮ The Geometry of the Neighbor-Joining Algorithm for Small Trees ⋮ The minimum evolution problem: Overview and classification ⋮ Unnamed Item ⋮ Network delay inference from additive metrics ⋮ Estimating phylogenetic trees from pairwise likelihoods and posterior probabilities of substitution counts ⋮ Consistency and identifiability of the polymorphism-aware phylogenetic models ⋮ Fast neighbor joining ⋮ Why neighbor-joining works ⋮ Large-Scale Multiple Sequence Alignment and Phylogeny Estimation ⋮ A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction ⋮ Spectral Neighbor Joining for Reconstruction of Latent Tree Models
This page was built for publication: The performance of neighbor-joining methods of phylogenetic reconstruction
