Solution of a 20-Variable 3-SAT Problem on a DNA Computer

Solution of a 20-Variable 3-SAT Problem on a DNA Computer

A 20-variable instance of the NP-complete three-satisfiability (3-SAT) problem was solved on a simple DNA computer. The unique answer was found after an exhaustive search of more than 1 million (220) possibilities. This computational problem may be the largest yet solved by nonelectronic means. Prob...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Science (American Association for the Advancement of Science) 2002-04, Vol.296 (5567), p.499-502
Hauptverfasser: Braich, Ravinderjit S., Chelyapov, Nickolas, Johnson, Cliff, Paul W. K. Rothemund, Adleman, Leonard
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Artificial intelligence
Base Pairing
Base Sequence
Computer science
control theory
systems
Computers
Computing Methodologies
Deoxyribonucleic acid
Discrete mathematics
DNA
DNA, Single-Stranded
Electronic Equipment
Electrophoresis
Electrophoresis, Polyacrylamide Gel
Exact sciences and technology
Gels
Gene Library
Libraries
Mathematical sequences
Miscellaneous
Molecular biology
Molecular computing
Molecular weight
Molecules
Nucleic Acid Hybridization
Oligonucleotide Probes
Organic Chemistry
Polymerase Chain Reaction
Synthesizers
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A 20-variable instance of the NP-complete three-satisfiability (3-SAT) problem was solved on a simple DNA computer. The unique answer was found after an exhaustive search of more than 1 million (220) possibilities. This computational problem may be the largest yet solved by nonelectronic means. Problems of this size appear to be beyond the normal range of unaided human computation.
ISSN:0036-8075
1095-9203
DOI:10.1126/science.1069528