Evolutionary Algorithm for Constructing Evolutionary Trees

• Main Authors: Wu Ze-Ming, 吳智銘
• Other Authors: Chiu Chao-Chang
• Format: Others
• Language: zh-TW
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/65124817349606266690

碩士 === 元智大學 === 資訊管理研究所 === 93 === This research presents an evolutionary algorithm for constructing rooted evolutionary trees. Constructing evolutionary tree is one branch of bioinformatics, it is a binary tree generated by DNA or protein sequences. Constructing an optimal evolutionary tree is a NP-hard problem. Heuristics often are applied to combinatorial optimization problem. Related solving techniques include tabu search, ant algorithm, and so on. The searching space of an evolutionary tree usually increases exponentially by species in a tree, so it is impossible to search all evolutionary trees. Evolutionary algorithm can search for space systematically by evolutionary concept, and it can be applied to optimize the construction of evolutionary trees. However, traditional genetic operators are not appropriate for the construction of a legal evolutionary tree. Thus the design of appropriate genetic operators becomes an important research issue. We try to initialize population, and select better evolutionary in population, then extract better sub-trees from a good evolutionary tree. Finally, sub-trees in the sub-tree pool are assembled into a legal evolutionary tree. The proposed method aims to achieve a better evolutionary tree.