Related Experiment Video
Updated: Jul 28, 2026

Analyzing and Building Nucleic Acid Structures with 3DNA
Published on: April 26, 2013
A Compression Algorithm for DNA Sequences and Its Applications in Genome Comparison
Abstract:
We present a lossless compression algorithm, GenCompress, for genetic sequences, based on searching for approximate repeats. Our algorithm achieves the best compression ratios for benchmark DNA sequences. Significantly better compression results show that the approximate repeats are one of the main hidden regularities in DNA sequences. We then describe a theory of measuring the relatedness between two DNA sequences. Using our algorithm, we present strong experimental support for this theory, and demonstrate its application in comparing genomes and constructing evolutionary trees.
Related Concept Videos
DNA as a Genetic Template
Evolutionary Relationships through Genome Comparisons
Sanger Sequencing
Genome Annotation and Assembly
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...
Applications of Molecular Taxonomy

