The DOI matches its Crossref record.
A compression algorithm for DNA sequences and its applications in genome comparison
Open accessAbstract
We present a lossless compression algorithm, Gen-Compress, for DNA sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for benchmark DNA sequences, comparing to other DNA compression programs [3, 7]. Significantly better compression results show that the approximate repeats are one of the main hidden regularities in DNA sequences.
Overview
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
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
Self-citationEsling, P., & Agon, C. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379788 · Cited by 997
Alignment-free sequence comparison—a review
Vinga, S., & Almeida, J. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg005 · Cited by 804
Towards parameter-free data mining
Keogh, E., Lonardi, S., & Ratanamahatana, C. A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014077 · Cited by 567
Alignment-free genome comparison with feature frequency profiles (FFP) and optimal resolutions
Sims, G. E., Jun, S.-R., Wu, G. A., & Kim, S.-H. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0813249106 · Cited by 400
Metadata
- Authors
- Chen, X., Kwong, S., & Li, M.
- Venue
- Proceedings of the fourth annual international conference on Computational molecular biology
- Publisher
- ACM
- Published
- 2000-04-08
- Pages
- 107
- OpenAlex
- W2108278098
- Cited by
- 218
- References
- 0
- FWCI
- 1.97
- Type
- conference paper
- Language
- en
- Open access
- gold
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 compression algorithm for DNA sequences and its applications in genome comparison. https://app.cochat.ai/papers/10.1145/332306.332352
- The paper
- Chen, X., Kwong, S., & Li, M. (2000). A compression algorithm for DNA sequences and its applications in genome comparison. Proceedings of the fourth annual international conference on Computational molecular biology. https://doi.org/10.1145/332306.332352
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.