🔬

dna-computing-playground

Build DNA computers that solve problems with molecules! Learn how DNA stores data, performs computations, and solves complex mathematical problems. No biology experience needed - start computing with molecules in 3 minutes.

🔬 Try it now

What is this?

🎯 Simulator Tips

📚 Glossary

DNA (Deoxyribonucleic Acid)
The molecule that carries genetic instructions for life, composed of two strands of nucleotides (A, T, C, G) wound in a double helix.
Nucleotide Base
The chemical building blocks of DNA: Adenine (A), Thymine (T), Cytosine (C), and Guanine (G). A pairs with T, C pairs with G.
Hybridization
The process where two complementary single-stranded DNA molecules bind together to form a double helix, the fundamental operation in DNA computing.
Strand Displacement
A reaction where an incoming DNA strand displaces an existing strand from a double helix, enabling logic operations.
Toehold
A short single-stranded DNA overhang that initiates strand displacement, acting as a molecular 'switch' or 'trigger'.
Hamiltonian Path
A path through a graph that visits every vertex exactly once; the first problem solved by DNA computing (Adleman, 1994).
PCR (Polymerase Chain Reaction)
A technique to amplify (make billions of copies of) specific DNA sequences, used for reading out DNA computation results.
Gel Electrophoresis
A laboratory technique that separates DNA molecules by size, used to verify DNA computation outputs.
DNA Origami
A technique for folding long DNA strands into precise 2D and 3D nanostructures using short complementary staple strands.
Boolean Logic
A system of logic using TRUE/FALSE (1/0) values and operations (AND, OR, NOT) that forms the basis of digital computing.
GC Content
The percentage of guanine and cytosine bases in a DNA sequence; affects stability (higher GC = stronger binding).
Oligonucleotide
A short synthetic DNA or RNA molecule, typically 15-60 bases long, used as building blocks in DNA computing.
Massive Parallelism
The ability to perform trillions of operations simultaneously in a single test tube, the key advantage of DNA computing.
Biocomputation
Using biological molecules and processes (DNA, RNA, proteins, cells) to perform computational tasks.
Molecular Programming
Designing and engineering the behavior of molecular systems to perform complex tasks, including computation.
Encoding Scheme
The method used to convert digital data (binary) into DNA sequences (quaternary), such as mapping 00=A, 01=T, 10=C, 11=G.

🏆 Key Figures

Leonard Adleman (1994)

Founder of DNA computing who solved the Hamiltonian path problem using DNA molecules in a test tube, publishing the landmark 1994 Science paper

Erik Winfree (1998-present)

Caltech professor who developed DNA tile self-assembly theory and demonstrated that DNA strand displacement circuits can implement arbitrary digital logic

Paul Rothemund (2006)

Invented DNA origami at Caltech, enabling the folding of DNA into arbitrary 2D and 3D nanostructures with nanometer precision

George Church (2012)

Harvard geneticist who pioneered DNA data storage, encoding an entire book in DNA and demonstrating DNA as a practical archival medium

Lulu Qian (2018)

Caltech researcher who created DNA neural networks capable of pattern recognition using strand displacement reactions, computing like a brain using molecules

Ehud Shapiro (2001-2004)

Weizmann Institute scientist who built the first programmable molecular computing machine using DNA and enzymes that could diagnose disease markers

💬 Message to Learners

{'encouragement': 'You are exploring a completely different way of computing - one where molecules, not microchips, process information. DNA computing shows us that computation is a fundamental property of nature, not just something humans invented with silicon.', 'reminder': 'Leonard Adleman solved a math problem with molecules in a test tube in 1994, and many thought it was just a curiosity. Today, Microsoft is building commercial DNA storage systems and molecular circuits can recognize cancer cells. Never underestimate the power of a new idea.', 'action': 'Start encoding! Type text and watch it transform into DNA sequences. Try the complement operation to see Watson-Crick base pairing in action. Every DNA computing pioneer started by understanding these basics.', 'dream': 'Perhaps a student in Mumbai will design DNA logic circuits that detect diseases before symptoms appear. Perhaps a young coder in Addis Ababa will create molecular algorithms that solve problems no silicon computer ever could. The molecular computing revolution belongs to everyone.', 'wiaVision': 'WIA Book believes that the future of computing belongs to all of humanity, not just those with access to expensive hardware. DNA computing proves that the most powerful computer in the universe might just be a molecule. From Seoul to Sao Paulo - this is free forever, in the spirit of Hongik-ingan.'}

Get Started

Free, no signup required

Get Started →