The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Running time and program size for self-assembled squares
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
Theory and experiments in algorithmic self-assembly
Theory and experiments in algorithmic self-assembly
Complexities for generalized models of self-assembly
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Self-replication and evolution of DNA crystals
ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
Proceedings of the 10th international conference on DNA computing
DNA'04 Proceedings of the 10th international conference on DNA computing
Error free self-assembly using error prone tiles
DNA'04 Proceedings of the 10th international conference on DNA computing
Compact error-resilient computational DNA tiling assemblies
DNA'04 Proceedings of the 10th international conference on DNA computing
Fault and adversary tolerance as an emergent property of distributed systems' software architectures
Proceedings of the 2007 workshop on Engineering fault tolerant systems
Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of graph self-assembly in accretive systems
Natural Computing: an international journal
Combining self-healing and proofreading in self-assembly
Natural Computing: an international journal
Strict Self-assembly of Discrete Sierpinski Triangles
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Random Number Selection in Self-assembly
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Polyomino-safe DNA self-assembly via block replacement
Natural Computing: an international journal
Combining randomness and a high-capacity DNA memory
DNA13'07 Proceedings of the 13th international conference on DNA computing
Watson-Crick conjugate and commutative words
DNA13'07 Proceedings of the 13th international conference on DNA computing
Controlling errors in the process of molecular self-assembly
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Watson---Crick palindromes in DNA computing
Natural Computing: an international journal
Multiple error detection in DNA self-assembly using coded tiles
IEEE Transactions on Circuits and Systems II: Express Briefs
Self-assembly of infinite structures: A survey
Theoretical Computer Science
A coding framework for DNA self-assembly
NANOARCH '09 Proceedings of the 2009 IEEE/ACM International Symposium on Nanoscale Architectures
Complexity of graph self-assembly in accretive systems and self-destructible systems
Theoretical Computer Science
Programmable Control of Nucleation for Algorithmic Self-Assembly
SIAM Journal on Computing
The effect of malformed tiles on tile assemblies within the kinetic tile assembly model
Natural Computing: an international journal
Beyond biology: designing a new mechanism for self-replication and evolution at the nanoscale
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Complexity of graph self-assembly in accretive systems and self-destructible systems
DNA'05 Proceedings of the 11th international conference on DNA Computing
A self-assembly model of time-dependent glue strength
DNA'05 Proceedings of the 11th international conference on DNA Computing
On the complexity of graph self-assembly in accretive systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
Theory of algorithmic self-assembly
Communications of the ACM
| Hi-index | 0.02 |
Fault-tolerance is a critical issue for biochemical computation. Recent theoretical work on algorithmic self-assembly has shown that error correcting tile sets are possible, and that they can achieve exponential decrease in error rates with a small increase in the number of tile types and the scale of the construction [24, 4]. Following [17], we consider the issue of applying similar schemes to achieve error correction without any increase in the scale of the assembled pattern. Using a new proofreading transformation, we show that compact proofreading can be performed for some patterns with a modest increase in the number of tile types. Other patterns appear to require an exponential number of tile types. A simple property of existing proofreading schemes – a strong kind of redundancy – is the culprit, suggesting that if general purpose compact proofreading schemes are to be found, this type of redundancy must be avoided.