A fast string searching algorithm
Robert S. Boyer low, J Strother Moore
The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
What this paper cites, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| Efficient string matching | 1975 | 2,965 |
| Fast Pattern Matching in Strings | 1977 | 2,961 |
What cites it, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| A guided tour to approximate string matching | 2001 | 2,586 |
| Information Retrieval: Data Structures and Algorithms | 1992 | 2,431 |
Links
Topics
| Algorithms and Data Compression | Computer Science |
| semigroups and automata theory | Computer Science |
| Natural Language Processing Techniques | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports2 author record(s) attached.
- supports3 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 86a6d6715ff540a0…