|
Abstract : |
DNA computing 1 potentially provides a degree of parallelism far beyond that of conventional silicon-based computers. A number of researchers 2 have experimentally demonstrated DNA computing in solving instances of the satisfiability problems. Self-assembly of DNA nanostructures is theoretically an efficient method of executing parallel computation where information is encoded in DNA tiles and a large number of tiles can be self-assembled via sticky-end associations. Winfree et al. 3 have shown that representations of formal languages can be generated by self-assembly of branched DNA nanostructures and that 2-dimensional DNA selfassembly is Turing-universal (i.e. capable of universal computation). Mao et al. 4 experimentally implemented the first algorithmic DNA self-assembly which performed a logical computation (cumulative XOR), however that study only, |
