49 citations · 74 across the 40 of their papers we have counts for
40 papers
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis
Aleck Johnsen, Ming-Yang Kao, Shinnosuke Seki
Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular (color) pattern. For k >= 1, k-PATS is a variant…
Computing Minimum Tile Sets to Self-Assemble Colors Patterns
Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki
Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular color pattern. For , -PATS is a varia…
Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-Assembly Systems
Ho-Lin Chen, Ming-Yang Kao
DNA tile self-assembly has emerged as a rich and promising primitive for nano-technology. This paper studies the problems of minimizing assembly time and error rate by changing the…
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
Ming-Yang Kao, Henry C. M. Leung, He Sun +1
Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of…
On Approximating Four Covering and Packing Problems
Mary Ashley, Tanya Berger-Wolf, Piotr Berman +3
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them…
Reducing Tile Complexity for Self-Assembly Through Temperature Programming
Ming-Yang Kao, Robert Schweller
We consider the tile self-assembly model and how tile complexity can be eliminated by permitting the temperature of the self-assembly system to be adjusted throughout the assembly…