Fast index based algorithms and software for matching position specific scoring matrices

BMC Bioinformatics

Volumn 7, Issue , 2006, Pages

  Beckstette, Michael ^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 ACID SEQUENCE; APPROXIMATION APPROACH; BIOLOGICAL SEQUENCE ANALYSIS; COMPLETE GENOMES; EFFICIENT COMPUTATION; LAZY-EVALUATION METHOD; PROTEIN SEQUENCES; SIMILARITY THRESHOLD;

AMINO ACIDS; DATABASE SYSTEMS; DYNAMIC PROGRAMMING; GENES; HEURISTIC ALGORITHMS; NUCLEOTIDES;

APPROXIMATION ALGORITHMS;

AMINO ACID; DNA; PROTEIN;

ACCURACY; ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; COMPUTER PROGRAM; CONTROLLED STUDY; DNA SEQUENCE; GENE SEQUENCE; INFORMATION PROCESSING; INTERMETHOD COMPARISON; MATHEMATICAL COMPUTING; NUCLEOTIDE SEQUENCE; PROTEIN MOTIF; SCORING SYSTEM; SEQUENCE ANALYSIS; SEQUENCE DATABASE; FACTUAL DATABASE; METHODOLOGY; PROCEDURES; SEQUENCE ALIGNMENT; STATISTICAL ANALYSIS;

ALGORITHMS; AMINO ACID SEQUENCE; DATABASES, FACTUAL; MATCHED-PAIR ANALYSIS; RESEARCH DESIGN; SEQUENCE ALIGNMENT; SOFTWARE;

EID: 33750959240     PISSN: 14712105     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-7-389     Document Type: Article

References (36)

