关键词: DNA序列数据, 多重压缩, Huffman编码, Burrows-Wheeler编码

Abstract: The multiple-compression concept was proposed based on the characteristics of DNA sequence data. The first step of multiple-compression is to enlarge the alphabet. Firstly, DNA sequence data was encoded by 0/1 coding, and then every eight bits was transformed into an ASCII character. Through this step, the former DNA sequence data with only four characters would be enlarged to 256 characters. Secondly, the enlarged DNA sequence data was compressed for the second time with Huffman coding compression algorithm based on statistical model and Burrows-Wheeler coding algorithm based on transition model separately. Finally, the compression performances of all algorithms were compared. The results show that the multiple-compression algorithm is better than others in terms of compression ratio.

Key words: DNA sequence data, multiple-compression, Huffman coding, Burrows-Wheeler coding