The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Practical Entropy-Compressed Rank/Select Dictionary
Open accessAbstract
Rank/Select dictionaries are data structures for an ordered set S ⊂ {0,1,…, n − 1} to compute runk(x, S) (the number of elements in S that are no greater than x), and select(i, S) (the i-th smallest element in S), which are the fundamental components of succinct data structures of strings, trees, graphs, etc‥ In these data structures, however, only asymptotic behavior has been considered and their performance for real data is not satisfactory. In this paper, we propose four novel Rank/Select dictionaries: esp, recrank, vcode and sdarray, each of which is small if the number of elements in S is small, and indeed close to nH0(S) (H0(S) < 1 is the zero-th order empirical entropy of S) in practice. Furthermore, their query times are superior to those of existing structures. Experimental results reveal the characteristics of our data structures and also show that these data structures are superior to existing implementations, both in terms of size and query time.
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
Ferragina, P., & Manzini, G. (2005) · Journal of the ACM · doi:10.1145/1082036.1082039 · Cited by 686
High-order entropy-compressed text indexes
Grossi, R., Gupta, A. K., & Vitter, J. S. (2003) · doi:10.5555/644108.644250 · Cited by 648
Space-efficient static trees and graphs
Jacobson, G. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63533 · Cited by 634
Cover, T. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1054929 · Cited by 504
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
Raman, R., Raman, V., & Satti, S. R. (2002) · doi:10.5555/545381.545411 · Cited by 387
New text indexing functionalities of the compressed suffix arrays
Sadakane, K. (2003) · Journal of Algorithms · doi:10.1016/s0196-6774(03)00087-7 · Cited by 233
Self-citationSuccinct representations of lcp information and improvements in the compressed suffix arrays
Sadakane, K. (2002) · doi:10.5555/545381.545410 · Cited by 134
Self-citationMunro, I., Raman, V., & Satti, S. R. (1998) · Lecture notes in computer science · doi:10.1007/978-3-540-49382-2_17 · Cited by 91
When indexing equals compression: experiments with compressing suffix arrays and applications
Grossi, R., Gupta, A. K., & Vitter, J. S. (2004) · doi:10.5555/982792.982888 · Cited by 76
Lower bounds on the size of selection and rank indexes
Miltersen, P. B. (2005) · Symposium on Discrete Algorithms · doi:10.5555/1070432.1070435 · Cited by 39
Cited by
Variation graph toolkit improves read mapping by representing genetic variation in the reference
Garrison, E., Sirén, J., Novak, A. M., Hickey, G., Eizenga, J. M., Dawson, E. T., Jones, W., Garg, S., Markello, C., Lin, M. F., et al. (2018) · Nature Biotechnology · doi:10.1038/nbt.4227 · Cited by 821
Navarro, G., & Mäkinen, V. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216372 · Cited by 735
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
Xenome—a tool for classifying reads from xenograft samples
Conway, T., Wazny, J., Bromage, A., Tymms, M., Sooraj, D., Williams, E. D., & Beresford-Smith, B. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts236 · Cited by 276
GBZ file format for pangenome graphs
Sirén, J., & Paten, B. (2022) · Bioinformatics · doi:10.1093/bioinformatics/btac656 · Cited by 35
Metadata
- Authors
- Okanohara, D., & Sadakane, K.
- Venue
- 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)
- Published
- 2007-01-06
- Pages
- 60-70
- OpenAlex
- W1949346071
- Cited by
- 265
- References
- 13
- FWCI
- 8.24
- Type
- conference paper
- Language
- en
- Open access
- green
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: Practical Entropy-Compressed Rank/Select Dictionary. https://app.cochat.ai/papers/10.1137/1.9781611972870.6
- The paper
- Okanohara, D., & Sadakane, K. (2007). Practical Entropy-Compressed Rank/Select Dictionary. 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX). https://doi.org/10.1137/1.9781611972870.6
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.