1. Gribskov M, McLachlan M, Eisenberg D: Profile Analysis: Detection of Distantly Related Proteins. Proc Nat Acad Sci USA 1987, 84:4355-4358.
2. Hulo N, Sigrist C, Le Saux V, Langendijk-Genevaux PS, Bordoli L, Gattiker A, De Castro E, Bucher P, Bairoch A: Recent improvements to the PROSITE database. Nud Acids Res 2004, 32:134-137.
3. Attwood TK, Bradley P, Flower DR, Gaulton A, Maudling N, Mitchell AL, Moulton G, Nordle A, Paine K, Taylor P, Uddin A, Zygouri C: PRINTS and its automatic supplement, prePRINTS. Nucl Acids Res 2003, 31:400-402.
4. Henikoff J, Greene E, Pietrokovski S, Henikoff S: Increased Coverage of Protein Families with the Blocks Database Servers. Nucl Acids Res 2000, 28:228-230.
5. Wu T, Nevill-Manning C, Brutlag D: Minimal-risk scoring matrices for sequence analysis. J Comp Biol 1999, 6(2):219-235.
6. Sandelin A, Alkema W, Engstrom P, Wasserman W, Lenhard B: JASPAR: an open-access database for eukaryotic transcription factor binding profiles. Nucl Acids Res 2004, 32:D91-D94.
7. Matys V, Fricke E, Geffers R, Gößiling E, Haubrock M, Hehl R, Hornischer K, Karas D, Kel AE, Kel-Margoulis OV, Kloos DU, Land S, Lewicki-Potapov B, Michael H, Munch R, Reuter I, Rotert S, Saxel H, Scheer M, Thiele S, Wingender E: TRANSFAC(R): transcriptional regulation, from patterns to profiles. Nucl Acids Res 2003, 31:374-378.
8. Scordis P, Flower D, Attwood T: FingerPRINTScan: intelligent searching of the PRINTS motif database. Bioinformatics 1999, 15(10):799-806.
9. Quandt K, Frech K, Wingender E, Werner T: MatInd and MatInspector: new fast and versatile tools for detection of consensus matches in nucleotide data. Nucl Acids Res 1995, 23:4878-4884.
10. Rajasekaran S, Jin X, Spouge J: The Efficient computation of Position Specific Match Scores with the Fast Fourier Transformation. J Comp Biol 2002, 9:23-33.
11. Freschi V, Bogliolo A: Using sequence compression to speedup probabilistic profile matching. Bioinformatics 2005, 21(10):2225-2229.
12. Wu T, Nevill-Manning C, Brutlag D: Fast Probabilistic Analysis of Sequence Function using Scoring Matrices. Bioinformatics 2000, 16(3):233-244.
13. Dorohonceanu B, Nevill-Manning C: Accelerating Protein Classification Using Suffix Trees. In Proc. of the International Conference on Intelligent Systems for Molecular Biology Menlo Park, CA: AAAI Press; 2000:128-133.
14. Gonnet H: Some string matching problems from Bioinformatics which still need better solutions. Journal of Discrete Algorithms 2004, 2(1):3-15.
15. Tatusov R, Altschul S, Koonin E: Detection of conserved segments in proteins: Iterative scanning of sequence databases with alignment blocks. Proc Nat Acad Sci USA 1994, 91(25):12091-12095.
16. Henikoff J, Henikoff S: Using substitution probabilities to improve position-specific scoring matrices. Bioinformatics 1996, 12(2):135-143.
17. Kel A, Gößling E, Reuter I, Cheremushkin E, Kel-Margoulis O, Wingender E: MATCH: a tool for searching transcription factor binding sites in DNA sequences. Nucl Acids Res 2003, 31(13):3576-3579.
18. Abouelhoda M, Kurtz S, Ohlebusch E: Replacing Suffix Trees with Enhanced Suffix Arrays. Journal of Discrete Algorithms 2004, 2:53-86.
19. Kurtz S: Reducing the Space Requirement of Suffix Trees. Software - Practice and Experience 1999, 29(13):1149-1171.
20. Giegerich R, Kurtz S: A Comparison of Imperative and Purely Functional Suffix Tree Constructions. Science of Computer Programming 1995, 25(2-3):187-218.
21. Staden R: Methods for calculating the probabilities for finding patterns in sequences. Comp Appl Biosci 1989, 5:89-96.
22. Rahmann S: Dynamic programming algorithms for two statistical problems in computational biology. In Proc. of the 3rd Workshop of Algorithms in Bioinformatics (WABI) LNCS 2812, Springer Verlag; 2003:151-164.
23. Rahmann S, Müller T, Vingron M: On the Power of Profiles for Transcription Factor Binding Site Detection. Statistical Applications in Genetics and Molecular Biology 2003, 2(1):.
24. Beckstette M, Homann R, Giegerich R, Kurtz S: PoSSuM software distribution. 2006 [http://bibiserv.techfak.uni-bielefeld.de/ possumsearch/].
25. Beckstette M, Strothmann D, Homann R, Giegerich R, Kurtz S: PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays. In Proc. of the German Conference on Bioinformatics Volume P-53. GI Lecture Notes in Informatics; 2004:53-64.
26. Kärkkäinen J, Sanders P: Simple Linear Work Suffix Array Construction. In Proceedings of the 13th International Conference on Automata, Languages and Programming Springer; 2003.
27. Kasai T, Lee G, Arimura H, Arikawa S, Park K: Linear-time Longest-Common-Prefix Computation in Suffix Arrays and its Applications. In 12th Annual Symposium on Combinatorial Pattern Matching (CPM2001) Volume 2089. Springer-Verlag, New York: Lecture Notes in Computer Science; 2001:181-192.
28. de Bruijn N: A Combinatorial Problem. Koninklijke Nederlands Akademie van Wetenschappen Proceedings 1946, 49:758-764.
29. Li T, Fan K, Wang J, Wang W: Reduction of protein sequence complexity by residue grouping. Protein Engineering 2003, 16(5):323-330.
30. Murphy LR, Wallqvist A, Levy R: Simplified amino acid alphabets for protein fold recognition and implications for folding. Protein Engineering 2000, 13(3):149-152.
31. Castillo G: Extreme Value Theory in Engineering Academic Press; 1988.
32. Embrechts P, Klüppelberg C, Mikosch T: Modelling Extremal Events Springer; 1997.
33. Goldstein L, Waterman M: Approximations to profile score distributions. J Comp Biol 1994, 1:93-104.
34. Kurtz S: The Vmatch large scale sequence analysis software. 2005 [http://www.vmatch.de/].
35. Haverty P, Weng Z: CisML: an XML-based format for sequence motif detection software. Bioinformatics 2004, 20(11):1815-1817.
36. Weeks D, Eskandari S, Scott D, Sachs G: A H+-gated urea channel: the link between Helicobacter pylori urease and gastric colonization. Science 2000, 287:482-485.