2005/06/12 by Liu, Jie, Bao, Sheng, Jing, Zhiqiang +1
#E.4 #FOS: Computer and information sciences #Information Theory (cs.IT) #J.3
paper · doi:10.48550/arxiv.cs/0506040
While achieving a compression ratio of 2.0 bits/base, the new algorithm codes non-N bases in fixed length. It dramatically reduces the time of coding and decoding than previous DNA compression algorithms and some universal compression programs.