DNA computer (Adleman 1994)
Realizes: Hamiltonian path via strand hybridization
Leonard Adleman's 1994 demonstration solved the directed Hamiltonian path problem using DNA strand hybridization. Cities encoded as DNA sequences, flight connections as complementary strands. Massively parallel biochemical search. Speed: hours to days (biochemical reactions). Capacity: combinatorial search problems (limited by DNA synthesis/sequencing).
Examples
🔗
Adleman's Original 1994 DNA Computer Experiment
Leonard Adleman's groundbreaking experiment solving a 7-city Hamiltonian path problem using DNA strand hybridization, published in Science magazine and launching the field of DNA computing
SEARCH
SELECT
days
small
aJ
🔗
Molecular computation of solutions to combinatorial problems
The original 1994 Science paper (L. M. Adleman, Science 266, 1021–1024) describing the first DNA-based computer solving the Hamiltonian path problem
SEARCH
SELECT
days
small
aJ