TY - GEN

T1 - Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly

AU - Czeizler, Eugen

AU - Popa, Alexandru

PY - 2012/8/27

Y1 - 2012/8/27

N2 - Ma and Lombardi (2009) introduce and study the Pattern self-Assembly Tile set Synthesis (PATS) problem. In particular they show that the optimization version of the PATS problem is NP-hard. However, their NP-hardness proof turns out to be incorrect. Our main result is to give a correct NP-hardness proof via a reduction from the 3SAT. By definition, the PATS problem assumes that the assembly of a pattern starts always from an "L"-shaped seed structure, fixing the borders of the pattern. In this context, we study the assembly complexity of various pattern families and we show how to construct families of patterns which require a non-constant number of tiles to be assembled.

AB - Ma and Lombardi (2009) introduce and study the Pattern self-Assembly Tile set Synthesis (PATS) problem. In particular they show that the optimization version of the PATS problem is NP-hard. However, their NP-hardness proof turns out to be incorrect. Our main result is to give a correct NP-hardness proof via a reduction from the 3SAT. By definition, the PATS problem assumes that the assembly of a pattern starts always from an "L"-shaped seed structure, fixing the borders of the pattern. In this context, we study the assembly complexity of various pattern families and we show how to construct families of patterns which require a non-constant number of tiles to be assembled.

UR - http://www.scopus.com/inward/record.url?scp=84865264546&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84865264546&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-32208-2_5

DO - 10.1007/978-3-642-32208-2_5

M3 - Conference contribution

AN - SCOPUS:84865264546

SN - 9783642322075

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 58

EP - 72

BT - DNA Computing and Molecular Programming - 18th International Conference, DNA 18, Proceedings

T2 - 18th International Conference on DNA Computing and Molecular Programming, DNA 18

Y2 - 14 August 2012 through 17 August 2012

ER -