Molecular Computing
Computing with DNA and proteins.
## The Adleman Experiment
Adleman's breakthrough showed that a test tube full of DNA could solve a math problem that would take a standard computer much longer. By representing cities as DNA sequences and paths as complementary strands, the 'answer' becomes the dominant molecule in the solution after several cycles of synthesis and filtration.
graph LR
Center["Molecular Computing"]:::main
Pre_algorithms["algorithms"]:::pre --> Center
click Pre_algorithms "/terms/algorithms"
Rel_synthetic_biology["synthetic-biology"]:::related -.-> Center
click Rel_synthetic_biology "/terms/synthetic-biology"
Rel_nanotechnology["nanotechnology"]:::related -.-> Center
click Rel_nanotechnology "/terms/nanotechnology"
Rel_synthetic_biology_computing["synthetic-biology-computing"]:::related -.-> Center
click Rel_synthetic_biology_computing "/terms/synthetic-biology-computing"
classDef main fill:#7c3aed,stroke:#8b5cf6,stroke-width:2px,color:white,font-weight:bold,rx:5,ry:5;
classDef pre fill:#0f172a,stroke:#3b82f6,color:#94a3b8,rx:5,ry:5;
classDef child fill:#0f172a,stroke:#10b981,color:#94a3b8,rx:5,ry:5;
classDef related fill:#0f172a,stroke:#8b5cf6,stroke-dasharray: 5 5,color:#94a3b8,rx:5,ry:5;
linkStyle default stroke:#4b5563,stroke-width:2px;
🧒 Explain Like I'm 5
🧬 It's like using DNA as the 'letters' of a computer code to solve puzzles.
🤓 Expert Deep Dive
## The Adleman Experiment
Adleman's breakthrough showed that a test tube full of DNA could solve a math problem that would take a standard computer much longer. By representing cities as DNA sequences and paths as complementary strands, the 'answer' becomes the dominant molecule in the solution after several cycles of synthesis and filtration.