A tabu search algorithm for maximum parsimony phylogeny inference

DOI10.1016/j.ejor.2005.10.031zbMath1109.90342OpenAlexW2012266159MaRDI QIDQ853081

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

zbMATH Keywords

tabu searchbioinformaticsmaximum parsimonyphylogeny inference

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Protein sequences, DNA sequences (92D20)

Related Items (2)

Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion ⋮ Mathematical optimization ideas for biodiversity conservation

Uses Software

• PHYLIP
• PAUP*
• Gaphyl

Cites Work

• Unnamed Item
• Unnamed Item
• Comparison of phylogenetic trees
• 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
• Tabu Search—Part I
• Biological Sequence Analysis
• Bayesian Phylogenetic Inference via Markov Chain Monte Carlo Methods
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers

This page was built for publication: A tabu search algorithm for maximum parsimony phylogeny inference