Linear pattern matching algorithms
Peter Weiner low
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 |
|---|---|---|
| The Art of Computer Programming. Volume 1: Fundamental Algorithms. | 1969 | 2,572 |
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 |
| A Space-Economical Suffix Tree Construction Algorithm | 1976 | 1,521 |
| On-line construction of suffix trees | 1995 | 1,483 |
Links
Topics
| Algorithms and Data Compression | Computer Science |
| Network Packet Processing and Optimization | 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.
- supports1 author record(s) attached.
- supports9 reference(s) recorded.
- supportsThe DOI's year agrees with the publication year.
- supportsA title is present.
Provenance
sha256 db1645b78a57e29a…