String matching with variable length gaps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6393 LNCS, Issue , 2010, Pages 385-394

  Bille, Philip ^a   Li Gørtz, Inge ^a   Vildhøj, Hjalte Wedel ^a   Wind, David Kofoed ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL BIOLOGY; LOWER BOUNDS; STRING MATCHING; SUB-STRINGS; TIME AND SPACE; VARIABLE LENGTH; ACHIEVING TIME; TIME AND SPACE COMPLEXITY;

BIOINFORMATICS; INFORMATION RETRIEVAL; TOWERS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGORITHMS; INFORMATION RETRIEVAL;

EID: 78449289058     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16321-0_40     Document Type: Conference Paper

References (19)

1. Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333-340 (1975)
2. Bille, P.: New algorithms for regular expression matching. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 643-654. Springer, Heidelberg (2006)
3. Bille, P., Thorup, M.: Faster regular expression matching. In: Proc. 36th ICALP, pp. 171-182 (2009)
4. Bille, P., Thorup, M.: Regular expression matching with multi-strings and intervals. In: Proc. 21st SODA (2010)
5. Bucher, P., Bairoch, A.: A generalized profile syntax for biomolecular sequence motifs and its function in automatic sequence interpretation. In: Proc. 2nd ISMB, pp. 53-61 (1994)
6. Crochemore, M., Iliopoulos, C., Makris, C., Rytter, W., Tsakalidis, A., Tsichlas, K.: Approximate string matching with gaps. Nordic J. of Computing 9(1), 54-65 (2002)
7. Fredriksson, K., Grabowski, S.: Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance. Inf. Retr. 11(4), 335-357 (2008)
8. Fredriksson, K., Grabowski, S.: Nested counters in bit-parallel string matching. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 338-349. Springer, Heidelberg (2009)
9. Hofmann, K., Bucher, P., Falquet, L., Bairoch, A.: The prosite database, its status in. Nucleic Acids Res. (27), 215-219 (1999)
10. Knuth, D.E., James, J., Morris, H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323-350 (1977)
11. Lee, I., Apostolico, A., Iliopoulos, C.S., Park, K.: Finding approximate occurrences of a pattern that contains gaps. In: Proc. 14th AWOCA, pp. 89-100 (2003)
12. Morgante, M., Policriti, A., Vitacolonna, N., Zuccolo, A.: Structured motifs search. J. Comput. Bio. 12(8), 1065-1082 (2005)
13. Myers, E.W.: Approximate matching of network expressions with spacers. J. Comput. Bio. 3(1), 33-51 (1992)
14. Myers, E.W.: A four-russian algorithm for regular expression pattern matching. J. ACM 39(2), 430-448 (1992)
15. Myers, G., Mehldau, G.: A system for pattern matching applications on biosequences. CABIOS 9(3), 299-314 (1993)
16. Navarro, G., Raffinot, M.: Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching. J. Comput. Bio. 10(6), 903-923 (2003)
17. Navarro, G., Raffinot, M.: New techniques for regular expression searching. Algorithmica 41(2), 89-116 (2004)
18. Rahman, M.S., Iliopoulos, C.S., Lee, I., Mohamed, M., Smyth, W.F.: Finding patterns with variable length gaps or don't cares. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 146-155. Springer, Heidelberg (2006)
19. Thompson, K.: Regular expression search algorithm. Commun. ACM 11, 419-422 (1968)