A compression method for DNA
Open Access
- 25 November 2020
- journal article
- research article
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 15 (11), e0238220
- https://doi.org/10.1371/journal.pone.0238220
Abstract
The development of high-throughput sequencing technology has generated huge amounts DNA data. Many general compression algorithms are not ideal for compressing DNA data, such as the LZ77 algorithm. On the basis of Nour and Sharawi’s method,we propose a new, lossless and reference-free method to increase the compression performance. The original sequences are converted into eight intermediate files and six final files. Then, the LZ77 algorithm is used to compress the six final files. The results show that the compression time is decreased by 83% and the decompression time is decreased by 54% on average.The compression rate is almost the same as Nour and Sharawi’s method which is the fastest method so far. What’s more, our method has a wider range of application than Nour and Sharawi’s method. Compared to some very advanced compression tools at present, such as XM and FCM-Mx, the time for compression in our method is much smaller, on average decreasing the time by more than 90%.This publication has 8 references indexed in Scilit:
- Improve the compression of bacterial DNA sequencePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2017
- DNA Sequence Compression Using Adaptive Particle Swarm Optimization-Based Memetic AlgorithmIEEE Transactions on Evolutionary Computation, 2011
- Iterative Dictionary Construction for Compression of Large DNA Data SetsIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2011
- DNA sequence compression - Based on the normalized maximum likelihood modelIEEE Signal Processing Magazine, 2007
- Efficient Compression of non-repetitive DNA sequences using Dynamic ProgrammingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- DNA Compression Challenge Revisited: A Dynamic Programming ApproachLecture Notes in Computer Science, 2005
- PATTERNHUNTER II: HIGHLY SENSITIVE AND FAST HOMOLOGY SEARCHJournal of Bioinformatics and Computational Biology, 2004
- DNACompress: fast and effective DNA sequence compressionBioinformatics, 2002