# The Complexity of Fixed-Height Patterned Tile Self-assembly

@article{Seki2016TheCO, title={The Complexity of Fixed-Height Patterned Tile Self-assembly}, author={Shinnosuke Seki and Andrew Winslow}, journal={ArXiv}, year={2016}, volume={abs/1604.07190} }

We characterize the complexity of the PATSproblem for patterns of fixed height and color count in variants of the model where seed glues are either chosen or fixed and identical (so-called non-uniform and uniform variants). We prove that both variants are NP-complete for patterns of height 2 or more and admit O(n)-time algorithms for patterns of height 1. We also prove that if the height and number of colors in the pattern is fixed, the non-uniform variant admits a O(n)-time algorithm while the… CONTINUE READING

#### Supplemental Presentations

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 15 REFERENCES

A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis

- Computer Science, Mathematics
- 2017

8

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

- Computer Science, Mathematics
- 2013

24

Intrinsic universality and the computational power of self-assembly

- Mathematics, Computer Science
- 2013

34