scientific article; zbMATH DE number 7559026
From MaRDI portal
Publication:5090333
DOI10.4230/LIPIcs.WABI.2018.8zbMath1494.92081MaRDI QIDQ5090333
No author found.
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
maximum likelihoodneighbor joiningsample complexityphylogeny estimationabsolute fast converging methodsshort quartets
Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Phase transition in the sample complexity of likelihood-based phylogeny inference
- The performance of neighbor-joining methods of phylogenetic reconstruction
- Taxonomy with confidence
- Recovering a tree from the leaf colourations it generates under a Markov model
- A note on the metric properties of trees
- Fast phylogeny reconstruction through learning of ancestral sequences
- A few logs suffice to build (almost) all trees. II
- Weighted sums of certain dependent random variables
- Fast Error-Tolerant Quartet Phylogeny Algorithms
- Toward Extracting All Phylogenetic Information from Matrices of Evolutionary Distances
- A few logs suffice to build (almost) all trees (I)
- Phase transitions in phylogeny
- Computational Phylogenetics
- The Performance of Phylogenetic Methods on Trees of Bounded Diameter
This page was built for publication:
