Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching

Journal of Computational Biology

Volumn 10, Issue 6, 2003, Pages 903-923

  Navarro, Gonzalo ^a   Raffinot, Mathieu ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b CNRS   (France)

Author keywords

Approximate matching; Bit parallelism; BNDM; Boyer Moore; CBG patterns; Extended patterns; PROSITE patterns; Searching allowing differences; Wild cards

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGY; DATA ANALYSIS; DATA BASE; INFORMATION PROCESSING; PRIORITY JOURNAL; PROTEIN ANALYSIS; PROTEIN EXPRESSION;

ALGORITHMS; COMPUTATIONAL BIOLOGY; INFORMATION STORAGE AND RETRIEVAL; PATTERN RECOGNITION, AUTOMATED; PROTEINS;

EID: 0742269627     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/106652703322756140     Document Type: Article

References (39)

1. Baeza-Yates, R. 1992. Text retrieval: Theory and practice. In 12th IFIP World Computer Congress, vol. I, 465-476, Elsevier Science.
2. Baeza-Yates, R., and Gonnet, G. 1992. A new approach to text searching. CACM 35(10), 74-82.
3. Baeza-Yates, R., and Navarro, G. 1999. Faster approximate string matching. Algorithmica 23(2), 127-158.
4. Berry, G., and Sethi, R. 1986. From regular expression to deterministic automata. Theor. Comput. Sci. 48(1), 117-126.
5. Boyer, R.S., and Moore, J.S. 1977. A fast string searching algorithm. CACM 20(10), 762-772.
6. Brüggemann-Klein, A. 1993. Regular expressions into finite automata. Theoret. Comput. Sci. 120(2), 197-213.
7. Bucher, P., and Bairoch, A. 1994. A generalized profile syntax for biomolecular sequences motifs and its function in automatic sequence interpretation. Proc. 2nd Int. Conf. on Intelligent Systems for Molecular Biology, 53-61, AAAI Press, Menlo Park.
8. Chang, C.-H., and Paige, R. 1992. From regular expression to DFA's using NFA's. Proc. CPM'92, LNCS 664, 90-110.
9. Crochemore, M., and Rytter, W. 1994. Text Algorithms, Oxford University Press.
10. Czumaj, A., Crochemore, M., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., and Rytter, W. 1994. Speeding up two string-matching algorithms. Algorithmica 12, 247-267.
11. El-Mabrouk, N., and Crochemore, M. 1996. Boyer-Moore strategy to efficient approximate string matching. Proc. CPM'96, LNCS 1075, 24-38.
12. Hagenah, C., and Muscholl, A. 1998. Computing epsilon-free NFA from regular expressions in O (n log(n)) time. Proc. MFCS'98, LNCS 1450, 277-285.
13. Hofmann, K., Bucher, P., Falquet, L., and Bairoch, A. 1999. The PROSITE database, its status in 1999. Nucl. Acids Res. 27, 215-219.
14. Hromkovič, J., Seibert, S., and Wilke, T. 1997. Translating regular expression into small ε-free nondeterministic automata. Proc. STACS 97, LNCS 1200, 55-66.
15. Ilie, L., and Yu, S. 2002. Constructing NFAs by optimal use of positions in regular expressions. CPM'02, LNCS 2373, 115-132.
16. Knuth, D.E., Morris, J.H., and Pratt, V.R. 1977. Fast pattern matching in strings. SIAM J. Computing 6(1), 323-350.
17. Kolakowski Jr., L.F., Leunissen, J.A.M., and Smith, J.E. 1992. ProSearch: Fast searching of protein sequences with regular expression patterns related to protein structure and function. Biotechniques 13, 919-921.
18. Marsan, L., and Sagot, M.F. 2000. Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. J. Comp. Biol. 7(3-4), 345-362.
19. Myers, E. 1992. A four-Russian algorithm for regular expression pattern matching. J. ACM 39(2), 430-448.
20. Myers, E. 1996. Approximate matching of network expressions with spacers. J. Comp. Biol. 3(1), 33-51.
21. Myers, E.W., and Miller, W. 1989. Approximate matching of regular expressions. Bull. Math. Biology 51, 7-37.
22. Myers, E.W., Oliva, P., and Guimãraes, K. 1998. Reporting exact and approximate regular expression matches. Proc. CPM'98, LNCS 1448, 91-103.
23. Myers, G. 1999. A fast bit-vector algorithm for approximate string matching based on dynamic progamming. J. ACM 46(3), 395-415.
24. Navarro, G. 2001. NR-grep: A fast and flexible pattern matching tool. Software Practice & Experience 31, 1265-1312.
25. Navarro, G. 2003. Approximate regular expression searching with arbitrary integer weights. Proc. ISAAC'03, LNCS. To appear.
26. Navarro, G., and Raffinot, M. 1999. Fast regular expression matching. Proc. WAE'99, LNCS 1668, 198-212.
27. Navarro, G., and Raffinot, M. 2000. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM J. Experimental Algorithmics (JEA), 5(4). www.jea.acm.org/2000/NavarroString.
28. Navarro, G., and Raffinot, M. 2001a. Fast and simple character classes and bounded gaps pattern matching, with application to protein searching. Proc. 5th Ann. Int. Conf. Computational Molecular Biology (RECOMB), 231-240.
29. Navarro, G., and Raffinot, M. 2001b. Compact DFA representation for fast regular expression search. Proc. WAE'01, LNCS 2141, 1-12.
30. Navarro, G., and Raffinot, M. 2002. Flexible Pattern Matching in Strings - Practical On-Line Search Algorithms for Texts and Biological Sequences, Cambridge University Press.
31. Raffinot, M. 1997. On the multi backward dawg matching algorithm (MultiBDM). R. Bacza-Yates (ed.). Proc. WSP'97, 149-165.
32. Staden, R. 1991. Screening protein and nucleic acid sequences against libraries of patterns. DNA Sequence 1, 369-374.
33. Thompson, K. 1968. Regular expression search algorithm. CACM, 11(6), 419-422.
34. Watson, B. 1995. Taxonomies and Toolkits of Regular Language Algorithms. Ph.D. thesis, Eindhoven Univ. of Technology, The Netherlands.
35. Wu, S., and Manber, U. 1992a. Agrep - a fast approximate pattern-matching tool. Proc. USENIX Technical Conference, 153-162.
36. Wu, S., and Manber, U. 1992b. Fast text searching allowing errors. CACM 35(10), 83-91.
37. Wu, S., Manber, U., and Myers, E.W. 1995. A subquadratic algorithm for approximate regular expression matching. J. Algorithms 19(3), 346-360.
38. Wu, S., Manber, U., and Myers, E. 1996. A sub-quadratic algorithm for approximate limited expression matching. Algorithmica 15(1), 50-67.
39. Yao, A. 1979. The complexity of pattern matching for a random string. SIAM J. Comput. 8, 368-387.