D. Sunday. A very fast substring searching algorithm. Comm. ACM, 33(8):132-- 142, August 1990. Home/Search Document Not in Database Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
Bit-parallel (δ,γ)-Matching and Suffix.. - Crochemore.. (Correct)
No context found.
D. Sunday. A very fast substring searching algorithm. Comm. ACM, 33(8):132-- 142, August 1990.
A Bit-parallel Suffix Automaton Approach for.. - Crochemore.. (Correct)
No context found.
D. Sunday. A very fast substring searching algorithm. Comm. ACM, 33(8):132{ 142, August 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC