The affix array data structure and its applications to RNA secondary structure analysis

Theoretical Computer Science

Volumn 389, Issue 1-2, 2007, Pages 278-294

  Strothmann, Dirk ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Affix tree; Pattern matching; Suffix array; Suffix tree

Indexed keywords

ALGORITHMS; DATA PROCESSING; PATTERN MATCHING; RNA; TREES (MATHEMATICS);

AFFIX TREE; LINEAR TIME CONSTRUCTION; SECONDARY STRUCTURE PATTERNS; SUFFIX ARRAY;

DATA STRUCTURES;

EID: 36048988461     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.09.029     Document Type: Article

References (17)

1. D. Strothmann, S. Kurtz, S. Gräf, G. Steger, The syntax and semantics of a language for describing complex patterns in biological sequences, Report 2000-06, Technische Fakultät, Universität Bielefeld, 2000. URL: http://bibiserv.techfak.uni-bielefeld.de/HyPa/patternlanguage.ps.gz
2. Gräf S., Strothmann D., Kurtz S., and Steger G. HyPaLib: A database of RNAs and RNA structural elements defined by hybrid patterns. Nucleic Acids Research 29 1 (2001) 196-198. http://nar.oupjournals.org/cgi/reprint/29/1/196 URL:
3. J. Stoye, Affix trees, Report Nr. 04, Technische Fakultät, Universität Bielefeld, 2000
4. Maass M. Linear bidirectional on-line construction of affix trees. Algorithmica 37 (2003) 320-334
5. Mauri G., and Pavesi G. Algorithms for pattern matching and discovery in RNA secondary structure. Theoretical Computer Science 335 (2005) 29-51
6. Manber U., and Myers E. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing 22 5 (1993) 935-948
7. Abouelhoda M., Kurtz S., and Ohlebusch E. The enhanced suffix array and its applications to genome analysis. Proceedings of the Second Workshop on Algorithms in Bioinformatics. Lecture Notes in Computer Science vol. 2452 (2002), Springer-Verlag 449-463
8. Abouelhoda M., Kurtz S., and Ohlebusch E. Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms 2 (2004) 53-86
9. McCreight E. A space-economical suffix tree construction algorithm. Journal of the ACM 23 2 (1976) 262-272
10. Kim D., Sim J., Park H., and Park K. Linear-time construction of suffix arrays. Proceedings of the Annual Symposium on Combinatorial Pattern Matching. CPM 2003. Lecture Notes in Computer Science vol. 2089 (2003), Springer Verlag 186-199
11. Maass M. Computing suffix links for trees and arrays. Information Processing Letters 101 6 (2007) 250-254
12. Makinen, and Navarro. Compressed full text indexes. ACM Computing Surveys 39 2 (2007) Art. 2
13. Sim J. Time and space efficient search for small alphabets with suffix arrays. 2nd Conference on Fuzzy Systems and Knowledge Discovery (2005), Springer 1102-1107
14. Kurtz S. http://www.vmatch.de
15. Mauri G., and Pavesi G. Pattern discovery in RNA secondary structure using affix trees. Proceedings of the Annual Symposium on Combinatorial Pattern Matching. CPM 2003. Lecture Notes in Computer Science vol. 2676 (2003), Springer Verlag 278-294
16. Pesole G., Liuni S., and D'Souza M. PatSearch: A pattern matcher software that finds functional elements in nucleotide and protein sequences and assesses their statistical significance. Bioinformatics 16 (2000) 439-450
17. Grillo G., Licciulli F., Liuni S., Sbisa E., and G P. PatSearch: A program for the detection of patterns and structural motifs in nucleotide sequences. Nucleic Acids Research 31 (2003) 3608-3612