Journal of Northeastern University ›› 2007, Vol. 28 ›› Issue (2): 184-188.DOI: -

• OriginalPaper • Previous Articles     Next Articles

SUA-based algorithm for finding SATRs in DNA sequence

Wang, Di (1); Zhao, Yi (1); Chen, Bai-Chen (1); Wang, Guo-Ren (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2007-02-15 Published:2013-06-24
  • Contact: Wang, D.
  • About author:-
  • Supported by:
    -

Abstract: Studies finding approximate repetitions in DNA sequence, which is an important problem in gene analysis. Analyzing the approximate repetitions and similarity measurements and based on Hamming Distance, two definitions of pattern-similarity and segment-similarity are proposed as new measurements of similarity, then on the basis of the two definitions, a new concept of approximate repetition, i.e., the segment-similarity based approximate tandem repeats (SATR) is given. In addition, the succeeding unit array (SUA) as a lightweight index is introduced in finding SATRs in DNA sequence with an algorithm designed to find SATRs based on the index. Theoretical analysis and experiment results both show that the SATR finding algorithm based on SUA is superior to other methods in finding results and time saving.

CLC Number: