An immune-inspired multi-objective approach to the reconstruction of phylogenetic trees

被引:0
作者
Guilherme P. Coelho
Ana Estela A. da Silva
Fernando J. Von Zuben
机构
[1] School of Electrical and Computer Engineering (FEEC),Laboratory of Bioinformatics and Bioinspired Computing (LBiC), Department of Computer Engineering and Industrial Automation (DCA)
[2] University of Campinas (Unicamp),School of Mathematical and Nature Sciences
[3] Methodist University of Piracicaba (UNIMEP),undefined
来源
Neural Computing and Applications | 2010年 / 19卷
关键词
Phylogenetic trees; Multi-objective optimization; Artificial immune systems; Neighbor joining;
D O I
暂无
中图分类号
学科分类号
摘要
This work presents the application of the omni-aiNet algorithm—an immune-inspired algorithm originally developed to solve single and multi-objective optimization problems—to the reconstruction of phylogenetic trees. The main goal here is to automatically evolve a population of phylogenetic unrooted trees, possibly with distinct topologies, by minimizing at the same time two optimization criteria: the minimum evolution and the mean-squared error. This proposal generates, in a single run, a set of non-dominated solutions that represent the trade-offs of the two conflicting objectives, and gives the user the possibility of having distinct explanations for the differences observed at the terminal nodes of the trees. A series of experimental results is also reported in this work, in order to illustrate the effectiveness of the proposal and its capability to overcome the restrictive feedback provided by the application of well-known algorithms for phylogenetic reconstruction, such as the Neighbor Joining. Besides, the methodology presented in this work is compared to the popular NSGA-II algorithm, also modified to solve phylogenetic reconstruction problems.
引用
收藏
页码:1103 / 1132
页数:29
相关论文
共 64 条
[1]  
Kidd KK(1971)Phylogenetic analysis: concepts and methods Am J Hum Genet 23 235-252
[2]  
Sgaramella-Zonta LA(1991)Use of the method of generalized least squares in reconstructing phylogenies from sequence data Mol Biol Evol 8 868-883
[3]  
Bulmer M(1987)The neighbor-joining method: a new method for reconstructing phylogenetic trees Mol Biol Evol 4 406-425
[4]  
Saitou N(2000)Efficiencies of fast algorithms of phylogenetic inference under the criteria of maximum parsimony, minimum evolution, and maximum likelihood when a large number of sequences are used Mol Biol Evol 17 1251-1258
[5]  
Nei M(2005)Solving multiobjective optimization problems using an artificial immune system Genet Program Evol Mach 6 163-190
[6]  
Takahashi K(2002)A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Trans Evol Comput 6 182-197
[7]  
Nei M(2006)Multi-objective evolutionary algorithms and phylogenetic inference with multiple data sets Soft Comput 4 359-368
[8]  
Coello Coello CA(1997)Phylogeny estimation and hypothesis testing using maximum likelihood Annu Rev Ecol Syst 28 437-466
[9]  
Cruz Cortes N(1999)Phylogenies: an overview Stat Genet 112 81-119
[10]  
Deb K(1987)Computational complexity of inferring phylogenies from dissimilarity matrices Bull Math Biol 49 461-467