DNA computing

E735011

computing paradigm molecular computing unconventional computing

DNA computing is a branch of computing that uses biological molecules, particularly DNA, to perform information processing and solve complex computational and combinatorial problems in parallel.

Try in SPARQL Jump to: Surface forms Disambiguation Statements Elicitation Referenced by

All labels observed (1)

Label	Occurrences
DNA computing canonical	2

How this entity was disambiguated

This entity first appeared as the object of triple T8449054 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: DNA computing
Context triple: [Molecular computation of solutions to combinatorial problems, field, DNA computing]

A. “Molecular computation of solutions to combinatorial problems”
“Molecular computation of solutions to combinatorial problems” is Leonard Adleman’s pioneering 1994 paper that introduced DNA computing by demonstrating how molecular biology techniques can solve a combinatorial search problem.
B. Biological and Artificial Computation
Biological and Artificial Computation is a scholarly work by Terrence Sejnowski that explores how principles of biological neural systems can inform and inspire computational and artificial intelligence models.
C. DNA Tower
DNA Tower is a distinctive spiral lookout tower and popular landmark in Kings Park, Perth, offering panoramic views of the surrounding city and Swan River.
D. The Science of Computing
"The Science of Computing" is a foundational work by Peter J. Denning that explores the principles, theory, and practice underlying computer science as a scientific discipline.
E. Information and Computation
Information and Computation is a peer-reviewed scientific journal focusing on theoretical computer science, including areas such as algorithms, computational complexity, and formal methods.
F. None of above. chosen
G. Unsure - the case is ambiguous/there is not enough information to decide.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: DNA computing
Target entity description: DNA computing is a branch of computing that uses biological molecules, particularly DNA, to perform information processing and solve complex computational and combinatorial problems in parallel.

A. “Molecular computation of solutions to combinatorial problems”
“Molecular computation of solutions to combinatorial problems” is Leonard Adleman’s pioneering 1994 paper that introduced DNA computing by demonstrating how molecular biology techniques can solve a combinatorial search problem.
B. Biological and Artificial Computation
Biological and Artificial Computation is a scholarly work by Terrence Sejnowski that explores how principles of biological neural systems can inform and inspire computational and artificial intelligence models.
C. DNA Tower
DNA Tower is a distinctive spiral lookout tower and popular landmark in Kings Park, Perth, offering panoramic views of the surrounding city and Swan River.
D. The Science of Computing
"The Science of Computing" is a foundational work by Peter J. Denning that explores the principles, theory, and practice underlying computer science as a scientific discipline.
E. Information and Computation
Information and Computation is a peer-reviewed scientific journal focusing on theoretical computer science, including areas such as algorithms, computational complexity, and formal methods.
F. None of above. chosen

Statements (51)

Predicate	Object
instanceOf	computing paradigm ⓘ molecular computing ⓘ unconventional computing ⓘ
appliedIn	bio-inspired algorithms ⓘ cryptography research ⓘ theoretical computer science ⓘ
basedOn	Watson–Crick base pairing NERFINISHED ⓘ biochemical reactions ⓘ molecular self-assembly ⓘ
canSolve	Hamiltonian path problem ⓘ NP-hard problems ⓘ combinatorial optimization problems ⓘ graph problems ⓘ satisfiability problems ⓘ
developedBy	Leonard Adleman NERFINISHED ⓘ
emergedIn	1990s ⓘ
enables	combinatorial search ⓘ computation at nanoscale ⓘ computation in solution ⓘ information processing ⓘ massive parallelism ⓘ
fieldOfStudy	biotechnology ⓘ computer science ⓘ nanotechnology ⓘ synthetic biology NERFINISHED ⓘ
hasAdvantage	high information density ⓘ intrinsic parallelism ⓘ low energy consumption per operation ⓘ
hasGoal	exploring alternative models of computation ⓘ solving complex computational problems ⓘ
hasLimitation	difficult scalability for general-purpose computing ⓘ error rates in biochemical reactions ⓘ labor-intensive laboratory procedures ⓘ slow input-output processes ⓘ
hasNotableWork	Adleman 1994 experiment on Hamiltonian path NERFINISHED ⓘ
relatedTo	DNA nanotechnology NERFINISHED ⓘ biocomputing ⓘ membrane computing ⓘ quantum computing ⓘ
typicalEnvironment	in vitro ⓘ
usesMaterial	DNA ⓘ biological molecules ⓘ nucleic acids ⓘ
usesOperation	enzymatic cleavage ⓘ gel electrophoresis ⓘ hybridization ⓘ ligation ⓘ polymerase chain reaction ⓘ
usesRepresentation	encoding data in DNA sequences ⓘ representing logical variables as DNA strands ⓘ representing solutions as molecular populations ⓘ

How these facts were elicited

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

“Molecular computation of solutions to combinatorial problems” → field → DNA computing ⓘ

subject surface form: Molecular computation of solutions to combinatorial problems

“Molecular computation of solutions to combinatorial problems” → introducedConcept → DNA computing ⓘ