https://scholars.lib.ntu.edu.tw/handle/123456789/362545
標題: | Program size and temperature in self-assembly | 作者: | CHEN HO-LIN Doty, D. Seki, S. |
公開日期: | 2011 | 卷: | 7074 LNCS | 起(迄)頁: | 445-453 | 來源出版物: | Lecture Notes in Computer Science | 摘要: | Winfree's abstract Tile Assembly Model (aTAM) is a model of molecular self-assembly of DNA complexes known as tiles, which float freely in solution and attach one at a time to a growing "seed" assembly based on specific binding sites on their four sides. We show that there is a polynomial-time algorithm that, given an n ×n square, finds the minimal tile system (i.e., the system with the smallest number of distinct tile types) that uniquely self-assembles the square, answering an open question of Adleman, Cheng, Goel, Huang, Kempe, Moisset de Espanés, and Rothemund (Combinatorial Optimization Problems in Self-Assembly, STOC 2002). Our investigation leading to this algorithm reveals other positive and negative results about the relationship between the size of a tile system and its "temperature" (the binding strength threshold required for a tile to attach) © 2011 Springer-Verlag. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-84055191080&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/362545 https://www.scopus.com/inward/record.uri?eid=2-s2.0-84055191080&doi=10.1007%2f978-3-642-25591-5_46&partnerID=40&md5=d0b6eb1530c15072a0033ee774ec25be |
ISSN: | 03029743 | DOI: | 10.1007/978-3-642-25591-5_46 | SDG/關鍵字: | Assembly model; Binding strength; Combinatorial optimization problems; DNA complex; Molecular self assembly; Polynomial-time algorithms; Program size; Specific binding; Binding sites; Combinatorial optimization; Self assembly; Algorithms |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。