The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
A new challenge for compression algorithms: Genetic sequences
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
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
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
A Technique for High-Performance Data Compression
Welch (1984) · Computer · doi:10.1109/mc.1984.1659158 · Cited by 2,182
The complete DNA sequence of yeast chromosome III
Oliver, S. G., van der Aart, Q. J. M., Agostoni-Carbone, M. L., Aigle, M., Alberghina, L., Alexandraki, D., Antoine, G., Anwar, R., Ballesta, J. P. G., Benit, P., et al. (1992) · Nature · doi:10.1038/357038a0 · Cited by 843
Data compression via textual substitution
Storer, J. A., & Szymanski, T. G. (1982) · Journal of the ACM · doi:10.1145/322344.322346 · Cited by 634
Mathematical Methods for DNA Sequences.
Kirkwood, T. B. L., & Waterman, M. S. (1990) · Biometrics · doi:10.2307/2532117 · Cited by 386
Lelewer, D. A., & Hirschberg, D. S. (1987) · ACM Computing Surveys · doi:10.1145/45072.45074 · Cited by 377
The Universal Turing Machine A Half-Century Survey
(1995) · Computerkultur · doi:10.1007/978-3-7091-6597-3 · Cited by 373
Data compression with finite windows
Fiala, E. R., & Greene, D. H. (1989) · Communications of the ACM · doi:10.1145/63334.63341 · Cited by 178
Cited by
Li, M., Chen, X., Li, X., Ma, B., & Vitanyi, P. M. B. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838101 · Cited by 1,062
An information-based sequence distance and its application to whole mitochondrial genome phylogeny
Li, M., Badger, J. H., Chen, X., Kwong, S., Kearney, P., & Zhang, H. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.2.149 · Cited by 527
XMill: an efficient compressor for XML data
Liefke, H., & Suciu, D. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335405 · Cited by 414
Efficient DNA sequence compression with neural networks
Silva, M., Pratas, D., & Pinho, A. J. (2020) · GigaScience · doi:10.1093/gigascience/giaa119 · Cited by 57
Metadata
- Authors
- Grumbach, S., & Tahi, F.
- Venue
- Information Processing & Management
- Publisher
- Elsevier BV
- Published
- 1994-11
- Volume
- 30
- Issue
- 6
- Pages
- 875-886
- ISSN
- 0020-0271 (ISSN-L)
- 0306-4573
- OpenAlex
- W1970231722
- Cited by
- 272
- References
- 12
- FWCI
- 1.02
- Type
- journal article
- 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: A new challenge for compression algorithms: Genetic sequences. https://app.cochat.ai/papers/10.1016/0306-4573(94)90014-0
- The paper
- Grumbach, S., & Tahi, F. (1994). A new challenge for compression algorithms: Genetic sequences. Information Processing & Management. https://doi.org/10.1016/0306-4573(94)90014-0
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.