摘要
Since the repetitions in a DNA sequence are of great biological significance searching for the repetitions has naturally been an important topic in gene analysis. This paper proposes two new concepts of repetitions-LPR for perfect repetitions and TSAR for approximate repetitions. A lightweight index structure, namely, the Succeeding Unit Array (SUA) is designed based on pattern unit. The SUA decreases the space consumption efficiently and solves the space bottleneck in search of repetitions. On the SUA all the LPRs and TSARs can be detected. The theoretical analysis and experimental results show that both space and time complexity of the algorithms is satisfying.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 1371-1378 |
| 页数 | 8 |
| 期刊 | Journal of Computational Information Systems |
| 卷 | 2 |
| 期 | 4 |
| 出版状态 | 已出版 - 11月 2006 |
| 已对外发布 | 是 |
指纹
探究 'Finding repetitions in DNA sequences based on a new index-succeeding unit array' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver