Abstract
In recent years, several strategies for DNA based molecular computing have been investigated. An important area of research is the detection and analysis of output molecules. We demonstrate how DNA computing can be extended with in vivo translation of the output. In the resulting proteins, the information per kilogram is about 15-fold higher than in the original DNA output. The proteins are therefore of correspondingly smaller mass, which facilitates their subsequent detection using highly sensitive mass spectrometry methods. We have tested this approach on an instance of the Minimal Dominating Set problem. The DNA used in the computation was constructed as an open reading frame in a plasmid, under the control of a strong inducible promoter. Sequential application of restriction endonucleases yielded a library of potential solutions to the problem instance. The mixture of plasmids was then used for expression of a protein representation. Using MALDI-TOF mass spectrometry, a protein corresponding to the correct solution could be detected. The results indicate the feasibility of the extension of DNA computing to include protein technology. Our strategy opens up new possibilities for both scaling of DNA computations and implementations that employ output of functional molecules or phenotypes.
Similar content being viewed by others
References
LM Adleman (1994) ArticleTitleMolecular computation of solutions to combinatorial problems Science 266 1021–1024 Occurrence Handle1:CAS:528:DyaK2MXitFSjs7k%3D Occurrence Handle7973651
T Bäck JN Kok G Rozenberg (2003) Evolutionary computation as a paradigm for DNA-based computing LF Landweber E Winfree (Eds) Evolution as Computation (DIMACS Workshop, Princeton, January 1999) Springer-Verlag Heidelberg 15–40
Y Benenson T Paz-Elizur R Adar E Keinan Z Livneh E Shapiro (2001) ArticleTitleProgrammable and autonomous computing machine made of biomolecules Nature 414 430–434
PS Blank CM Sjomeling PS Backlund AL Yergey (2002) ArticleTitleUse of cumulative distribution functions to characterize mass spectra of intact proteins Journal of the American Society for Mass Spectrometry 13 40–46
RS Braich N Chelyapov C Johnson PWK Rothemund LM Adleman (2002) ArticleTitleSolution of a 20-variable 3-SAT problem on a DNA computer Science 296 499–502
MJ Chalmers SJ Gaskell (2000) ArticleTitleAdvances in mass spectrometry for proteome analysis Current Opinion in Biotechnology 11 384–390
J Chen DH Wood (2000) ArticleTitleComputation with biomolecules Proceedings of the National Academy of Sciences of the United States of America 97 1328–1330
JPL Cox (2001) ArticleTitleLong-term data storage in DNA Trends in Biotechnology 19 247–250
D Faulhammer AR Cukras RJ Lipton LF Landweber (2000) ArticleTitleMolecular computation: RNA solutions to chess problems Proceedings of the National Academy of Sciences of the United States of America 97 1385–1389
MR Garey DS Johnson (1979) Computers and Intractability. A Guide to the Theory of NP-completeness Freeman New York
M Hagiya A Ohuchi (2003) DNA Computing. 8th International Workshop on DNA Based Computers Springer-Verlag Heidelberg
T Head G Rozenberg RS Bladergroen CKD Breek PHM Lommerse HP Spaink (2000) ArticleTitleComputing with DNA by operating on plasmids Biosystems 57 87–93
T Head X Chen MJ Nichols M Yamamura S Gal (2002) Aqueous solutions of algorithmic problems: emphasizing knights on a 3 × 3 N Jonoska NC Seeman (Eds) DNA Computing, 7th International Meeting on DNA Based Computers Springer-Verlag Heidelberg 191–202
N Jonoska NC Seeman (2002) DNA Computing. 7th International Meeting on DNA Based Computers Springer-Verlag Heidelberg
QH Liu L Wang AG Frutos AE Condon RM Corn LM Smith (2000) ArticleTitleDNA computing on surfaces Nature 403 175–179 Occurrence Handle10.1038/35001232 Occurrence Handle1:CAS:528:DC%2BD3cXms1aiuw%3D%3D Occurrence Handle10646598
CD Mao TH LaBean JH Reif NC Seeman (2000) ArticleTitleLogical computation using algorithmic self-assembly of DNA triple-crossover molecules Nature 407 493–496
D Normile (2002) ArticleTitleMolecular computing: DNA-based computer takes aim at genes Science 295 951
Q Ouyang PD Kaplan S Liu A Libchaber (1997) ArticleTitleDNA solution of the maximal clique problem Science 278 446–449
G Paun G Rozenberg A Salomaa (1998) DNA Computing. New Computing Paradigms Springer-Verlag Heidelberg
Y Sakakibara T Hohsaka (2003) In vitro translation-based computations J Chen J Reif (Eds) Preliminary Proceedings, 9th International meeting on DNA Based Computers University of Wisconsin Madison, Wisconsin, USA 175–179
K Sakamoto H Gouzu K Komiya D Kiga S Yokoyama T Yokomori M Hagiya (2000) ArticleTitleMolecular computation by DNA hairpin formation Science 288 1223–1226
J Sambrook DW Russell (2001) Molecular Cloning: a Laboratory Manual EditionNumber3 Cold Spring Harbor Laboratory Press Cold Spring Harbor, New York
H Schagger Jagow G Von (1987) ArticleTitleTricine-sodium dodecyl sulfate-polyacrylamide gl electrophoresis for the separation of proteins in the range from 1 to 100 kDa Analytical Biochemistry 166 368–379
C Staehelin C Charon T Boller M Crespi A Kondorosi (2001) ArticleTitleMedicago truncatula plants overexpressing the early nodulin gene enod40 exhibit accelerated mycorrhizal colonization and enhanced formation of arbuscules Proceedings of the National Academy of Sciences of the United States of America 98 15366–15371
J Vieira J Messing (1991) ArticleTitleNew pUC-derived cloning vectors with different selectable markers and DNA replication origins Gene 100 189–194
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Henkel, C.V., Bladergroen, R.S., Balog, C.I.A. et al. Protein output for DNA computing. Nat Comput 4, 1–10 (2005). https://doi.org/10.1007/s11047-004-5199-x
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11047-004-5199-x