Efficient string matching with k mismatches
Theoretical Computer Science
SIAM Journal on Computing
Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Fast algorithms for approximately counting mismatches
Information Processing Letters
Communication complexity
Journal of the ACM (JACM)
Faster Algorithms for String Matching Problems: Matching the Convolution Bound
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Dynamic text and static pattern matching
ACM Transactions on Algorithms (TALG)
Efficient string matching in the presence of errors
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A Black Box for Online Approximate Pattern Matching
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Constructing Efficient Dictionaries in Close to Sorting Time
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Exact and Approximate Pattern Matching in the Streaming Model
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Pseudo-realtime pattern matching: closing the gap
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Pattern matching in pseudo real-time
Journal of Discrete Algorithms
A black box for online approximate pattern matching
Information and Computation
Real-time streaming string-matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Space lower bounds for online pattern matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Hi-index | 0.00 |
We investigate the problem of deterministic pattern matching in multiple streams. In this model, one symbol arrives at a time and is associated with one of s streaming texts. The task at each time step is to report if there is a new match between a fixed pattern of length m and a newly updated stream. As is usual in the streaming context, the goal is to use as little space as possible while still reporting matches quickly. We give almost matching upper and lower space bounds for three distinct pattern matching problems. For exact matching we show that the problem can be solved in constant time per arriving symbol and O(m+s) words of space. For the k-mismatch and k-difference problems we give O(k) time solutions that require O(m+ks) words of space. In all three cases we also give space lower bounds which show our methods are optimal up to a single logarithmic factor. Finally we set out a number of open problems related to this new model for pattern matching.