Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  addresses the issues revolving around the synthesis of tile sets for DNA self-assembly as a promising approach for IC manufacturing in the nanoscale. As for a finite pattern, synthesis for minimizing tile or bond types is equivalent to a minimum graph coloring problem, two greedy algorithms that reduce the number of tiles (PATS_Tile) or bonds (PATS_Bond) in synthesized tile sets are proposed and evaluated. Both algorithms are O(l 4 ) for a square pattern of dimension l. It is shown by simulation that PATS_Tile has a better average performance if both types of reduction must be accomplished.
['Xiaojun Ma', 'Fabrizio Lombardi']
I am writing a research paper on a idea Synthesis of Tile Sets for DNA Self-Assembly
[{"from": "human", "value": "I am writing a research paper on a idea Synthesis of Tile Sets for DNA Self-Assembly"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  addresses the issues revolving around the synthesis of tile sets for DNA self-assembly as a promising approach for IC manufacturing in the nanoscale. As for a finite pattern, synthesis for minimizing tile or bond types is equivalent to a minimum graph coloring problem, two greedy algorithms that reduce the number of tiles (PATS_Tile) or bonds (PATS_Bond) in synthesized tile sets are proposed and evaluated. Both algorithms are O(l 4 ) for a square pattern of dimension l. It is shown by simulation that PATS_Tile has a better average performance if both types of reduction must be accomplished."}]