Exact and approximate pattern matching in the streaming model

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 315-323

  Porat, Benny ^a   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE PATTERN MATCHING; FALSE NEGATIVES; FALSE POSITIVE; INTERNET TRAFFIC; K-MISMATCHES; ON-LINE FASHION; ONLINE MODELS; PATTERN MATCH; PATTERN MATCHING PROBLEMS; PREPROCESS; PREPROCESSING PHASE; RANDOMIZED ALGORITHMS; SPACE COMPLEXITY; STREAMING MODEL; TEXT INPUT; TIME AND SPACE; TIME SPENT;

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; PATTERN MATCHING;

ALGORITHMS;

EID: 77952401274     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.11     Document Type: Conference Paper

References (17)

1. K. Abrahamson. Generalized string matching. SIAM J. Comp., 16(6):1039-1051, 1987.
2. A. Amir, M. Lewenstein, and E. Porat. Faster algorithms for string matching with k mismatches. In J. of Algorithms, pages 257-275, 2004.
3. R.S. Boyer and J.S. Moore. A fast string searching algorithm. Comm. ACM, 20:762-772, 1977.
4. R. Clifford, K. Efremenko, B. Porat, and E. Porat. A black box for online approximate pattern matching. Proc. of the Symposium on Combinatorial Pattern Matching (CPM), pages 143-151, 2008.
5. M. Crochemore and D. Perrin. Two-way string-matching. J. ACM, 38(3):650-674, 1991.
6. M. Crochemore and W. Rytter. Squares, cubes, and time-space efficient string-searching. Algorithmica, 13(5):405-425, 1995.
7. M. Crochemore. String-matching on ordered alphabets. Theor. Comput. Sci., 92(1):33-47, 1992.
8. D.Z. Du and F.K. Hwang. Combinatorial Group Testing and its Applications, volume 12 of Series on Applied Mathematics. World Scientific, 2nd edition, 2000.
9. R. Dorfman. The detection of defective members of large populations. The Annals of Mathematical Statistics, 14(4):436-440, 1943.
10. L. Gasieniec, W. Plandowski, and W. Rytter. The zooming method: a recursive approach to time-space efficient string-matching. Theor. Comput. Sci., 147(1-2):19-30, 1995.
11. Z. Galil and J. Seiferas. Time-space-optimal string matching (preliminary report). In STOC '81: Proceedings of the thirteenth annual ACM symposium on Theory of computing, pages 106-113, New York, NY, USA, 1981. ACM.
12. Piotr Indyk. Faster algorithms for string matching problems: Matching the convolution bound. pages 166-173, 1998.
13. D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast pattern matching in strings. SIAM J. Comp., 6:323-350, 1977.
14. S. Rao Kosaraju. Efficient string matching. Manuscript, 1987.
15. R.M. Karp and M.O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Res. and Dev., pages 249-260, 1987.
16. G. M. Landau and U. Vishkin. Efficient string matching with k mismatches. Theoretical Computer Science, 43:239-249, 1986.
17. W. Rytter. On maximal suffixes and constant-space lineartime versions of kmp algorithm. Theor. Comput. Sci., 299(1-3):763-774, 2003.