A novel GA-based algorithm approach to fast biosequence alignment

doi:10.1109/ICCIS.2004.1460484

淡江大學機構典藏 > 工學院 > 電機工程學系暨研究所 > 期刊論文 > Item 987654321/60861

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/60861

题名:	A novel GA-based algorithm approach to fast biosequence alignment
作者:	簡丞志
贡献者:	淡江大學電機工程學系
关键词:	Sequences;DNA;Bioinformatics;Biology computing;Computational biology;Computational complexity;Dynamic programming;Proteins;Genomics;Software tools
日期:	2004-12
上传时间:	2011-10-15 00:59:52 (UTC+8)
摘要:	This paper presents a novel approach algorithm for bimolecular sequences alignment. Sequences comparison is the most important primitive operation in computational biology. There are many computational requirements for a alignment algorithm such as computer memory space requirement and computational complexity (computation time). To overcome the computational complexity of sequence alignment, the presented method first randomly divides the entire bimolecular sequences into several small sequences, and search for a partial near optima solution. After all of the partial near optima searching operations arc completed, the algorithm starts to search for better global optima by scan the new bimolecular sequences that are combined from the optimized small sequences. It allows pairwise alignment in each small sequence and does not apply dynamic programming at any optimization operation. The proposed algorithm also provides highly alignment efficient and very fast performance. Moreover, the proposed algorithm has been implemented in an x86 program, and used to verify the validity of the proposed algorithm and experiment on real DNA and protein datasets.
關聯:	Cybernetics and Intelligent Systems, 2004 IEEE Conference on 1, pp.602-607
DOI:	10.1109/ICCIS.2004.1460484
显示于类别:	[電機工程學系暨研究所] 期刊論文

文件中的档案:

档案	大小	格式	浏览次数
index.html	0Kb	HTML	116	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章

数据加载中.....