Pattern matching in multiple streams

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

Volumn 7354 LNCS, Issue , 2012, Pages 97-109

  Clifford, Raphaël ^a   Jalsenius, Markus ^a   Porat, Ely ^b   Sach, Benjamin ^c  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b BAR ILAN UNIVERSITY   (Israel)

^c UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT TIME; DETERMINISTIC PATTERNS; EXACT MATCHING; LOWER BOUNDS; MULTIPLE STREAMS; NEW MODEL; PATTERN MATCHING PROBLEMS; SPACE BOUNDS; STREAMING TEXTS; TIME STEP;

ARTIFICIAL INTELLIGENCE;

PATTERN MATCHING;

EID: 84863109570     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31265-6_8     Document Type: Conference Paper

References (23)

1. Abrahamson, K.: Generalized string matching. SIAM Journal on Computing 16(6), 1039-1051 (1987)
2. Amir, A., Landau, G.M., Lewenstein, M., Sokol, D.: Dynamic text and static pattern matching. ACM Transactions on Algorithms (TALG) 3(2) (2007)
3. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. Journal of Algorithms 50(2), 257-275 (2004)
4. Breslauer, D., Galil, Z.: Real-Time Streaming String-Matching. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 162-172. Springer, Heidelberg (2011)
5. Clifford, R., Efremenko, K., Porat, B., Porat, E.: A Black Box for Online Approximate Pattern Matching. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 143-151. Springer, Heidelberg (2008)
6. Clifford, R., Efremenko, K., Porat, B., Porat, E.: A black box for online approximate pattern matching. Information and Computation 209(4), 731-736 (2011)
7. Clifford, R., Jalsenius, M., Porat, E., Sach, B.: Space Lower Bounds for Online Pattern Matching. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 184-196. Springer, Heidelberg (2011)
8. Clifford, R., Sach, B.: Pseudo-realtime Pattern Matching: Closing the Gap. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 101-111. Springer, Heidelberg (2010)
9. Clifford, R., Sach, B.: Pattern matching in pseudo real-time. Journal of Discrete Algorithms 9(1), 67-81 (2011)
10. Ergun, F., Jowhari, H., Saǧlam, M.: Periodicity in Streams. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010, LNCS, vol. 6302, pp. 545-559. Springer, Heidelberg (2010)
11. Galil, Z.: String matching in real time. Journal of the ACM 28(1), 134-149 (1981)
12. Indyk, P.: Faster algorithms for string matching problems: Matching the convolution bound. In: FOCS 1998: Proc. 39th Annual Symp. Foundations of Computer Science, pp. 166-173 (1998)
13. Jayram, T.S., Kumar, R., Sivakumar, D.: The one-way communication complexity of hamming distance. Theory of Computing 4(1), 129-135 (2008)
14. Karloff, H.: Fast algorithms for approximately counting mismatches. Information Processing Letters 48(2), 53-60 (1993)
15. Kosaraju, S.R.: Efficient string matching (1987) (manuscript)
16. Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press (1997)
17. Landau, G.M., Vishkin, U.: Efficient string matching in the presence of errors. In: FOCS 1985: Proc. 26th Annual Symp. Foundations of Computer Science, pp. 126-136 (1985)
18. Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science 43, 239-249 (1986)
19. Landau, G.M., Vishkin, U.: Fast string matching with k differences. Journal of Computer System Sciences 37(1), 63-78 (1988)
20. Porat, B., Porat, E.: Exact and approximate pattern matching in the streaming model. In: FOCS 2009: Proc. 50th Annual Symp. Foundations of Computer Science, pp. 315-323 (2009)
21. Ružić, M.: Constructing Efficient Dictionaries in Close to Sorting Time. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 84-95. Springer, Heidelberg (2008)
22. Simon, I.: String matching algorithms and automata. In: First American Workshop on String Processing, pp. 151-157 (1993)
23. Yao, A.C.-C.: Some complexity questions related to distributive computing. In: STOC 1979: Proc. 11th Annual ACM Symp. Theory of Computing, pp. 209-213 (1979)