Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
From MaRDI portal
Publication:4458876
Recommendations
- Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
- Automata, Languages and Programming
- A new quartet approach for reconstructing phylogenetic trees: Quartet joining method
- scientific article; zbMATH DE number 1113974
- A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method
Cited in
(15)- Why neighbor-joining works
- Spectral neighbor joining for reconstruction of latent tree models
- Learning minimal latent directed information polytrees
- scientific article; zbMATH DE number 1945175 (Why is no real title available?)
- Paralinear distance and its algorithm for hierarchical clustering of high-dimensional discrete variables
- Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
- An improved neighbor-joining method and its applications
- A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
- A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method
- A novel algebraic approach to time-reversible evolutionary models
- A new quartet approach for reconstructing phylogenetic trees: Quartet joining method
- scientific article; zbMATH DE number 3901889 (Why is no real title available?)
- Designing weights for quartet-based methods when data are heterogeneous across lineages
- Minimum tree cost quartet puzzling
- The Performance of Phylogenetic Methods on Trees of Bounded Diameter
This page was built for publication: Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458876)