## Local parallel biomolecular computing (1999)

Venue: | DNA Based Computers III, volume 48 of DIMACS |

Citations: | 53 - 16 self |

### BibTeX

@INPROCEEDINGS{Reif99localparallel,

author = {John H. Reif},

title = {Local parallel biomolecular computing},

booktitle = {DNA Based Computers III, volume 48 of DIMACS},

year = {1999},

pages = {217--254},

publisher = {American Mathematical Society}

}

### Years of Citing Articles

### OpenURL

### Abstract

Biomolecular Computation(BMC) is computation at the molecular scale, using biotechnology engineering techniques. Most proposed methods for BMC used distributed (molecular) parallelism (DP); where operations are executed in parallel on large numbers of distinct molecules. BMC done exclusively by DP requires that the computation execute sequentially within any given molecule (though done in parallel for multiple molecules). In contrast, local parallelism (LP) allows operations to be executed in parallel on each given molecule. Winfree, et al [W96, WYS96]) proposed an innovative method for LP-BMC, that of computation by unmediated self-assembly of � arrays of DNA molecules, applying known domino tiling techniques (see Buchi [B62], Berger [B66], Robinson [R71], and Lewis and Papadimitriou [LP81]) in combination with the DNA self-assembly techniques of Seeman et al [SZC94]. The likelihood for successful unmediated self-assembly of computations has not been determined (we discuss a simple model of assembly where there may be blockages in self-assembly, but more sophisticated models may have a higher likelihood of success). We develop improved techniques to more fully exploit the potential power of LP-BMC. To increase

### Citations

11561 |
Computers and Intractability - A Guide to the Theory of NP-Completness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ...riou [LP81], (pages 296–300) provide a direct simulation of a single tape deterministic Turing Machine to prove this undecidablility result. Garey, Johnson, and Papadimitriou [GJP77] (see citation of =-=[GJ79]-=-, page 257) proved that the domino tiling problem is NP-complete if the extent of tiling is a rectangle of polynomial size. They used a direct reduction from the directed Hamiltonian path problem (kno... |

1375 |
Introduction to Parallel Algorithms and Architectures: Arrays
- Leighton
- 1992
(Show Context)
Citation Context ...graph with node set � ����� effect both � and with a set of edges that 1. a perfect shuffle permutation on the nodes, and 2. a pair-wise exchange operation on the nodes. See Ullman [U84] and Leighton =-=[L92]-=- for discussion of the the use of shuffle-exchange network for emulations of other networks such as the butterfly and CCC networks and see Schawbe [S90] for a proof of the computational equivalence of... |

672 | An introduction to parallel algorithms - JáJá - 1992 |

656 | Molecular Cloning: A - Sambrook, Fritsch, et al. - 1989 |

319 |
The undecidability of the dominoe problem
- Berger
- 1966
(Show Context)
Citation Context ... [W96, WYS96]) proposed an innovative method for LP-BMC, that of computation by unmediated self-assembly of � arrays of DNA molecules, applying known domino tiling techniques (see Buchi [B62], Berger =-=[B66]-=-, Robinson [R71], and Lewis and Papadimitriou [LP81]) in combination with the DNA self-assembly techniques of Seeman et al [SZC94]. The likelihood for successful unmediated self-assembly of computatio... |

295 |
Parallelism in random access machines
- Fortune, Wyllie
- 1978
(Show Context)
Citation Context ...its and parallel random access machines), with � time and work (the work bound is the product of the number of processors times the parallel time) due to Ladner and Fischer [LF80]. Fortune and Wyllie =-=[FW78]-=- developed a technique known as parallel pointer jumping which contracts consecutive pairs of an input list � ������� , into single elements. Let us assume isapowerof .Let�� be the monoid associated w... |

184 |
Proving theorems by pattern recognition i. The
- Wang
- 1967
(Show Context)
Citation Context ...egions in the plane defined by horizontal and vertical lines which are integer units apart from the horizontal and vertical axis respectively. A class of (domino) tiling problems were defined by Wang =-=[W61]-=- as follows: We are given a finite set of tiles of unit size square tiles each with top and bottom sides labeled with symbols over a finite alphabet. These labels will be called pads. We also specify ... |

175 |
Parallel processing with the perfect shuffle
- Stone
- 1971
(Show Context)
Citation Context ...C methods for perfect shuffle and pair-wise exchange using a linear size assembly and constant time. This provides logarithmic time LP-BMC algorithms for the large class of normal parallel algorithms =-=[S71, U84, L92]-=- on shuffle-exchange networks, e.g. DFT, bitonic merge, fixed permutation of data, as well as evaluation of a bounded degree Boolean circuit in time bounded by the product of the circuit depth times a... |

