多重压缩DNA序列数据.pdfVIP

第 30 卷第 5 期 计算机应用 Vol. 30 No.5 2010 年5 月 Joumal of Computer Applications May 2010 文章编号:1∞1 -9081(2010)05 吨 1379 …04 多重压缩 DNA 序列数据 张丽霞，宋鸿盼 (华南农业大学信息学院，广州 51俑42) ( lixia.白如ng@sc剧. edu. cn) 摘 要:根据 DNA 序列数据的特点，提出对 DNA 序列数据进行多重压缩的思想。多重压缩的首要步骤是扩展字 母求。首先对 DNA 序列数据进行。/1 编码，然后每8 位转换成一个 ASCII 码字符，将原来的 DNA 序列数据仅含有的 4 个字符扩展到 256 个字符ω 第二步采取基于统计模型的 Huffman 编码压缩算法和基于转换模型的 Burrows-Wheeler 算法，对扩展后的 DNA 序列数据进行二次压缩α 最后对各种算法的压缩结果进行性能分析比较，比较结果显示，多交 压缩算法有较优的压缩比。 关键诩:DNA}抑IJ 数据;多重压缩;H幽nan 编码;Burrows幽Wheeler 编码 中回分类号:1凹11.56 文献标志明:A Multiple-compression of DNA sequence data ZHANG Li叹ia， SONG Hong-zhi ( College of 1呐， nnatics， South China Agricultural Uni时rSuy. G:阳ng劝ou G1Ulngdong 51伽42， China) Abstract: The multiple-compression concept wωproposed based on the characteristics of DNA 酷刑ence data. 咀le first step of multiple-compression is to enlarge the alphabet. Firstly , DNA se伊ence data w刷 encoded by 0/1 coding, and 出en eve巧 eight bits was 忧.ansformed into an ASCII character. Through this step, the former DNA sequence data with only four characters would he enlarged to 256 charωters. Secondly, the enlar蜘d DNA 阳quence 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 compre自sion performances of all algorithms were compared. The results show that the multiple-compression algorithm is better than olhers in term翩。f compression ratio.