A Fixed-Length Coding Algorithm for DNA Sequence Compression
classification
💻 cs.IT
math.IT
keywords
compressionalgorithmcodingachievingalgorithmsbasebasesbits
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.