Extending DNA-Sticker Arithmetic to Arbitrary Size Using Staples

作者: Mark G. Arnold

DOI: 10.1007/978-3-319-01928-4_1

关键词:

摘要: The simple-sticker model uses robotic processing of DNA strands contained in a fixed number tubes to implement massively-parallel bit strings. bits whose value are '1' recorded by short "stickers" that hybridize at specific places on the strand. Other models, like folded origami, use "staples" disjoint portions single This paper proposes an extended-sticker paradigm staples contiguous two substrands, forming virtual strands. problem redundant is solved blotting out old values. As example novel paradigm, log-time summation algorithm outperforms with ideal implementation any electronic supercomputer conceivable near future for large data sets. JavaScript and CUDA simulations validate theoretical operation proposed algorithm.

参考文章(23)
Alexander J. Hartemink, David K. Gifford, Thermodynamic simulation of deoxyoligonucleotide hybridization for DNA computation. DNA Based Computers. pp. 25- 37 ,(1997)
Erik Winfree, Kevin Chen, Error Correction in DNA Computing: Misclassification andStrand Loss DNA Based Computers. pp. 49- 63 ,(2000)
Zoya Ignatova, Karl-Heinz Zimmermann, Israel Martnez-Prez, DNA Computing Models Springer. ,(2008)
DNA Computing and Molecular Programming Lecture Notes in Computer Science. ,vol. 6518, ,(2011) , 10.1007/978-3-642-18305-8
L. Adleman, Molecular computation of solutions to combinatorial problems Science. ,vol. 266, pp. 1021- 1024 ,(1994) , 10.1126/SCIENCE.7973651
Israel Martínez-Pérez, Wolfgang Brandt, Michael Wild, Karl-Heinz Zimmermann, Bioinspired Parallel Algorithms for Maximum Clique Problem on FPGA Architectures Journal of Signal Processing Systems. ,vol. 58, pp. 117- 124 ,(2010) , 10.1007/S11265-008-0322-3