Pulse Journal Club Trending Explore Questions Researchers

Download the App

Join discussions, follow papers, and never miss your next session.

© Synapse Social LLC, 2026Privacy Policy

⌘+K

Fast text searching | Synapse

October 1, 1992Open Access

Fast text searching

Key Points

Key points are not available for this paper at this time.

Abstract

The string-matching problem is a very common problem.

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Loading...

Cite this study

Wu et al. (Thu,) studied this question.

synapsesocial.com/papers/6a125d73a2d24b27c1672af9 — DOI: https://doi.org/10.1145/135239.135244

Authors

S

Sun Wu

University of Arizona

U

Udi Manber

University of Wisconsin–Madison

Journals

Communications of the ACM

Actions

Institutions

University of Arizona

Nokia (United States)

References and Citations

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Loading...

Also consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

Approximate pattern matching and its applications· 1992 · 4 citations
Approximate Boyer–Moore String Matching· 1993 · 85 citations
An Improved Algorithm For Approximate String Matching· 1990 · 168 citations
Handbook of algorithms and data structures· 1984 · 439 citations
Binary codes capable of correcting deletions, insertions and reversals· 1965 · 10,380 citations