A Fast Exact Repeats Search Algorithm for Genome Analysis

摘要：

The repeat structure of genomic DNA is considered an essential mechanism for evolution and other fundamental biological functions. Repeats finding problems are always deemed as one of the prerequisites for genome sequencing and analysis, and among these problems exact repeat finding is the first step for most other repeats finding problems. In this paper, the authors propose a new fast algorithm based on simple count sort and radix sort to solve the exact repeat finding problems specifically, which performs more efficient than any existing exact repeat finding algorithm by the simplicity of data structure and the proposed algorithm itself. The algorithm can also be easily adapted for similar problems in proteome sequence analysis with little modification.

关键词： Repeats Finding Radix Sort Regulator Detection

作者: Weidong Sun Zongmin MA

作者单位: School of Information Science and Engineering Northeastern University Shenyang, China School of Comp School of Computer Science and Technology Shenyang Institute of Aeronautical Engineering Shenyang, C

会议类型: 国际会议

会议名称: 2009 Ninth International Conference on Hybrid Intelligent Systems(第九届混合智能系统国际会议 HIS 2009)

会议地点: 沈阳

会议语种:英文

页码: 1-4

在线出版日期: 2009-08-12（万方平台首次上网日期，不代表论文的发表时间）