Heuristics for the phylogeny problem

DOI10.1023/A:1015439913121zbMATH Open1041.68546MaRDI QIDQ1850993FDOQ1850993

Celso C. Ribeiro, Alexandre A. Andreatta

Publication date: 15 December 2002

Published in: Journal of Heuristics (Search for Journal in Brave)

Recommendations

• A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
• Minimizing phylogenetic number to find good evolutionary trees
• A tabu search algorithm for maximum parsimony phylogeny inference
• scientific article; zbMATH DE number 1303534
• The balanced minimum evolution problem

zbMATH Keywords

heuristicsparsimonylocal searchphylogenetic treesevolutionary treesframeworksphylogeny problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Problems related to evolution (92D15) Software, source code, etc. for problems pertaining to biology (92-04)

Cited In (9)

• 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
• Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
• Generalizations on the parsimony question in evolution
• Variable neighbourhood search: Methods and applications
• Variable neighbourhood search: methods and applications
• Walking tree heuristics for biological string alignment, gene location, and phylogenies
• A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
• 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)