A GA/Tabu Search for Multiple Sequence Alignment in Computational Biology

• Main Authors: Ding-Han Hsueh, 薛鼎翰
• Other Authors: Ping-Tung Chang
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/76602720345044977907

碩士 === 東海大學 === 工業工程與經營資訊學系 === 94 === Multiple Sequence Alignment(MSA) is a very important issue, and also a big challenge in computational biology. We can know the structural differences and some hidden information between sequences by means of MSA. Multiple Sequence Alignment(MSA) is a very complicated problem, roughly speaking, the time for comparing 2 lengths, which are both as the sequence of n, is a direct proportion/ ratio to the square of n; nevertheless the time for comparing k lengths, which are all the sequence of n, will get a direct proportion/ratio of k to the power. In this paper, we proposed a hybrid method of Genetic Algorithm and Tabu Search. We use PAM 250 scoring matrix and 16 groups of protein sequences to execute the experiments and compare with the Multiple Sequence Alignment Sofrware – ClustalW. Experimental results show that, in our method,we can get the batter solution.