An algorithm for string matching with a sequence of don't cares
Information Processing Letters
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
Multiplication, division, and shift instructions in parallel random access machines
Theoretical Computer Science
On the power of the shift instruction
Information and Computation
Matching a set of strings with variable length don't cares
Theoretical Computer Science
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Methods and Problems in Data Mining
ICDT '97 Proceedings of the 6th International Conference on Database Theory
String Matching with Constraints
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A Faster Algorithm for Approximate String Matching
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
A characterization of the power of vector machines
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
| Hi-index | 0.89 |
Given q + 1 strings (a text t of length n and q patterns m1,....,mq) and a natural number w, the multiple serial episode matching problem consists in finding the number of size w windows of text t which contain patterns m1,...,mq as subsequences, i.e., for each mi, if mi = p1,...,pk, the letters p1,...,pk occur in the window, in the same order as in mi, but not necessarily consecutively (they may be interleaved with other letters). Our main contribution here is an algorithm solving this problem on-line in time O(nq) with an MP-RAM model (which is a RAM model equipped with extra operations).