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 | ACM |
| Publication status | Published - 2000 |
| Externally published | Yes |
| Event | RECOMB 2000: 4th Annual International Conference on Computational Molecular Biology - Tokyo, Japan Duration: 8 Apr 2000 → 11 Apr 2000 |
Conference
| Conference | RECOMB 2000: 4th Annual International Conference on Computational Molecular Biology |
|---|---|
| Country/Territory | Japan |
| City | Tokyo |
| Period | 8/04/00 → 11/04/00 |