00000cab a22000003a 4500 UP-99796217609212260 Buklod 20231007234030.0 m |o d | ta 100323s xx d | ||r ||||| || DENGII eng Xin Chen A compression algorithm for DNA sequences. pp. 61-66 We present a DNA compression algorithm, GenCompress, based on approximate matching that gives the best compression results on standard benchmark DNA sequences. We present the design rationale of GenCompress based on approximate matching, discuss details of the algorithm, provide experimental results, and compare the results with the two most effective compression algorithms for DNA sequences (Biocompress-2 and Cfact). DNA sequences. GenCompress. Approximate matching. Benchmark sequences. Bioinformatics. Compression algorithm. Edit operations. Entropy. Optimal prefix search. IEEE Engineering in medicine and biology magazine 20, 4 (2001). FO UPD DENG-II Article