147 |
Mathematical Theory of Connecting Networks and Telephone Traffic
- BeneS
- 1965
(Show Context)
Citation Context ...rallel algorithms [S71, U84, L92] on shuffle-exchange networks (e.g., DFT and bitonic merge of n-vectors), • logarithmic assembly depth general permutations, by use of known Bene˘s network techniques =-=[B65]-=-, • evaluation of a bounded degree Boolean circuit of size n in assembly depth bounded by the circuit depth times O(log n) (without a large amount of communication between distinct molecules, in contr... |

110 | Proteins: a theoretical perspective of dynamics, structure, and thermodynamics - Brooks, Karplus, et al. - 1988 |

94 | DNA Structure and Function - Sinden - 1994 |

91 | Nucleic-acid junctions and lattices - Seeman - 1982 |

90 | Logical computation using algorithmic self-assembly of DNA triple-crossover molecules - Mao, LaBean, et al. - 2000 |

88 | Universal Computation via Self-assembly of DNA. Some Theory and Experiments
- Winfree, Yang, et al.
- 1996
(Show Context)
Citation Context ...n of a one-tape Turing Machine with � space (or a � parallel array of processors) running in time � by construction of an assembly of an � array of � � � � � tiles. Winfree [W96] (also Winfree, et al =-=[WYS96]-=-), proposed to execute these domino tiling techniques in LP-BMC by assembling � arrays of DNA molecules, using the DNA self-assembly techniques of Seeman et al [SZC94]. Winfree proposed the computatio... |

80 | Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes - LaBean, Yan, et al. - 2000 |

80 | A DNA and restriction enzyme implementation of Turing machines, DNA based computers - Rothemund - 2000 |

79 | The synthesis from DNA of a molecule with the connectivity of a cube - Chen, Seeman - 1991 |

78 | A permutation network
- Waksman
- 1968
(Show Context)
Citation Context ...tion of Circuits A known parallel algorithm, known as the Bene� network [B65], allows the execution of an (arbitrary) fixed permutation of data elements by use of a normal parallel algorithm (Waksman =-=[W68]-=-). This requires � LP-BMC steps by our previous results in Subsection 8.4 for normal parallel algorithms. This also implies LP-BMC can do parallel evaluation of a fixed, bounded degree Boolean circuit... |

76 | On the computational power of DNA annealing and ligation
- Winfree
- 1996
(Show Context)
Citation Context ... Machine with S ≥ n space (or a 1D parallel array of S processors) running in time T ≥ n by construction of an assembly of an S/2 × T array of A = ST/2 ≥ n 2 /2 tiles with assembly depth T .. Winfree =-=[W96]-=- (also Winfree, et al [WYS96]), proposed to execute these domino tiling techniques in LP-BMC by assembling 2D arrays of DNA molecules, using the DNA self-assembly techniques of Seeman et al [SZC94]. W... |

74 | Molecular Computation of
- Adleman
- 1994
(Show Context)
Citation Context ...putation due to the vast numbers of molecules in a test tube. BMCs [SM97] have utilized certain base methods which include: • generation of a large number of sequences by random assembly; see Adleman =-=[A95]-=- and Lipton [L95] (interestingly, this is the only method now in use in BMC that could be viewed as a combined DP-BMC and LP-BMC method) and • DP-BMC methods for string editing operations, executed se... |

63 | Building an associative memory vastly larger than the brain - Baum - 1995 |

60 |
Molecular Computation of Solutions to
- Adleman
- 1994
(Show Context)
Citation Context ...ections, into double-stranded DNA in a helical structure. We will use the term Biomolecular computation (BMC) to denote nanocomputation using biotechnology. The first implementation of BMC by Adleman =-=[A94]-=- solved a small Hamiltonian path problem by use of recombinant DNA technologies. Certain fundamental principles for doing BMC may be (to at least a degree) independent of the underlying technology. Th... |

60 |
Computational Aspects of VLSI,’’ Computer
- Ullman
(Show Context)
Citation Context ...(Stone [S71]) is a graph with node set � ����� effect both � and with a set of edges that 1. a perfect shuffle permutation on the nodes, and 2. a pair-wise exchange operation on the nodes. See Ullman =-=[U84]-=- and Leighton [L92] for discussion of the the use of shuffle-exchange network for emulations of other networks such as the butterfly and CCC networks and see Schawbe [S90] for a proof of the computati... |

59 | Speeding up computations via molecular biology
- Lipton
- 1996
(Show Context)
Citation Context ...he vast numbers of molecules in a test tube. BMCs [SM97] have utilized certain base methods which include: • generation of a large number of sequences by random assembly; see Adleman [A95] and Lipton =-=[L95]-=- (interestingly, this is the only method now in use in BMC that could be viewed as a combined DP-BMC and LP-BMC method) and • DP-BMC methods for string editing operations, executed sequentially within... |

59 | Breaking DES using a molecular computer
- Boneh, Dunworth, et al.
- 1995
(Show Context)
Citation Context ...SI, but this disadvantage may be overcome by the use of massive parallelism due to DP-BMC. For example, consider the recent stickers project of Adleman et al [ARRW96] (see also an earlier proposal of =-=[BDL95]-=-) for breaking the DES standard cryptosystem via BMC. Their proposed method for breaking DES makes use of DP-BMC to evaluate in parallel the DES circuit for all possible key values. Their method uses ... |

58 | A.: Simulating boolean circuits on a DNA computer
- Ogihara, Ray
- 1996
(Show Context)
Citation Context ...AM model for DP-BMC where long complementary matching is allowed (with a factor further cost for a more restricted RDNA model where only constant length matches are allowed). Recently Ogihara and Ray =-=[OR97]-=- gave the similar bounds for circuit evaluation assuming implicitly a similar model for DP-BMC where long complementary matching is allowed (but do not consider more refined models such as the RDNA wh... |

49 | Good encodings for DNA-based solutions to combinatorial problems - Deaton, Murphy, et al. - 1996 |

49 | Proofreading tile sets: Error correction for algorithmic self-assembly
- Winfree, Bekbolatov
- 2003
(Show Context)
Citation Context ...that careful choice of settings of the parameters allow unmediated self-assembly to succeed in kinetic assembly model. Further, the subsequent development of error-resilient tiling systems by Winfree =-=[WB2004]-=-, Reif [RS04] and others, has Then computational tiling assemblies using unmediated self-assembly were first experimentally demonstrated via one dimensional assemblies [LWR99, MMLR00], using designs b... |

47 | Compact error-resilient computational DNA tiling assemblies
- Reif, Sahu, et al.
- 2004
(Show Context)
Citation Context ...oice of settings of the parameters allow unmediated self-assembly to succeed in kinetic assembly model. Further, the subsequent development of error-resilient tiling systems by Winfree [WB2004], Reif =-=[RS04]-=- and others, has Then computational tiling assemblies using unmediated self-assembly were first experimentally demonstrated via one dimensional assemblies [LWR99, MMLR00], using designs based on the t... |

42 | On applying molecular computation to the data encryption standard
- Adleman, Rothemund, et al.
- 1999
(Show Context)
Citation Context ...than the step duration for conventional VLSI, but this disadvantage may be overcome by the use of massive parallelism due to DP-BMC. For example, consider the recent stickers project of Adleman et al =-=[ARRW96]-=- (see also an earlier proposal of [BDL95]) for breaking the DES standard cryptosystem via BMC. Their proposed method for breaking DES makes use of DP-BMC to evaluate in parallel the DES circuit for al... |

41 | Parallel molecular computation: Models and simulations - Reif - 1995 |

38 | DNA sequences useful for computation - Baum - 1996 |

38 | Making DNA Computers Error Resistant - Lipton, Boneh, et al. - 1996 |

35 |
Antiparallel DNA double crossover molecules as components for nanoconstruction
- Li, Yang, et al.
- 1996
(Show Context)
Citation Context .... There are number of known methodologies for 3-way pairing of DNA strands. • The DNA triple helix can be constructed by the Dervan system [DD92]. • Another option is the use of a motif known as DX+J =-=[LYQS96]-=-, which is almost as stiff as DX, and provides the option of having DNA come out the side of a tile. • Seeman [S97] further suggests to ligate from the perpendicular arm a second 3-arm junction, which... |

31 | Complexity of restricted and unrestricted models of molecular computation - Winfree - 1996 |

30 | Computing with DNA - Beaver - 1995 |

30 | Experimental progress in computation by self-assembly of DNA tilings - LaBean, Winfree, et al. |

29 | DNA computers in vitro and vivo - Smith, Schweitzer - 1995 |

28 | A restricted genetic alphabet for DNA computing - Mir - 1996 |

23 | Organization of ‘nanocrystal molecules’ using DNA. Nature 382 - Alivisatos, Johnsson, et al. - 1996 |

23 | A sticker based architecture for DNA computation - Roweis, Winfree, et al. |

22 |
Papadimitriou, Elements of the Theory of Computation
- Lewis, H
- 1997
(Show Context)
Citation Context ...-BMC, that of computation by unmediated self-assembly of � arrays of DNA molecules, applying known domino tiling techniques (see Buchi [B62], Berger [B66], Robinson [R71], and Lewis and Papadimitriou =-=[LP81]-=-) in combination with the DNA self-assembly techniques of Seeman et al [SZC94]. The likelihood for successful unmediated self-assembly of computations has not been determined (we discuss a simple mode... |

22 | A DNA based implementation of an evolutionary search for good encodings for DNA computation - Deaton, Murphy, et al. - 1997 |

21 | A surface-based approach to DNA computation - Liu, Guo, et al. - 1999 |

19 | DNA sequence determination by hybridization: a strategy for efficient large-scale sequencing - Drmanac, Drmanac, et al. - 1993 |

19 | Principles of Gene Manipulation: An Introduction to Genetic Engineering - Old, Primrose - 1994 |

17 | Joining and rotating data with molecules - Arita, Hagiya, et al. |

15 | DNA based molecular computation: template-template interactions - Kaplan, Cecchi, et al. - 1998 |

15 | Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search Using Error-Correcting Codes and Vector Quantization - Reif, LaBean |

14 | Mesoscopic computer engineering: Automating DNA-based molecular computing via traditional practices of parallel computer architecture design - Amenyo - 1996 |