Related Experiment Video
Updated: Mar 16, 2026

Iterative Optimization of DNA Duplexes for Crystallization of SeqA-DNA Complexes
Published on: November 1, 2012
An Optimal Seed Based Compression Algorithm for DNA Sequences
Pamela Vinitha Eric1, Gopakumar Gopalakrishnan2, Muralikrishnan Karunakaran2
1Department of Information Science and Engineering, Rajiv Gandhi Institute of Technology, Bangalore 560032, India.
Abstract:
This paper proposes a seed based lossless compression algorithm to compress a DNA sequence which uses a substitution method that is similar to the LempelZiv compression scheme. The proposed method exploits the repetition structures that are inherent in DNA sequences by creating an offline dictionary which contains all such repeats along with the details of mismatches. By ensuring that only promising mismatches are allowed, the method achieves a compression ratio that is at par or better than the existing lossless DNA sequence compression algorithms.
More Related Videos
Related Concept Videos
DNA Isolation
Evolutionary Relationships through Genome Comparisons
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Sanger Sequencing
The Nucleosome
In a chromosome, DNA is wound twice around a protein complex called a histone octamer core, which consists of 8 histone proteins. This...
DNA as a Genetic Template

