Search methods for tile sets in patterned DNA self-assembly
作者：
Highlights：
• The PATS problem asks to find a set of tiles that self-assembles a given pattern.
• Our exhaustive PS-BB algorithm uses a search tree in the lattice of grid partitions.
• Our heuristic PS-H algorithm finds small solutions significantly faster than PS-BB.
• Answer Set Programming performs well for patterns with a small optimal solution.
• The PS-H algorithm generates not only small but also reliable tile sets.
摘要
•The PATS problem asks to find a set of tiles that self-assembles a given pattern.•Our exhaustive PS-BB algorithm uses a search tree in the lattice of grid partitions.•Our heuristic PS-H algorithm finds small solutions significantly faster than PS-BB.•Answer Set Programming performs well for patterns with a small optimal solution.•The PS-H algorithm generates not only small but also reliable tile sets.
论文关键词：DNA self-assembly,Tilings,Tile Assembly Model,Pattern assembly,Tile set synthesis,Reliable self-assembly
论文评审过程：Received 2 August 2012, Revised 5 July 2013, Accepted 12 August 2013, Available online 22 August 2013.
论文官网地址：https://doi.org/10.1016/j.jcss.2013.08.003
