Combinatorial Optimization Problem in Designing DNA Self-Assembly Tile Sets

Author

Ma, X. ; Lombardi, F.

Author_Institution

Dept of Electr. & Comput. Eng., Northeastern Univ., Boston, MA

fYear

2008

fDate

29-30 Sept. 2008

Firstpage

73

Lastpage

76

Abstract

DNA self-assembly has been advocated as a bottom-up manufacturing technology (as applicable in the nano scales) and for algorithmic computation. However, previous research did not address the issue of designing a tile set for an arbitrary target pattern (as to ensure periodic repetition in its assembly) of finite size. This paper considers the synthesis of tile sets for DNA self-assembly and analyzes it as a combinatorial optimization problem. This problem is referred to as PATS (pattern assembling tile-set synthesis). A brief proof is provided for the NP-completeness of PATS.

Keywords

DNA; biomolecular electronics; nanoelectronics; optimisation; self-assembly; DNA self-assembly tile sets; NP-completeness; algorithmic computation; arbitrary target pattern; bottom-up manufacturing technology; combinatorial optimization problem; nanoscale technology; pattern assembling tile-set synthesis; Aggregates; Algorithm design and analysis; Assembly; Bonding; Circuit synthesis; Computer aided manufacturing; DNA; Design optimization; Self-assembly; Tiles; DNA Self-assembly; algorithmic self-assembly NP-completeness; nanoscale manufacturing;

fLanguage

English

Publisher

ieee

Conference_Titel

Design and Test of Nano Devices, Circuits and Systems, 2008 IEEE International Workshop on

Conference_Location

Cambridge, MA

Print_ISBN

978-0-7695-3379-7

Type

conf

DOI

10.1109/NDCS.2008.7

Filename

4638338