Bioinformatics: Sequence Alignment DP-Matrix Explorer

Sequences

Seq 1: –

Seq 2: –

Controls

Sequence length 10

Mutation rate 0.25

Mismatch penalty -1.0

Gap penalty -1.0

Alignment score

–

Identity

–

Path length

–

Grid cells

–

How it works

Global sequence alignment finds the best way to line up two DNA strings, allowing substitutions and gaps, using the Needleman-Wunsch dynamic-programming algorithm. Every cell (i, j) of the score matrix holds the best possible score for aligning the first i bases of sequence 1 with the first j bases of sequence 2. Filling the whole matrix bottom-up and then tracing back from the last cell to the first recovers the optimal alignment — that grid is exactly the 3D landscape rendered here, with height showing each cell's score and the bright green ridge marking the traceback path actually chosen.

F(i,j) = max( F(i-1,j-1) + s(xᵢ,yⱼ),
              F(i-1,j)   + gap,
              F(i,j-1)   + gap )
s(xᵢ,yⱼ) = +1 if xᵢ = yⱼ, else mismatch penalty

Sequence length — how many bases in sequence 1; the DP grid grows to (n+1)×(m+1) cells.
Mutation rate — how heavily sequence 2 is derived from sequence 1 via random substitutions and insertions/deletions, so higher rates force more of the path off the diagonal.
Mismatch penalty — cost charged when aligned bases differ; harsher penalties push the optimal path toward gaps instead of mismatches.
Gap penalty — cost of skipping a base in either sequence (an insertion/deletion); harsher penalties push the path back toward mismatches instead.

Real-world relevance: this exact recurrence (or its local-alignment cousin, Smith-Waterman) underlies every read aligner, multiple-sequence-alignment tool and BLAST-style search used across genomics, protein structure prediction and phylogenetics.

DP cell (height = score) Optimal traceback path

⚠ Couldn't load the 3D engineThree.js failed to load from the CDN. Check your connection and reload.