The Myriad Virtues of Subword Trees
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Compression of individual sequences via variable-rate coding
Ziv, J., & Lempel, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055934 · Cited by 3,432
Efficient string matching: an aid to bibliographic search
Aho, A. V., & Corasick, M. J. (1975) · Communications of the ACM · doi:10.1145/360825.360855 · Cited by 2,944
Fast Pattern Matching in Strings
Knuth, D. E., Morris, Jr., & Pratt, V. R. (1977) · SIAM Journal on Computing · doi:10.1137/0206024 · Cited by 2,936
On the Complexity of Finite Sequences
Lempel, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055501 · Cited by 2,717
Linear pattern matching algorithms
Weiner, P. (1973) · 14th Annual Symposium on Switching and Automata Theory (swat 1973) · doi:10.1109/swat.1973.13 · Cited by 1,801
A Space-Economical Suffix Tree Construction Algorithm
McCreight, E. M. (1976) · Journal of the ACM · doi:10.1145/321941.321946 · Cited by 1,511
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Morrison, D. R. (1968) · Journal of the ACM · doi:10.1145/321479.321481 · Cited by 969
An optimal algorithm for computing the repetitions in a word
Crochemore, M. (1981) · Information Processing Letters · doi:10.1016/0020-0190(81)90024-7 · Cited by 315
Rapid identification of repeated patterns in strings, trees and arrays
Karp, R. M., Miller, R. E., & Rosenberg, A. L. (1972) · Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72 · doi:10.1145/800152.804905 · Cited by 274
Coding theorems for individual sequences
Ziv, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055911 · Cited by 180
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
Manacher, G. K. (1975) · Journal of the ACM · doi:10.1145/321892.321896 · Cited by 153
Cited by
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
Suffix Arrays: A New Method for On-Line String Searches
Manber, U., & Myers, G. (1993) · SIAM Journal on Computing · doi:10.1137/0222058 · Cited by 1,915
On-line construction of suffix trees
Ukkonen, E. (1995) · Algorithmica · doi:10.1007/bf01206331 · Cited by 1,472
Navarro, G., & Mäkinen, V. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216372 · Cited by 735
Replacing suffix trees with enhanced suffix arrays
Abouelhoda, M. I., Kurtz, S., & Ohlebusch, E. (2004) · Journal of Discrete Algorithms · doi:10.1016/s1570-8667(03)00065-0 · Cited by 668
Metadata
- Authors
- Apostolico, A.
- Venue
- Combinatorial Algorithms on Words
- Publisher
- Springer Berlin Heidelberg
- Published
- 1985
- Pages
- 85-96
- OpenAlex
- W1485516007
- Cited by
- 274
- References
- 15
- FWCI
- 5.73
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.