Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly

Details Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly

2009-11-16

arxiv.org/abs/0911.2924v2

Computer Science

Data Structures and Algorithms

12 pages, 6 figures

Scientific paper

The Pattern self-Assembly Tile set Synthesis (PATS) problem is to determine a set of coloured tiles that self-assemble to implement a given rectangular colour pattern. We give an exhaustive branch-and-bound algorithm to find tile sets of minimum cardinality for the PATS problem. Our algorithm makes use of a search tree in the lattice of partitions of the ambient rectangular grid, and an efficient bounding function to prune this search tree. Empirical data on the performance of the algorithm shows that it compares favourably to previously presented heuristic solutions to the problem.

Affiliated with

Also associated with

No associations

Rating

Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synthesizing Minimal Tile Sets for Patterned DNA Self-Assembly will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-498412