Type a DNA string. Its triplets light up on the array, become edges of the de Bruijn graph, and an Euler path through every edge spells the string back.
Nothing yet.
Type a DNA string, or load the example.
Triplets array (4 × 4 × 4)
| first two | ·A | ·C | ·G | ·T |
|---|---|---|---|---|
| AA· | ||||
| AC· | ||||
| AG· | ||||
| AT· | ||||
| CA· | ||||
| CC· | ||||
| CG· | ||||
| CT· | ||||
| GA· | ||||
| GC· | ||||
| GG· | ||||
| GT· | ||||
| TA· | ||||
| TC· | ||||
| TG· | ||||
| TT· |
Bordered cells are the triplets the array detects. Hover one to find its edge.
De Bruijn graph · 0 of 16 nodes in use · 0 edges
The walk will spell a sequence here.