A tabu search algorithm for maximum parsimony phylogeny inference
From MaRDI portal
Publication:853081
DOI10.1016/J.EJOR.2005.10.031zbMATH Open1109.90342OpenAlexW2012266159MaRDI QIDQ853081FDOQ853081
Authors: Yu-Min Lin, Jeffrey L. Thorne, Shu-Cherng Fang 
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.031
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Protein sequences, DNA sequences (92D20)
Cites Work
- Biological Sequence Analysis
- Comparison of phylogenetic trees
- Tabu Search—Part I
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- Branch and bound algorithms to determine minimal evolutionary trees
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
- Bayesian Phylogenetic Inference via Markov Chain Monte Carlo Methods
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion
- Heuristics for the phylogeny problem
- 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
- An algorithm for the maximum likelihood problem on evolutionary trees
- Mathematical optimization ideas for biodiversity conservation
Uses Software
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)
