Efficient string matching

1975 · Communications of the ACM · 2,965 citations · 5 from inside this corpus

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.

7 of 7 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.

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
Switching and Finite Automata Theory	2009	1,780
Sorting and Searching	1973	1,537

What cites it, inside the corpus

Paper	Year	Cited
Fast Pattern Matching in Strings	1977	2,961
A guided tour to approximate string matching	2001	2,586
Information Retrieval: Data Structures and Algorithms	1992	2,431
A fast string searching algorithm	1977	2,299
On-line construction of suffix trees	1995	1,483

Links

DOI · OpenAlex record

Topics

Algorithms and Data Compression	Computer Science
semigroups and automata theory	Computer Science
DNA and Biological Computing	Biochemistry, Genetics and Molecular Biology

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

supports2 author record(s) attached.
supports16 reference(s) recorded.
neutralThe DOI carries no year to check against.
supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:48+00:00.

sha256 46f669157f96ea35…