DocumentCode
1635745
Title
Ant algorithm for construction of evolutionary tree
Author
Ando, Shin ; Iba, Hitoshi
Author_Institution
Sch. of Eng., Univ. of Tokyo, Japan
Volume
2
fYear
2002
fDate
6/24/1905 12:00:00 AM
Firstpage
1552
Lastpage
1557
Abstract
This paper proposes an ant algorithm implemented with stack count for the purpose of designing suffix representations of tree structures. The algorithm is applied to the problem of reconstructing an evolutionary tree from nucleotide sequences. The algorithm shows compatible results in simulated experiment and alignment of protein sequences from 15 species against the existing algorithms
Keywords
DNA; binary sequences; evolutionary computation; optimisation; proteins; tree data structures; ant algorithm; evolutionary tree; nucleotide sequences; protein sequences; stack count; suffix representations; tree structures; Ant colony optimization; Bifurcation; Bioinformatics; DNA; History; Proteins; Sequences; Topology; Traveling salesman problems; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
Conference_Location
Honolulu, HI
Print_ISBN
0-7803-7282-4
Type
conf
DOI
10.1109/CEC.2002.1004473
Filename
1004473
Link To Document