Document Open Access Logo

Molecular Machines from Topological Linkages

Authors Keenan Breik, Austin Luchsinger, David Soloveichik

PDF
Thumbnail PDF

File

LIPIcs.DNA.27.7.pdf
  • Filesize: 1 MB
  • 20 pages

Document Identifiers

Author Details

Keenan Breik
  • The University of Texas at Austin, TX, USA
Austin Luchsinger
  • The University of Texas at Austin, TX, USA
David Soloveichik
  • The University of Texas at Austin, TX, USA

Funding

This work was supported by NSF grant CCF-1901025.

Acknowledgements

We thank Tosan Omabegho for introducing us to chemical linkages and for extensive discussions.

Cite As Get BibTex

Keenan Breik, Austin Luchsinger, and David Soloveichik. Molecular Machines from Topological Linkages. In 27th International Conference on DNA Computing and Molecular Programming (DNA 27). Leibniz International Proceedings in Informatics (LIPIcs), Volume 205, pp. 7:1-7:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021) https://doi.org/10.4230/LIPIcs.DNA.27.7

Abstract

Life is built upon amazingly sophisticated molecular machines whose behavior combines mechanical and chemical action. Engineering of similarly complex nanoscale devices from first principles remains an as yet unrealized goal of bioengineering. In this paper we formalize a simple model of mechanical motion (mechanical linkages) combined with chemical bonding. The model has a natural implementation using DNA with double-stranded rigid links, and single-stranded flexible joints and binding sites. Surprisingly, we show that much of the complex behavior is preserved in an idealized topological model which considers solely the graph connectivity of the linkages. We show a number of artifacts including Boolean logic, catalysts, a fueled motor, and chemo-mechanical coupling, all of which can be understood and reasoned about in the topological model. The variety of achieved behaviors supports the use of topological chemical linkages in understanding and engineering complex molecular behaviors.

Subject Classification

ACM Subject Classification
  • Theory of computation → Models of computation
  • Theory of computation → Computational geometry
Keywords
  • chemical computation
  • mechanical computation
  • bioengineering
  • models of biochemistry
  • molecular machines
  • mechanical linkages
  • generic rigidity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. R. Dean Astumian, Shayantani Mukherjee, and Arieh Warshel. The physics and physical chemistry of molecular machines. ChemPhysChem, 17(12):1719-1741, 2016. Google Scholar
  2. E. Branscomb, T. Biancalani, N. Goldenfeld, and M. Russell. Escapement mechanisms and the conversion of disequilibria; the engines of creation. Physics Reports, 677:1-60, 2017. Google Scholar
  3. Aidan I. Brown and David A. Sivak. Theory of nonequilibrium free energy transduction by molecular machines. Chemical Reviews, 120(1):434-459, January 2020. Google Scholar
  4. Erik D. Demaine and Joseph O'Rourke. Geometric folding algorithms: linkages, origami, polyhedra. Cambridge university press, 2007. Google Scholar
  5. Lebrecht Henneberg. Die graphische Statik der starren Systeme, volume 31. BG Teubner, 1911. Google Scholar
  6. John Hopcroft, Deborah Joseph, and Sue Whitesides. Movement problems for 2-dimensional linkages. SIAM journal on computing, 13(3):610-629, 1984. Google Scholar
  7. Donald J. Jacobs and Michael F. Thorpe. Generic rigidity percolation: the pebble game. Physical review letters, 75(22):4051, 1995. Google Scholar
  8. Michael Kapovich and John J. Millson. Universality theorems for configuration spaces of planar linkages. Topology, 41(6):1051-1107, 2002. Google Scholar
  9. Alfred B. Kempe. On a general method of describing plane curves of the nth degree by linkwork. Proceedings of the London Mathematical Society, pages 213-216, 1875. Google Scholar
  10. Gerard Laman. On graphs and rigidity of plane skeletal structures. Journal of Engineering mathematics, 4(4):331-340, 1970. Google Scholar
  11. Steven M. LaValle. Planning algorithms. Cambridge university press, 2006. Google Scholar
  12. Tosan Omabegho. Allosteric linkages that emulate a molecular motor enzyme. bioRxiv, 2021. URL: https://www.biorxiv.org/content/10.1101/2021.04.20.440673v1.
  13. John H. Reif. Complexity of the mover’s problem and generalizations. In 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pages 421-427, 1979. Google Scholar
  14. Jason W. Rocks, Nidhi Pashine, Irmgard Bischofberger, Carl P. Goodrich, Andrea J. Liu, and Sidney R. Nagel. Designing allostery-inspired response in mechanical networks. Proceedings of the National Academy of Sciences, 114(10):2520-2525, 2017. Google Scholar
  15. Georg Seelig, David Soloveichik, David Yu Zhang, and Erik Winfree. Enzyme-free nucleic acid logic circuits. Science, 314(5805):1585-1588, 2006. Google Scholar
  16. Tiong-Seng Tay and Walter Whiteley. Generating isostatic frameworks. Structural Topology 1985 Núm 11, 1985. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact