Abstract
A lossless compression algorithm, GenCompress, is proposed for DNA sequences. Significantly better compression results indicated that the approximate repeats are one of the main hidden regularities in DNA sequences. GenCompress is also applied to approximate the Kolmogorov complexity.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB |
| Publisher | Association for Computing Machinery |
| Publication status | Published - 2000 |
| Event | RECOMB 2000: 4th Annual International Conference on Computational Molecular Biology - Tokyo, Jpn Duration: 8 Apr 2000 → 11 Apr 2000 |
Conference
| Conference | RECOMB 2000: 4th Annual International Conference on Computational Molecular Biology |
|---|---|
| City | Tokyo, Jpn |
| Period | 8/04/00 → 11/04/00 |
Fingerprint
Dive into the research topics of 'Compression algorithm for DNA sequences and its applications in genome comparison'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver