Heuristics for the phylogeny problem
From MaRDI portal
Recommendations
Cited in
(12)- Variable neighbourhood search: Methods and applications
- Variable neighbourhood search: methods and applications
- Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
- A tabu search algorithm for maximum parsimony phylogeny inference
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
- PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion
- Walking tree heuristics for biological string alignment, gene location, and phylogenies
- Comparing different operators and models to improve a multiobjective artificial bee colony algorithm for inferring phylogenies
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
- Generalizations on the parsimony question in evolution
- Scatter search with path relinking for phylogenetic inference
This page was built for publication: Heuristics for the phylogeny problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850993)