A Space-Economical Suffix Tree Construction Algorithm
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
Citation edge evidence
- A guided tour to approximate string matching→A Space-Economical Suffix Tree Construction AlgorithmLegacy edge — source detail unavailable
- Information Retrieval: Data Structures and Algorithms→A Space-Economical Suffix Tree Construction AlgorithmLegacy edge — source detail unavailable
- A Block-sorting Lossless Data Compression Algorithm→A Space-Economical Suffix Tree Construction AlgorithmLegacy edge — source detail unavailable
- Suffix Arrays: A New Method for On-Line String Searches→A Space-Economical Suffix Tree Construction AlgorithmLegacy edge — source detail unavailable
- On-line construction of suffix trees→A Space-Economical Suffix Tree Construction AlgorithmLegacy edge — source detail unavailable
- A Space-Economical Suffix Tree Construction Algorithm→Fast Pattern Matching in StringsLegacy edge — source detail unavailable
- A Space-Economical Suffix Tree Construction Algorithm→Linear pattern matching algorithmsLegacy edge — source detail unavailable
- Information Retrieval: Data Structures and Algorithms→Fast Pattern Matching in StringsLegacy edge — source detail unavailable
- Information Retrieval: Data Structures and Algorithms→Suffix Arrays: A New Method for On-Line String SearchesLegacy edge — source detail unavailable
- Information Retrieval: Data Structures and Algorithms→Linear pattern matching algorithmsLegacy edge — source detail unavailable
- A guided tour to approximate string matching→Fast Pattern Matching in StringsLegacy edge — source detail unavailable
- A guided tour to approximate string matching→On-line construction of suffix treesLegacy edge — source detail unavailable
- A guided tour to approximate string matching→Linear pattern matching algorithmsLegacy edge — source detail unavailable
- On-line construction of suffix trees→Linear pattern matching algorithmsLegacy edge — source detail unavailable
- Suffix Arrays: A New Method for On-Line String Searches→Information Retrieval: Data Structures and AlgorithmsLegacy edge — source detail unavailable
- A Block-sorting Lossless Data Compression Algorithm→Suffix Arrays: A New Method for On-Line String SearchesLegacy edge — source detail unavailable
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
Download BibTeX · Download RIS · 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
sha256 b3024609427ad450…