Algorithms - ESA 2015 pp 361-372
Dictionary Matching in a Stream
- Cite this paper as:
- Clifford R., Fontaine A., Porat E., Sach B., Starikovskaya T. (2015) Dictionary Matching in a Stream. In: Bansal N., Finocchi I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science, vol 9294. Springer, Berlin, Heidelberg
We consider the problem of dictionary matching in a stream. Given a set of strings, known as a dictionary, and a stream of characters arriving one at a time, the task is to report each time some string in our dictionary occurs in the stream. We present a randomised algorithm which takes O(loglog(k + m)) time per arriving character and uses O(k logm) words of space, where k is the number of strings in the dictionary and m is the length of the longest string in the dictionary.
Unable to display preview. Download preview PDF.