Volume 6 Number 3 (Mar. 2011)
Home > Archive > 2011 > Volume 6 Number 3 (Mar. 2011) >
JSW 2011 Vol.6(3): 386-394 ISSN: 1796-217X
doi: 10.4304/jsw.6.3.386-394

A New Model for Finding Approximate Tandem Repeats in DNA Sequences

Qingshan Jiang1, 2, Sheng Li2, Shun Guo3, Dan Wei4
1Shenzhen Institute of Advanced Technology, Chinese Academy of Science, Shenzhen, China
2Software School, Xiamen University, Xiamen, China
3School of Information Science and Technology, Xiamen University, Xiamen, China
4Cognitive Science Department, Xiamen University, Xiamen, China; Fujian Key Laboratory of the Brain-like Intelligent Systems (Xiamen University), Xiamen, China


Abstract—In gene analysis, finding approximate tandem repeats in DNA sequence is an important issue. SUA_SATR is one of the latest methods for finding those repetitions, which suffers deficiencies of runtime cost and poor result quality. In order to detect approximate tandem repeats in genomic sequences more efficiently, we propose a new model based on a novel algorithm MSATR and an optimized algorithm mMSATR in this paper. The model uses the Motif-Divide method to improve the performance, which results in the proposal of algorithm MSATR. By introducing the definition of CASM to reduce the searching scope and optimizing the original mechanism adopted by MSATR, the mMSATR algorithm makes the detecting process more efficient and improves the result quality. The theoretical analysis and experiment results indicate that MSATR and mMSATR is able to get more results within less runtime. These algorithms are superior to other methods in finding results, and it greatly reduces the runtime cost, which is of benefit when the gene data becomes larger.

Index Terms—DNA sequence mining; approximate tandem repeat; motif-similarity

[PDF]

Cite: Qingshan Jiang, Sheng Li, Shun Guo, Dan Wei, "A New Model for Finding Approximate Tandem Repeats in DNA Sequences," Journal of Software vol. 6, no. 3, pp. 386-394, 2011.

General Information

ISSN: 1796-217X (Online)
Frequency:  Bimonthly 
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, CNKIGoogle Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsw@iap.org
  • Apr 26, 2021 News!

    Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec)     [Click]

  • Nov 18, 2021 News!

    Papers published in JSW Vol 16, No 1- Vol 16, No 6 have been indexed by DBLP   [Click]

  • Dec 24, 2021 News!

     Vol 15, No 1- Vol 15, No 6 has been indexed by IET-(Inspec)   [Click]

  • Nov 18, 2021 News!

    [CFP] 2022 the annual meeting of JSW Editorial Board, ICCSM 2022, will be held in Rome, Italy, July 21-23, 2022   [Click]

  • Jul 26, 2022 News!

     Vol 17, No 5 has been published with online version     [Click]