The DOI matches its Crossref record.
New text indexing functionalities of the compressed suffix arrays
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
Cited by
Navarro, G., & Mäkinen, V. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216372 · Cited by 735
Ferragina, P., & Manzini, G. (2005) · Journal of the ACM · doi:10.1145/1082036.1082039 · Cited by 686
Compressed representations of sequences and full-text indexes
Ferragina, P., Manzini, G., Mäkinen, V., & Navarro, G. (2007) · ACM Transactions on Algorithms · doi:10.1145/1240233.1240243 · Cited by 373
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
Compressed Suffix Trees with Full Functionality
Sadakane, K. (2007) · Theory of Computing Systems · doi:10.1007/s00224-006-1198-x · Cited by 293
Self-citation
Metadata
- Authors
- Sadakane, K.
- Venue
- Journal of Algorithms
- Publisher
- Elsevier BV
- Published
- 2003-09
- Volume
- 48
- Issue
- 2
- Pages
- 294-313
- ISSN
- 0196-6774 (ISSN-L)
- OpenAlex
- W2046038806
- Cited by
- 233
- References
- 0
- FWCI
- 5.65
- 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: New text indexing functionalities of the compressed suffix arrays. https://app.cochat.ai/papers/10.1016/s0196-6774(03)00087-7
- The paper
- Sadakane, K. (2003). New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms. https://doi.org/10.1016/s0196-6774(03)00087-7
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.