生物體之重複序列找尋之演算法設計與實作; A Computation of Repeats in Complete Genomes

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

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

Title:	生物體之重複序列找尋之演算法設計與實作;A Computation of Repeats in Complete Genomes
Authors:	林豐茂;Feng-Mao Lin
Contributors:	資訊工程研究所
Keywords:	重複序列;基因序列;Repeat sequence;DNA sequence
Date:	2000-07-06
Issue Date:	2009-09-22 11:26:54 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	在基因序列內存在大量的重複序列，生物學家發現大量的調控機制坐落於重複的基因序列中，而且重複序列的分析與探索，可分析出染色體之結構，不僅如此，還可提供重要的線索給生物學家進行基因演化與物種演化之研究，我們已經研發出一套找尋完全相同重複序列的演算法，此演算法可找出單股(direct)及坐落於雙股(inverted)之重複序列。 Repeat sequences are the most abundant sequences in extragenic region of genome. At present, biologists found that a large number of regulatory elements located here. They also may play an important role in the chromatin structure information in nucleus and contain important clues in genetic evolution and phylogeny study. This thesis develops an algorithm which allows to determine all exact repeat sequences contained in complete genomes. The algorithm can find both direct and inverted repeats. Our approach can find repeats whose length is longer than twenty bases and small repeats efficiently.
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing

Loading...