Speeding up the detection of tandem repeats over the edit distance-Reference-Cited by-同舟云学术

Speeding up the detection of tandem repeats over the edit distance

Published:2014-03 Issue: Volume:525 Page:103-110
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Sokol Dina,Tojeira Justin

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference34 articles.

1. A comparison of index-based lempel-ziv lz77 factorization algorithms;Al-Hafeedh;ACM Comput. Surv.,2012

2. Tandem repeats finder — a program to analyze DNA sequences;Benson;Nucleic Acids Res.,1999

3. V. Boeva, V. Makeev, M. Régnier, SWAN: searching for highly divergent tandem repeats in DNA sequences and statistical significance, in: JOBIM’04, IEEE Computer Society, 2004, in: Proceedings JOBIM’04, Montréal.

4. Fast and practical algorithms for computing all the runs in a string;Chen,2007

5. Lempel-ziv factorization using less time & space;Chen;Math. Comput. Sci.,2008

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Linear Time Algorithm for Finding Tandem Repeat in DNA Sequences;Proceedings of the 2019 7th International Conference on Information Technology: IoT and Smart City;2019-12-20

2. Period recovery of strings over the Hamming and edit distances;Theoretical Computer Science;2018-02

3. Mining balanced API protocols;International Journal of Computational Science and Engineering;2018

4. Faster Recovery of Approximate Periods over Edit Distance;String Processing and Information Retrieval;2018

5. Database of Periodic DNA Regions in Major Genomes;BioMed Research International;2017