Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction

被引：0
作者：
Jacek Blazewicz
Piotr Formanowicz
Pawel Kedziora
Pawel Marciniak
Przemyslaw Taront
机构：
[1] Polish Academy of Sciences,Institute of Bioorganic Chemistry
[2] Poznan University of Technology,Institute of Computing Science
来源：
Annals of Operations Research | 2011年 / 183卷
关键词：
Phylogenetic trees; Parallel algorithms; Local search; Adaptive memory programming; Maximum Parsimony;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
One of the most important aspect of molecular and computational biology is the reconstruction of evolutionary relationships. The area is well explored after decades of intensive research. Despite this fact there remains a need for good and efficient algorithms that are capable of reconstructing the evolutionary relationship in reasonable time.
引用
收藏
页码：75 / 94
页数：19
相关论文
共 55 条
[1]  
Andreatta A. A.(2005)Heuristics for the phylogeny problem Journal of Heuristics 86 429-447
[2]  
Ribeiro C. C.(2004)LVB: Parsimony and simulated annealing in the search for phylogenetic trees Bioinformatics 20 274-275
[3]  
Barker D.(1986)The computational complexity of inferring rooted phylogenies by parsimony Mathematical Biosciences 81 33-42
[4]  
Day W. H. E.(1963)The reconstruction of evolution Annals of Human Genetics 27 105-106
[5]  
Jonhson D. S.(1997)Object-oriented application frameworks Communications of the ACM 40 32-38
[6]  
Sankoff D.(1971)Toward defining the course of evolution: minimum change for a specified tree topology Systematic Zoology 20 406-416
[7]  
Edwards A. W. F.(1982)The Steiner problem in phylogeny is NP-complete Advances in Applied Mathematics 3 43-49
[8]  
Cavalli-Sforza L. L.(1989)Tabu search, Part I ORSA Journal on Computing 1 190-206
[9]  
Fayad M.(1999)Analyzing large data sets in reasonable times: solution for composite optima Cladistics 15 415-428
[10]  
Schmidt D.(1982)Branch and bound algorithms to determine minimal evolutionary trees Mathematical Biosciences 59 277-290
123456