Compression algorithm for DNA sequences and its applications in genome comparison

Xin CHEN, Sam KWONG, Ming LI

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

90 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of the Annual International Conference on Computational Molecular Biology, RECOMB
PublisherACM
Publication statusPublished - 2000
Externally publishedYes
EventRECOMB 2000: 4th Annual International Conference on Computational Molecular Biology - Tokyo, Japan
Duration: 8 Apr 200011 Apr 2000

Conference

ConferenceRECOMB 2000: 4th Annual International Conference on Computational Molecular Biology
Country/TerritoryJapan
CityTokyo
Period8/04/0011/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