PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays

Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)

Volumn P-53, Issue , 2004, Pages 53-64

  Beckstette, Michael ^a   Strothmann, Dirk ^a   Homann, Robert ^a   Giegerich, Robert ^a   Kurtz, Stefan ^b  

^a BIELEFELD UNIVERSITY   (Germany)

^b UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AMINO ACIDS; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; INDEXING (OF INFORMATION);

AMINO-ACIDS; BIOLOGICAL SEQUENCE ANALYSIS; HEURISTICS ALGORITHM; LARGE DATABASE; MATCHINGS; MATRIX; POSITION SPECIFIC SCORING MATRIX; SEQUENCE MOTIFS; SIMILARITY THRESHOLD; SUFFIX ARRAYS;

NUCLEOTIDES;

EID: 85134575899     PISSN: 16175468     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. +03] Attwood, T. K., Bradley, P., Flower, D. R., Gaulton, A., Maudling, N., Mitchell, A. L., Moulton, G., Nordle, A., Paine, K., Taylor, P., Uddin, A., and Zygouri, C.: PRINTS and its automatic supplement, prePRINTS. Nucl. Acids Res. 31(1):400–402. 2003.
2. [AKO04] Abouelhoda, M., Kurtz, S., and Ohlebusch, E.: Replacing Suffix Trees with Enhanced Suffix Arrays. Journal of Discrete Algorithms. 2:53–86. 2004.
3. [DC00] Dorohonceanu, B. and C.G., N.-M.: Accelerating Protein Classification Using Suffix Trees. In: in Proc. of the International Conference on Intelligent Systems for Molecular Biology. pp. 128–133. Menlo Park, CA. 2000. AAAI Press.
4. [GK95] Giegerich, R. and Kurtz, S.: A Comparison of Imperative and Purely Functional Suffix Tree Constructions. Science of Computer Programming. 25(2-3):187–218. 1995.
5. [GME87] Gribskov, M., McLachlan, M., and Eisenberg, D.: Profile Analysis: Detection of Distantly Related Proteins. Proc. Nat. Acad. Sci. U.S.A. 84:4355–4358. 1987.
6. [HGPH00] Henikoff, J., Greene, E., Pietrokovski, S., and Henikoff, S.: Increased Coverage of Protein Families with the Blocks Database Servers. Nucl. Acids Res. 28:228–230. 2000.
7. +04] Hulo, N., Sigrist, C., Le Saux, V., Langendijk-Genevaux, P. S., Bordoli, L., Gattiker, A., De Castro, E., Bucher, P., and Bairoch, A.: Recent improvements to the PROSITE database. Nucl. Acids Res. 32:134–137. 2004.
8. +03] Kel, A., Gößling, E., Reuter, I., Cheremushkin, E., Kel-Margoulis, O., and Wingender, E.: MATCH: a tool for searching transcription factor binding sites in DNA sequences. Nucl. Acids Res. 31:3576–3579. 2003.
9. [Ku99] Kurtz, S.: Reducing the Space Requirement of Suffix Trees. Software—Practice and Experience. 29(13):1149–1171. 1999.
10. +03] Matys, V., Fricke, E., Geffers, R., Gößling, E., Haubrock, M., Hehl, R., Hornischer, K., Karas, D., Kel, A. E., Kel-Margoulis, O. V., Kloos, D.-U., Land, S., Lewicki-Potapov, B., Michael, H., Munch, R., Reuter, I., Rotert, S., Saxel, H., Scheer, M., Thiele, S., and Wingender, E.: TRANSFAC(R): transcriptional regulation, from patterns to profiles. Nucl. Acids Res. 31(1):374–378. 2003.
11. [QFWW95] Quandt, K., Frech, K., Wingender, E., and Werner, T.: MatInd and MatInspector: new fast and versatile tools for detection of consensus matches in nucleotide data. Nucl. Acids Res. 23:4878–4884. 1995.
12. [Ra03] Rahmann, S.: Dynamic programming algorithms for two statistical problems in computational biology. In: Proc. of the 3rd Workshop of Algorithms in Bioinformatics (WABI). pp. 151–164. LNCS 2812, Springer Verlag. 2003.
13. [RMV03] Rahmann, S., Müller, T., and Vingron, M.: On the Power of Profiles for Transcription Factor Binding Site Detection. Statistical Applications in Genetics and Molecular Biology. 2(1). 2003.
14. [SFA99] Scordis, P., Flower, D., and Attwood, T.: FingerPRINTScan: intelligent searching of the PRINTS motif database. Bioinformatics. 15(10):799–806. 1999.
15. [St89] Staden, R.: Methods for calculating the probabilities for finding patterns in sequences. Comp. Appl. Biosci. 5:89–96. 1989.
16. [WNB00] Wu, T., Nevill-Manning, C., and Brutlag, D.: Fast Probabilistic Analysis of Sequence Function using Scoring Matrices. Bioinformatics. 16(3):233–244. 2000.