Local search for the maximum parsimony problem

被引：0

作者：

Goëffon, A ^{[1
]}

Richer, JM ^{[1
]}

Hao, JK ^{[1
]}

机构：

[1] Univ Angers, LERIA, F-49045 Angers, France

来源：

ADVANCES IN NATURAL COMPUTATION, PT 3, PROCEEDINGS | 2005年 / 3612卷

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood is introduced and studied in combination with an effective array-based tree representation. Computational results are shown on a set of randomly generated benchmark instances as well as on 8 real problems (sequences of phytopathogen gamma-proteobacteria) and compared with two references from the literature.

引用

页码：678 / 683

页数：6