Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

Voted

CSP
2013

31views more CSP 2013»

DNA Tiles, Wang Tiles and Combinators

11 years 12 months ago

DNA Tiles, Wang Tiles and Combinators

Download csp2013.mimuw.edu.pl

In this paper we explore the relation between Wang Tiles and Schonﬁnkel Combinators in order to investigate Functional Combinators as an programming language for Self-assembly and DNA computing. We show: How any combinatorial program can be expressed in terms of Wang Tiles, and again, how any computation of the program ﬁts into a grid of tiles of a suitable ﬁnite, tile set, and ﬁnally, how a program for Self-assembly DNA computing can be obtained. The result is a general methodology that, given any computable function, allows to deﬁne a Self-assembly program that can be used to construct the computations of the function

Marco Bellia, M. Eugenia Occhiuto

Real-time Traffic

CSP 2013 |

claim paper

Related Content

» Combining selfhealing and proofreading in selfassembly

» Picture Recognizability with Automata Based on Wang Tiles

» SelfAssembled Circuit Patterns

» Shape Replication Through SelfAssembly and RNase Enzymes

» Deterministic recognizability of picture languages with Wang automata

» Staged Selfassembly Nanomanufacture of Arbitrary Shapes with O 1 Glues

» Memory Consistency Conditions for SelfAssembly Programming

» Parameter estimation for robust HMM analysis of ChIPchip data

» Starr Simple Tiling ARRay analysis of Affymetrix ChIPchip data

» An effective approach for identification of in vivo proteinDNA binding sites from paireden...

Post Info
More Details (n/a)

Added	27 Apr 2014
Updated	27 Apr 2014
Type	Journal
Year	2013
Where	CSP
Authors	Marco Bellia, M. Eugenia Occhiuto

Comments (0)