The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Compressed Suffix Trees with Full Functionality
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
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
Algorithms on strings, trees, and sequences
Gusfield, D. (1997) · Cited by 1,697
A Space-Economical Suffix Tree Construction Algorithm
McCreight, E. M. (1976) · Journal of the ACM · doi:10.1145/321941.321946 · Cited by 1,511
On-line construction of suffix trees
Ukkonen, E. (1995) · Algorithmica · doi:10.1007/bf01206331 · Cited by 1,472
Opportunistic data structures with applications
Ferragina, P., & Manzini, G. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892127 · Cited by 1,063
Bender, M. A., & Farach-Colton, M. (2000) · Lecture notes in computer science · doi:10.1007/10719839_9 · Cited by 815
Crochemore, M., Hancart, C., & Lecroq, T. (2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546853 · Cited by 676
Optimal suffix tree construction with large alphabets
Farach, M. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646102 · Cited by 443
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
Grossi, R., & Vitter, J. S. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539702402354 · Cited by 431
Reducing the space requirement of suffix trees
Kurtz, S. (1999) · Software: Practice and Experience · doi:10.1002/(sici)1097-024x(199911)29:13<1149::aid-spe274>3.0.co;2-o · Cited by 334
Cited by
Ligra: a lightweight graph processing framework for shared memory
Shun, J., & Blelloch, G. E. (2013) · Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/2442516.2442530 · Cited by 798
From Theory to Practice: Plug and Play with Succinct Data Structures
Gog, S., Beller, T., Moffat, A., & Petri, M. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-07959-2_28 · Cited by 340
Farruggia, A., Gagie, T., Navarro, G., Puglisi, S. J., & Sirén, J. (2018) · The Computer Journal · doi:10.1093/comjnl/bxx108 · Cited by 14
Metadata
- Authors
- Sadakane, K.
- Venue
- Theory of Computing Systems
- Published
- 2007-02-07
- Volume
- 41
- Issue
- 4
- Pages
- 589-607
- ISSN
- 0025-5661 (ISSN-L)
- 1432-4350
- 1433-0490
- OpenAlex
- W2073921136
- Cited by
- 293
- References
- 20
- FWCI
- 22.06
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Compressed Suffix Trees with Full Functionality. https://app.cochat.ai/papers/10.1007/s00224-006-1198-x
- The paper
- Sadakane, K. (2007). Compressed Suffix Trees with Full Functionality. Theory of Computing Systems. https://doi.org/10.1007/s00224-006-1198-x
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.