A rapid heuristic algorithm for finding minimum evolution trees.
Explore this paper's citation graph
Summary
For searching for the globally optimal ME tree, the new algorithm is significantly faster than existing ones, thus making it relatively practical for obtaining all trees with an S value equal to or smaller than that of the NJ tree, even when a large number of taxa is involved.
- Type
- article
- Published
- 2000-08-01
- Cited by
- 5
- References
- 16
- OpenAlex
- https://openalex.org/W1993202861
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:36176046
Keywords
Tree (set theory), Algorithm, Heuristic, Best-first search, Search algorithm
References
- PAML: a program package for phylogenetic analysis by maximum likelihood
- Theoretical foundation of the minimum-evolution method of phylogenetic inference.
- An Empirical Test of Bootstrapping as a Method for Assessing Confidence in Phylogenetic Analysis
- Estimation of confidence in phylogeny: the complete-and-partial bootstrap technique.
- A stepwise algorithm for finding minimum evolution trees.
- BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data.
- The optimization principle in phylogenetic analysis tends to give incorrect topologies when the number of nucleotides or amino acids used is small.
- CONFIDENCE LIMITS ON PHYLOGENIES: AN APPROACH USING THE BOOTSTRAP
- Construction of phylogenetic trees.
- The neighbor-joining method: a new method for reconstructing phylogenetic trees.
- Phylogenetic analysis in molecular evolutionary genetics.
- PSeq-Gen: an application for the Monte Carlo simulation of protein sequence evolution along phylogenetic trees
- Statistical properties of bootstrap estimation of phylogenetic variability from nucleotide sequences. I. Four taxa with a molecular clock.
- Mammalian protein metabolism
- Artificial Intelligence: A Modern Approach
- Confidence Limits on Phylogenies: An Approach Using the Bootstrap
- Mammalian Protein Metabolism
- An Empirical Test of Bootstrapping as a Method for Assessing Confidence in Phylogenetic Analysis
- Artificial intelligence: a modern approach
- PHYLIP-Phylogeny inference package (Version 3.2)
Cited by
- Phylogenetics of North American Psoraleeae (Leguminosae): Rates and Dates in a Recent, Rapid Radiation
- NJML+: an extension of the NJML method to handle protein sequence data and computer software implementation.
- Prospects for inferring very large phylogenies by using the neighbor-joining method.
- Genetic diversity and phylogenetic characteristics of 38 Y-STR Loci in Lisu population from Kunming, Yunnan Province, Southwest China.
- Exploring Genetic Epidemiology Data with Bayesian Networks
Related papers
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- Rectangle Search: An Anytime Beam Search (Extended Version)
- Searching algorithms implementation and comparison of Eight-puzzle problem
- On the Depth between Beam Search and Exhaustive Search for Text Generation
- An Efficient A* Search Algorithm for Statistical Machine Translation
- An Optimal Admissible Tree Search
- Spider Search: An Efficient and Non-Frontier-Based Real-Time Search Algorithm
- BS*: An Admissible Bidirectional Staged Heuristic Search Algorithm
- Improved Learning-Based Design Space Exploration for Approximate Instance Generation