基于瓦片的自组装中维度、扩散和指向性对内在交叉模型模拟的影响

IF 0.9 4区 计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING Algorithmica Pub Date : 2024-04-03 DOI:10.1007/s00453-024-01219-2
Daniel Hader, Matthew J. Patitz
{"title":"基于瓦片的自组装中维度、扩散和指向性对内在交叉模型模拟的影响","authors":"Daniel Hader,&nbsp;Matthew J. Patitz","doi":"10.1007/s00453-024-01219-2","DOIUrl":null,"url":null,"abstract":"<div><p>Motivated by applications in DNA-nanotechnology, theoretical investigations in algorithmic tile-assembly have blossomed into a mature theory. In addition to computational universality, the abstract Tile Assembly Model (aTAM) was shown to be intrinsically universal (FOCS 2012), a strong notion of completeness where a single tile set is capable of simulating the full dynamics of all systems within the model; however, this construction fundamentally required non-deterministic tile attachments. This was confirmed necessary when it was shown that the class of directed aTAM systems, those where all possible sequences of tile attachments result in the same terminal assembly, is not intrinsically universal (FOCS 2016). Furthermore, it was shown that the non-cooperative aTAM, where tiles only need to match on 1 side to bind rather than 2 or more, is not intrinsically universal (SODA 2014) nor computationally universal (STOC 2017). Building on these results to further investigate the other dynamics, Hader et al. examined several tile-assembly models which varied across (1) the numbers of dimensions used, (2) how tiles diffused through space, and (3) whether each system is directed, and determined which models exhibited intrinsic universality (SODA 2020). In this paper we extend those results to provide direct comparisons of the various models against each other by considering intrinsic simulations between models. Our results show that in some cases, one model is strictly more powerful than another, and in others, pairs of models have mutually exclusive capabilities. This paper is a greatly expanded version of that which appeared in ICALP 2023.</p></div>","PeriodicalId":50824,"journal":{"name":"Algorithmica","volume":"86 7","pages":"2211 - 2249"},"PeriodicalIF":0.9000,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00453-024-01219-2.pdf","citationCount":"0","resultStr":"{\"title\":\"The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly\",\"authors\":\"Daniel Hader,&nbsp;Matthew J. Patitz\",\"doi\":\"10.1007/s00453-024-01219-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Motivated by applications in DNA-nanotechnology, theoretical investigations in algorithmic tile-assembly have blossomed into a mature theory. In addition to computational universality, the abstract Tile Assembly Model (aTAM) was shown to be intrinsically universal (FOCS 2012), a strong notion of completeness where a single tile set is capable of simulating the full dynamics of all systems within the model; however, this construction fundamentally required non-deterministic tile attachments. This was confirmed necessary when it was shown that the class of directed aTAM systems, those where all possible sequences of tile attachments result in the same terminal assembly, is not intrinsically universal (FOCS 2016). Furthermore, it was shown that the non-cooperative aTAM, where tiles only need to match on 1 side to bind rather than 2 or more, is not intrinsically universal (SODA 2014) nor computationally universal (STOC 2017). Building on these results to further investigate the other dynamics, Hader et al. examined several tile-assembly models which varied across (1) the numbers of dimensions used, (2) how tiles diffused through space, and (3) whether each system is directed, and determined which models exhibited intrinsic universality (SODA 2020). In this paper we extend those results to provide direct comparisons of the various models against each other by considering intrinsic simulations between models. Our results show that in some cases, one model is strictly more powerful than another, and in others, pairs of models have mutually exclusive capabilities. This paper is a greatly expanded version of that which appeared in ICALP 2023.</p></div>\",\"PeriodicalId\":50824,\"journal\":{\"name\":\"Algorithmica\",\"volume\":\"86 7\",\"pages\":\"2211 - 2249\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00453-024-01219-2.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Algorithmica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00453-024-01219-2\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algorithmica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00453-024-01219-2","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

在 DNA 纳米技术应用的推动下,瓦片组装算法的理论研究已发展成为一种成熟的理论。除了计算普适性,抽象瓦片组装模型(aTAM)还被证明具有内在普适性(FOCS 2012),这是一个很强的完备性概念,即单个瓦片集能够模拟模型内所有系统的全部动力学;然而,这种构造从根本上要求非确定性瓦片附件。研究表明,有向 aTAM 系统(所有可能的瓦片连接序列都会导致相同的终端组装)并不具有内在的普遍性(FOCS,2016 年)。此外,研究还表明,非合作性 aTAM(瓦片只需在 1 面上匹配即可结合,而不是 2 面或更多面)既不具有内在普遍性(SODA,2014 年),也不具有计算普遍性(STOC,2017 年)。在这些结果的基础上,为了进一步研究其他动力学,Hader 等人研究了几种瓦片组装模型,这些模型在以下方面各不相同:(1)使用的维数;(2)瓦片在空间中的扩散方式;(3)每个系统是否有指向性,并确定了哪些模型表现出内在普遍性(SODA 2020)。在本文中,我们扩展了这些结果,通过考虑模型之间的内在模拟,提供了各种模型之间的直接比较。我们的结果表明,在某些情况下,一种模型严格来说比另一种模型更强大,而在另一些情况下,成对的模型具有相互排斥的能力。本文是在 ICALP 2023 上发表的论文的扩充版。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The Impacts of Dimensionality, Diffusion, and Directedness on Intrinsic Cross-Model Simulation in Tile-Based Self-Assembly

Motivated by applications in DNA-nanotechnology, theoretical investigations in algorithmic tile-assembly have blossomed into a mature theory. In addition to computational universality, the abstract Tile Assembly Model (aTAM) was shown to be intrinsically universal (FOCS 2012), a strong notion of completeness where a single tile set is capable of simulating the full dynamics of all systems within the model; however, this construction fundamentally required non-deterministic tile attachments. This was confirmed necessary when it was shown that the class of directed aTAM systems, those where all possible sequences of tile attachments result in the same terminal assembly, is not intrinsically universal (FOCS 2016). Furthermore, it was shown that the non-cooperative aTAM, where tiles only need to match on 1 side to bind rather than 2 or more, is not intrinsically universal (SODA 2014) nor computationally universal (STOC 2017). Building on these results to further investigate the other dynamics, Hader et al. examined several tile-assembly models which varied across (1) the numbers of dimensions used, (2) how tiles diffused through space, and (3) whether each system is directed, and determined which models exhibited intrinsic universality (SODA 2020). In this paper we extend those results to provide direct comparisons of the various models against each other by considering intrinsic simulations between models. Our results show that in some cases, one model is strictly more powerful than another, and in others, pairs of models have mutually exclusive capabilities. This paper is a greatly expanded version of that which appeared in ICALP 2023.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Algorithmica
Algorithmica 工程技术-计算机:软件工程
CiteScore
2.80
自引率
9.10%
发文量
158
审稿时长
12 months
期刊介绍: Algorithmica is an international journal which publishes theoretical papers on algorithms that address problems arising in practical areas, and experimental papers of general appeal for practical importance or techniques. The development of algorithms is an integral part of computer science. The increasing complexity and scope of computer applications makes the design of efficient algorithms essential. Algorithmica covers algorithms in applied areas such as: VLSI, distributed computing, parallel processing, automated design, robotics, graphics, data base design, software tools, as well as algorithms in fundamental areas such as sorting, searching, data structures, computational geometry, and linear programming. In addition, the journal features two special sections: Application Experience, presenting findings obtained from applications of theoretical results to practical situations, and Problems, offering short papers presenting problems on selected topics of computer science.
期刊最新文献
Energy Constrained Depth First Search Recovering the Original Simplicity: Succinct and Exact Quantum Algorithm for the Welded Tree Problem Permutation-constrained Common String Partitions with Applications Reachability of Fair Allocations via Sequential Exchanges On Flipping the Fréchet Distance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1