What question did this study set out to answer?

To resolve computational bottlenecks in comparing large, multi-billion-base DNA sequences caused by nonuniform nucleotide composition.

January 5, 2011Genome ResearchOpen Access

Adaptive seeds tame genomic sequence comparison

View Full Paper

Ask AI

Bookmark

Authors

Computational study demonstrates linear-time alignment via adaptive seeds in large genomic datasets, indicating scalable analysis of nonuniform DNA.

To resolve computational bottlenecks in comparing large, multi-billion-base DNA sequences caused by nonuniform nucleotide composition.
Modified the standard seed-and-extend alignment framework to select variable-length matching seeds based on their rareness rather than fixed lengths.
Implemented the adaptive seed algorithm into an open-source sequence alignment tool named LAST.
Demonstrated that adaptive seeds constrain the number of candidate matches and runtime to scale linearly rather than quadratically with sequence length.
Achieved fast and sensitive comparison across large genomic datasets characterized by arbitrarily nonuniform oligonucleotide compositions.

Kiełbasa et al. (2011) studied this question.

View Full Paper

Ask AI

Bookmark

Computational study demonstrates linear-time alignment via adaptive seeds in large genomic datasets, indicating scalable analysis of nonuniform DNA.