Application of the Burrows-Wheeler Transform for searching for tandem repeats in DNA sequences

International Journal of Bioinformatics Research and Applications

Volumn 5, Issue 4, 2009, Pages 432-446

  Pokrzywa, Rafal ^a  

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Block sorting; Burrows Wheeler transform; BWT; Suffix array; Tandem repeat

Indexed keywords

ALGORITHM; ARTICLE; BURROWS WHEELER TRANSFORM; DNA FINGERPRINTING; DNA SEQUENCE; GENOMICS; HUMAN; NONHUMAN; NUCLEOTIDE SEQUENCE; SEQUENCE ANALYSIS; TANDEM REPEAT;

EID: 68949105657     PISSN: 17445485     EISSN: 17445493     Source Type: Journal    
DOI: 10.1504/IJBRA.2009.027517     Document Type: Article

References (10)

1. Apostolico, A. and Preparata, F.P. (1983) 'Optimal off-line detection of repetitions in a string', Theoretical Computer Science, Vol.22, pp.297-315.
2. Benson, G. (1999) 'Tandem repeats finder: a program to analyze DNA sequences', Nucleic Acids Research, Vol.27, pp.573-580.
3. Burrows, M. and Wheeler, D.J. (1994) 'A block-sorting lossless data compression algorithm', SRC Research Report, p.124.
4. Creighton, T. (1999) The Encyclopedia of Molecular Biology, John Wiley and Sons, New York.
5. Crochemore, M. (1981) 'An optimal algorithm for computing the repetitions in a word', Information Processing Letters, Vol.12, pp.244-250.
6. Deorowicz, S. (2003) Universal Lossless Data Compression Algorithms, Doctor of Philosophy Dissertation, Silesian University of Technology, Gliwice, Poland, p.136.
7. Ferragina, P. and Manzini, G. (2000) 'Opportunistic data structures with applications', Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp.390-398.
8. Main, M.G. and Lorentz, R.J. (1984) 'An O(n log n) algorithm for finding all repetitions in a string', Journal of Algorithms, Vol.5, pp.422-432.
9. Manber, U. and Myers, E.W. (1993) 'Suffix array: a new method for on-line string searches', SIAM Journal of Computing, Vol.22, pp.935-948.
10. Stoye, J. and Gusfield, D. (1998) 'Simple and flexible detection of contiguous repeats using a suffix tree', Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol.1448, pp.140-152.