Document Open Access Logo

Complexity of Verification in Self-Assembly with Prebuilt Assemblies

Authors David Caballero, Timothy Gomez, Robert Schweller, Tim Wylie

PDF

File

Thumbnail PDF
PDF
LIPIcs.SAND.2022.8.pdf
  • Filesize: 1.11 MB
  • 15 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Problems, reductions and completeness
  • Applied computing → Computational biology
Keywords
  • 2-handed assembly
  • verification
  • prebuilt

Metrics

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

Abstract

We analyze the complexity of two fundamental verification problems within a generalization of the two-handed tile self-assembly model (2HAM) where initial system assemblies are not restricted to be singleton tiles, but may be larger pre-built assemblies. Within this model we consider the producibility problem, which asks if a given tile system builds, or produces, a given assembly, and the unique assembly verification (UAV) problem, which asks if a given system uniquely produces a given assembly. We show that producibility is NP-complete and UAV is coNP^{NP}-complete even when the initial assembly size and temperature threshold are both bounded by a constant. This is in stark contrast to results in the standard model with singleton input tiles where producibility is in P and UAV is in coNP for 𝒪(1) bounded temperature and coNP-complete when temperature is part of the input. We further provide preliminary results for producibility and UAV in the case of 1-dimensional linear assemblies with pre-built assemblies, and provide polynomial time solutions.

Cite As Get BibTex

David Caballero, Timothy Gomez, Robert Schweller, and Tim Wylie. Complexity of Verification in Self-Assembly with Prebuilt Assemblies. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 221, pp. 8:1-8:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.SAND.2022.8

Author Details

David Caballero
  • Department of Computer Science, University of Texas Rio Grande Valley, TX, USA
Timothy Gomez
  • Department of Computer Science, University of Texas Rio Grande Valley, TX, USA
Robert Schweller
  • Department of Computer Science, University of Texas Rio Grande Valley, TX, USA
Tim Wylie
  • Department of Computer Science, University of Texas Rio Grande Valley, TX, USA

Funding

This research was supported in part by National Science Foundation Grant CCF-1817602.

References

  1. Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, and Paul W. K. Rothemund. Combinatorial optimization problems in self-assembly. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 23-32, 2002. Google Scholar
  2. David Caballero, Timothy Gomez, Robert Schweller, and Tim Wylie. Verification and Computation in Restricted Tile Automata. In Cody Geary and Matthew J. Patitz, editors, 26th International Conference on DNA Computing and Molecular Programming (DNA 26), volume 174 of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1-10:18, Dagstuhl, Germany, 2020. Schloss Dagstuhl-Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.DNA.2020.10.
  3. Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M Summers, and Andrew Winslow. Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), volume 20 of Leibniz International Proceedings in Informatics (LIPIcs), pages 172-184. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2013. Google Scholar
  4. Angel A Cantu, Austin Luchsinger, Robert Schweller, and Tim Wylie. Covert computation in self-assembled circuits. Algorithmica, 83(2):531-552, 2021. Google Scholar
  5. Erik D Demaine, Martin L Demaine, Sándor P Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T Schweller, and Diane L Souvaine. Staged self-assembly: nanomanufacture of arbitrary shapes with o (1) glues. Natural Computing, 7(3):347-370, 2008. Google Scholar
  6. David Doty. Theory of algorithmic self-assembly. Communications of the ACM, 55(12):78-88, 2012. Google Scholar
  7. David Doty. Producibility in hierarchical self-assembly. In Oscar H. Ibarra, Lila Kari, and Steffen Kopecki, editors, Unconventional Computation and Natural Computation, pages 142-154, Cham, 2014. Springer International Publishing. Google Scholar
  8. David Doty, Lila Kari, and Benoît Masson. Negative interactions in irreversible self-assembly. Algorithmica, 66(1):153-172, 2013. Google Scholar
  9. Masayuki Endo, Tsutomu Sugita, Yousuke Katsuda, Kumi Hidaka, and Hiroshi Sugiyama. Programmed-assembly system using DNA jigsaw pieces. Chemistry: A European Journal, pages 5362-5368, 2010. Google Scholar
  10. Constantine Evans. Crystals that Count! Physical Principles and Experimental Investigations of DNA Tile Self-Assembly. PhD thesis, California Inst. of Tech., 2014. Google Scholar
  11. Sándor P Fekete, Jacob Hendricks, Matthew J Patitz, Trent A Rogers, and Robert T Schweller. Universal computation with arbitrary polyomino tiles in non-cooperative self-assembly. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 148-167. SIAM, 2014. Google Scholar
  12. Bin Fu, Matthew J Patitz, Robert T Schweller, and Robert Sheline. Self-assembly with geometric tiles. In International Colloquium on Automata, Languages, and Programming, pages 714-725. Springer, 2012. Google Scholar
  13. Pierre-Étienne Meunier, Damien Regnault, and Damien Woods. The program-size complexity of self-assembled paths. In STOC: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, pages 727-737. Association for Computing Machinery, 2020. URL: https://doi.org/10.1145/3357713.3384263.
  14. Matthew J. Patitz. An introduction to tile-based self-assembly and a survey of recent results. Natural Computing, 13(2):195-224, June 2014. Google Scholar
  15. Robert Schweller, Andrew Winslow, and Tim Wylie. Complexities for high-temperature two-handed tile self-assembly. In Robert Brijder and Lulu Qian, editors, DNA Computing and Molecular Programming, pages 98-109, Cham, 2017. Springer International Publishing. Google Scholar
  16. Robert Schweller, Andrew Winslow, and Tim Wylie. Verification in staged tile self-assembly. Natural Computing, 18(1):107-117, 2019. Google Scholar
  17. Erik Winfree. Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, June 1998. Google Scholar
  18. Sungwook Woo and Paul W.K. Rothemund. Stacking bonds: Programming molecular recognition based on the geometry of DNA nanostructures. Nature Chemistry, 3:620-627, 2011. Google Scholar
  19. Damien Woods. Intrinsic universality and the computational power of self-assembly. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 373(2046):16-22, 2013. Google Scholar
  20. Damien Woods, David Doty, Cameron Myhrvold, Joy Hui, Felix Zhou, Peng Yin, and Erik Winfree. Diverse and robust molecular algorithms using reprogrammable DNA self-assembly. Nature, 567:366-372, March 2019. URL: https://doi.org/10.1038/s41586-019-1014-9.
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact