lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Parallel computation with molecular-motor-propelled agents in nanofabricated networks
University of California, USA ; Molecular Sense, Ltd., UK.
Lund University.
Technische Universität Dresden, Germany ; Max Planck Institute of Molecular Cell Biology and Genetics, Germany.
Philips Research MiPlaza, The Netherlands ; Philips Innovation Services, The Netherlands.
Show others and affiliations
2016 (English)In: Proceedings of the National Academy of Sciences of the United States of America, ISSN 0027-8424, E-ISSN 1091-6490, Vol. 113, no 10, 2591-2596 p.Article in journal (Refereed) Published
Resource type
Text
Abstract [en]

The combinatorial nature of many important mathematical problems, including nondeterministic-polynomial-time (NP)-complete problems, places a severe limitation on the problem size that can be solved with conventional, sequentially operating electronic computers. There have been significant efforts in conceiving parallel-computation approaches in the past, for example: DNA computation, quantum computation, and microfluidics-based computation. However, these approaches have not proven, so far, to be scalable and practical from a fabrication and operational perspective. Here, we report the foundations of an alternative parallel-computation system in which a given combinatorial problem is encoded into a graphical, modular network that is embedded in a nanofabricated planar device. Exploring the network in a parallel fashion using a large number of independent, molecular-motor-propelled agents then solves the mathematical problem. This approach uses orders of magnitude less energy than conventional computers, thus addressing issues related to power consumption and heat dissipation. We provide a proof-of-concept demonstration of such a device by solving, in a parallel fashion, the small instance {2, 5, 9} of the subset sum problem, which is a benchmark NP-complete problem. Finally, we discuss the technical advances necessary to make our system scalable with presently available technology.

Place, publisher, year, edition, pages
2016. Vol. 113, no 10, 2591-2596 p.
Keyword [en]
parallel computing, molecular motors, NP complete, biocomputation, nanotechnology
National Category
Chemical Sciences
Research subject
Natural Science, Chemistry
Identifiers
URN: urn:nbn:se:lnu:diva-51981DOI: 10.1073/pnas.1510825113ISI: 000372013300025PubMedID: 26903637Scopus ID: 2-s2.0-84960532489OAI: oai:DiVA.org:lnu-51981DiVA: diva2:918035
Available from: 2016-04-08 Created: 2016-04-08 Last updated: 2017-02-16Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textPubMedScopus

Search in DiVA

By author/editor
Persson, MalinBengtsson, ElinaMånsson, Alf
By organisation
Department of Chemistry and Biomedical Sciences
In the same journal
Proceedings of the National Academy of Sciences of the United States of America
Chemical Sciences

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 444 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf