A compression algorithm for DNA sequences: Using approximate matching for better compression ratio to reveal the true characteristics of DNA

IEEE Engineering in Medicine and Biology Magazine

Volumn 20, Issue 4, 2001, Pages 61-66

  Chen, Xin ^a   Kwong, Sam ^b   Li, Ming ^c  

^a PEKING UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; COMPUTER SYSTEM; DNA SEQUENCE; ERRATUM; GENOME; SEQUENCE ANALYSIS;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DATABASES, NUCLEIC ACID; DNA; HUMANS; SEQUENCE ANALYSIS, DNA;

EID: 0034890615     PISSN: 07395175     EISSN: None     Source Type: Journal    
DOI: 10.1109/51.940049     Document Type: Erratum

References (20)

1. Robust transmission of unbounded strings using Fibonacci representations
2. Statistical analysis of deoxyribonucleic acid sequence data-a review
3. A new challenge for compression algorithms: Genetic sequences
4. Compression of DNA sequences
5. Estimating DNA sequence entropy
6. Compression of individual sequences via variable-rate coding
7. Significantly lower entropy estimates for natural DNA sequences
8. A guaranteed compression scheme for repetitive dna sequences
9. Detection of significant patterns by compression algorithms: The case of Approximate Tandem Repeats in DNA sequences
10. Universal data compression algorithm based on approximate string matching
11. A compression algorithm for DNA sequences and its application in genome comparison
12. A universal algorithm for sequential data compression
13. Sequence complexity for biological sequence analysis
14. Discovery by minimal length encoding: A case study in molecular evolution
15. An information based distance and its application to whole mitochondrial genome phylogeny
16. Arithmetic coding for data compression