DocumentCode
2583335
Title
Finding LPRs in DNA sequences based on a new index - SUA
Author
Wang, Di ; Wang, Guoren ; Wu, Qingquan ; Chen, Baichen
Author_Institution
Coll. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China
fYear
2005
fDate
19-21 Oct. 2005
Firstpage
281
Lastpage
284
Abstract
This paper proposes a new concept of repetitions, the largest pattern repetition (the LPR) and a concept of pattern unit. A lightweight index structure, namely, the succeeding unit array (the SUA) is designed based on pattern unit. The SUA decreases the space consumption efficiently and solves the space bottleneck in the search of repetitions. On the SUA all the atomic patterns which constitute the LPRs can be detected and the LPRs can be identified by connecting the same patterns. The theoretical analysis and experimental results show that both space and time complexity of the algorithms is O(n).
Keywords
DNA; biology computing; computational complexity; molecular biophysics; molecular configurations; DNA sequences; LPR; largest pattern repetition; lightweight index structure SUA; pattern unit; space complexity; succeeding unit array; time complexity; Algorithm design and analysis; Bioinformatics; DNA; Educational institutions; Genomics; Humans; Information science; Joining processes; Optical arrays; Sequences;
fLanguage
English
Publisher
ieee
Conference_Titel
Bioinformatics and Bioengineering, 2005. BIBE 2005. Fifth IEEE Symposium on
Print_ISBN
0-7695-2476-1
Type
conf
DOI
10.1109/BIBE.2005.31
Filename
1544481
Link To Document