Constant-space string matching with smaller number of comparisons: sequential sampling-Reference-Cited by-同舟云学术

Constant-space string matching with smaller number of comparisons: sequential sampling

Published:1995 Issue: Volume: Page:78-89
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Gasieniec Leszek,Plandowski Wojciech,Rytter Wojciech

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60044-2_36.pdf

Reference18 articles.

1. A.V. Aho, Algorithms for Finding Patterns in Strings. In Handbook of Theoretical Computer Science, p. 257–300. Elsevier Science Publishers B. V., Amsterdam, The Netherlands, 1990.

2. D. Breslauer, private communication.

3. D. Breslauer, Saving Comparisons in the Crochemore-Perrin String Matching Algorithm. In Proc. of 1st European Symp. on Algorithms, p. 61–72, 1993.

4. D. Breslauer and Z. Galil, Efficient Comparison Based String Matching. J. Complexity 9(3), p. 339–365, 1993.

5. R. Cole, R. Hariharan, Tighter bounds on the exact complexity of string matching. In Proc. of 33rd Annual Symp. on Foundations of Comp. Sci., p. 600–609, 1992.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching;ACM Transactions on Algorithms;2024-08-05

2. Constant-Time Word-Size String Matching;Combinatorial Pattern Matching;2012

3. Simple Real-Time Constant-Space String Matching;Combinatorial Pattern Matching;2011

4. Maxime Crochemore, Thierry Lecroq;Studies in Computational Intelligence;2006

5. Real-Time String Matching in Sublinear Space;Combinatorial Pattern Matching;2004