使用遺傳演算法解多序列排比的問題; Using Genetic Algorithms to Solve Multiple Sequence Alignments

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > Electronic Thesis & Dissertation > Item 987654321/8461

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/8461

Title:	使用遺傳演算法解多序列排比的問題;Using Genetic Algorithms to Solve Multiple Sequence Alignments
Authors:	林靜媚;Ching-mei Lin
Contributors:	資訊工程研究所
Keywords:	分子序列分析;遺傳演數法;多序列排比;molecular sequence analysis;genetic algorithm;multiple sequence alignment
Date:	2000-07-12
Issue Date:	2009-09-22 11:27:35 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	多序列排比是分子序列分析上一個重要的工具。在演化的過程中，分子序列可能會發生許多的突變，例如插入、刪除、替代等突變事件；而這些突變造成分子列序間的各種差異。多序列排比是透過同時比較多個序列，以找出序列之間的相似區域，故可找出序列間的結構關係。本論文提出一個遺傳演算法，來解決多序列排比的問題。我們使用十七個序列的資料集合來測試我們所提出的方法，並且將我們的實驗結果與其它方法做比較。我們發現我們的方法在大多數具有高相似性的測試資料中擁有不錯的表現。 Multiple sequence alignment is an important tool in molecular sequence analysis. In the evolutionary process, molecular sequences may have several mutations, such as insertion, deletion and substitution. These mutation events result in the diversified difference between sequences. Multiple sequences alignment can help compare the structure-relationship between sequences by simultaneously aligning multiple sequences to find the similar regions. This thesis presents genetic algorithms to solve multiple sequence alignments. Several data sets are tested and the experimental results are compared with other methods. We find our approach could obtain good performance in the majority of data sets with high similarity and long sequences.
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing

Loading...