Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion

DOI10.1007/s10479-010-0682-5zbMath1214.92055OpenAlexW2065761706WikidataQ57387729 ScholiaQ57387729MaRDI QIDQ542000

Pawel Marciniak, Pawel Kedziora, Piotr Formanowicz, Jacek Błażewicz, Przemyslaw Taront

Publication date: 8 June 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0682-5

zbMATH Keywords

local searchparallel algorithmsmaximum parsimonyadaptive memory programming

Mathematics Subject Classification ID

Problems related to evolution (92D15) Biochemistry, molecular biology (92C40) Parallel numerical computation (65Y05)

Uses Software

• R
• PHYLIP
• MEGA4
• MEGA
• Rose
• Rec-I-DCM3
• LVB

Cites Work

• Unnamed Item
• A tabu search algorithm for maximum parsimony phylogeny inference
• The computational complexity of inferring rooted phylogenies by parsimony
• Branch and bound algorithms to determine minimal evolutionary trees
• The Steiner problem in phylogeny is NP-complete
• Variable neighborhood search
• Heuristics for the phylogeny problem
• A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
• Tabu Search—Part I
• Algorithms on Strings, Trees and Sequences
• Adaptive memory programming: a unified view of metaheuristics