Related Experiment Video
Updated: Mar 15, 2026

Ultra-long Read Sequencing for Whole Genomic DNA Analysis
Published on: March 15, 2019
Finding low-complexity DNA sequences with longdust
1Department of Biomedical Informatics, Harvard Medical School, Boston, MA 02215, United States.
Motivation:
Low-complexity (LC) DNA sequences are compositionally repetitive sequences that are often associated with spurious homologous matches and variant calling artifacts. While algorithms for identifying LC sequences exist, they either lack concise mathematical definition of complexity or are inefficient with long or variable context windows.
Results:
Longdust is a new algorithm that efficiently identifies long LC sequences including centromeric satellite and tandem repeats with moderately long motifs. It defines string complexity by statistically modeling the k-mer count distribution with the parameters: the k-mer length, the context window size and a threshold on complexity. Longdust exhibits high performance on real data and high consistency with existing methods.
Availability And Implementation:
https://github.com/lh3/longdust.
Related Concept Videos
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...
The Nucleosome
DNA is wound twice around a protein complex called histone core, that consist of 8 histone proteins. This complex...
Sanger Sequencing
DNA Isolation
DNA Isolation
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved...

