A Space-Economical Suffix Tree Construction Algorithm

1976 · Journal of the ACM · 1,521 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
Fast Pattern Matching in Strings	1977	2,961
Linear pattern matching algorithms	1973	1,829

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 Block-sorting Lossless Data Compression Algorithm	1994	2,371
Suffix Arrays: A New Method for On-Line String Searches	1993	1,966
On-line construction of suffix trees	1995	1,483

Links

DOI · Open access copy · OpenAlex record

Topics

Algorithms and Data Compression	Computer Science
Web Data Mining and Analysis	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.
supports5 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:57+00:00.

sha256 b3024609427ad450…