A tabu search algorithm for maximum parsimony phylogeny inference
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1054956 (Why is no real title available?)
- scientific article; zbMATH DE number 1897895 (Why is no real title available?)
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- Bayesian Phylogenetic Inference via Markov Chain Monte Carlo Methods
- Biological Sequence Analysis
- Branch and bound algorithms to determine minimal evolutionary trees
- Comparison of phylogenetic trees
- Tabu Search—Part I
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
Cited in
(7)- Mathematical optimization ideas for biodiversity conservation
- An algorithm for the maximum likelihood problem on evolutionary trees
- Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
- Comparing different operators and models to improve a multiobjective artificial bee colony algorithm for inferring phylogenies
- Scatter search with path relinking for phylogenetic inference
- Heuristics for the phylogeny problem
This page was built for publication: A tabu search algorithm for maximum parsimony phylogeny inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853081)