Inferensys

Glossary

DADA2

A software pipeline that models and corrects Illumina-sequenced amplicon errors to infer exact sample sequences at single-nucleotide resolution, producing Amplicon Sequence Variants (ASVs) as the fundamental unit of analysis.
Data scientist building training data pipeline on laptop, data preprocessing visible, technical workspace.
AMPLICON SEQUENCE VARIANT INFERENCE

What is DADA2?

DADA2 is a software pipeline that models and corrects Illumina-sequenced amplicon errors to infer exact sample sequences at single-nucleotide resolution, producing Amplicon Sequence Variants (ASVs) as the fundamental unit of analysis.

DADA2 (Divisive Amplicon Denoising Algorithm 2) is an open-source R package that implements a parametric error model to distinguish true biological sequences from sequencing errors in high-throughput amplicon data. Unlike traditional operational taxonomic unit (OTU) clustering methods that impose arbitrary 97% similarity thresholds, DADA2 resolves amplicon reads to single-nucleotide resolution, producing exact Amplicon Sequence Variants (ASVs). The algorithm models the error rate for each Illumina sequencing run by learning the consensus quality scores and nucleotide transition probabilities from the data itself, then uses a divisive partitioning approach to identify and remove erroneous sequences while preserving true biological variation.

The core innovation of DADA2 lies in its self-consistent error model, which estimates the frequency of each possible nucleotide substitution as a function of the associated quality score. After filtering and trimming reads, the algorithm performs sample-by-sample inference through repeated rounds of abundance-based partitioning, alternating between estimating error rates and inferring sample composition until convergence. This denoising process is followed by paired-end read merging and chimera removal using a consensus method. The output is a high-resolution ASV table—a matrix of exact sequence variants and their counts across samples—that serves as the foundation for downstream taxonomic classification and ecological analysis in platforms like QIIME 2.

AMPLICON SEQUENCE VARIANT INFERENCE

Key Features of DADA2

DADA2 transforms raw amplicon sequencing data into exact biological sequences through a rigorously modeled error-correction pipeline, replacing heuristic clustering with single-nucleotide resolution.

01

Amplicon Sequence Variants (ASVs)

DADA2 infers exact biological sequences at single-nucleotide resolution, producing Amplicon Sequence Variants as the fundamental unit of analysis. Unlike Operational Taxonomic Units (OTUs) that cluster sequences at an arbitrary 97% similarity threshold, ASVs resolve fine-grained biological variation. This enables:

  • Distinguishing strain-level differences that OTU clustering obscures
  • Reproducible labels across studies without reference to a clustering database
  • Direct comparison of sequence variants across independent experiments
1 nt
Resolution
02

Parametric Error Model

DADA2 constructs a data-driven error model from each sequencing run by alternating between sample inference and error rate estimation until convergence. The algorithm:

  • Estimates substitution probabilities for each transition type (A→G, C→T, etc.) as a function of quality score
  • Models Illumina-specific error profiles without relying on static, pre-computed error tables
  • Adapts to run-to-run variability in sequencing chemistry and instrument performance
  • Achieves error rates below 1 in 10,000 bases after correction
< 0.01%
Residual Error Rate
03

Divisive Partitioning Algorithm

The core algorithm partitions dereplicated unique sequences into partitions consistent with the parametric error model. For each sequence abundance group:

  • A p-value is computed testing the null hypothesis that a less-abundant sequence is an error of a more-abundant sequence
  • Sequences are recursively partitioned until all partitions are internally consistent
  • The most abundant sequence in each partition becomes the centroid ASV
  • This approach avoids the greedy centroid selection bias present in heuristic denoisers like UNOISE
04

Paired-End Read Merging

DADA2 performs model-based merging of overlapping paired-end reads, requiring a minimum overlap (default 12 bases) and exact concordance in the overlap region. The merger:

  • Computes a consensus quality score for each position using the joint probability of agreement
  • Rejects reads with mismatches in the overlap to eliminate residual errors
  • Produces full-length denoised sequences spanning the entire amplicon
  • Handles variable-length amplicons without requiring uniform read lengths
05

Chimera Removal

DADA2 identifies and removes PCR chimeras—artifactual sequences formed when incomplete extension products act as primers on heterologous templates. The method:

  • Implements a de novo detection algorithm that identifies sequences explainable as combinations of two more-abundant parent sequences
  • Uses a needleman-wunsch alignment to score potential parent-left and parent-right fragments
  • Operates on a per-sample basis rather than pooling, preserving rare variants that might be flagged as chimeric in aggregate
  • Removes bimeras—chimeras formed between two sample sequences—without requiring a reference database
06

Quality Score-Aware Filtering

DADA2's filtering step uses quality score profiles to truncate reads at the first position where quality drops below a threshold, rather than applying a uniform truncation length. The approach:

  • Truncates forward and reverse reads independently based on their distinct error profiles
  • Removes reads with ambiguous bases (Ns) or exceeding the maximum expected errors threshold
  • Preserves maximum read length while eliminating low-quality tails
  • Outputs a filtered quality profile for visual inspection of the truncation decision
METHODOLOGICAL COMPARISON

DADA2 vs. OTU Clustering Methods

Comparison of DADA2's denoising approach against traditional operational taxonomic unit (OTU) clustering methods for amplicon sequence analysis.

FeatureDADA2 (ASVs)De Novo OTU (97%)Closed-Reference OTU

Fundamental unit

Amplicon Sequence Variant (ASV)

Operational Taxonomic Unit (OTU)

Operational Taxonomic Unit (OTU)

Resolution

Single-nucleotide

97% similarity clusters

Reference-dependent clusters

Error model

Parametric error model from quality scores

Reproducibility across studies

Comparability across datasets

Detection of rare variants

Chimera removal integrated

Reference database required

Typical sparsity reduction

0.1-0.5%

3%

Variable

Computational memory footprint

Moderate

Low

Low

DADA2 CLARIFIED

Frequently Asked Questions

Direct answers to the most common technical questions about the DADA2 algorithm, its error model, and its role in generating Amplicon Sequence Variants (ASVs).

DADA2 (Divisive Amplicon Denoising Algorithm 2) is an open-source R software package that models and corrects errors in Illumina-sequenced amplicon reads to infer the exact biological sequences present in a sample at single-nucleotide resolution. Unlike traditional OTU clustering methods that group sequences based on an arbitrary similarity threshold (e.g., 97%), DADA2 implements a statistical model of the sequencing error process. It iteratively partitions sequence reads, estimates error rates for each transition (e.g., A→G), and determines which sequences are likely real biological variants versus artifacts of PCR or sequencing. The output is a table of Amplicon Sequence Variants (ASVs) , which represent 100% identical, error-corrected sequences. The core algorithm uses a divisive partitioning approach combined with a parametric error model to distinguish true sequence variants from errors, often resolving differences as small as a single nucleotide.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.