Loading...
Please wait, while we are loading the content...
Similar Documents
Dnaql: a Query Language for Dna Sticker Complexes
| Content Provider | Semantic Scholar |
|---|---|
| Author | Gillis, Joris J. M. Bussche, Jan Van Den |
| Copyright Year | 2013 |
| Abstract | DNA computing has a rich history of computing paradigms with great expressive power. However, far less expressive power is needed for data manipulation. Indeed, the relational algebra, the yardstick of database systems, is expressible in first-order logic, and thus less powerful than Turing-complete models. Turing-complete DNA computing models have to account for many and varied scenarios. A DNA implementation of data manipulations might be nimbler and perform its operation faster than a Turing-complete DNA computing model. Hence, we propose a restrictive model for implementing data manipulation operations, focused on implementability in DNA. We call this model the sticker complex model. A forte of the sticker complex model, is its ability to detect when hybridization becomes an uncontrolled chain reaction. Such chain reactions make hybridization less predictable and thus less attractive for deterministic computations. Next, we defined a query language on sticker complexes, called DNAQL. DNAQL is a typed, applicative functional programming language, powerful enough to simulate the relational algebra on sticker complexes. The type system enjoys a number of desirable properties such as soundness, maximality, |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://alpha.uhasselt.be/~lucp1080/dnaqlfull.pdf |
| Alternate Webpage(s) | http://alpha.luc.ac.be/~lucp1080/dnaqlfull.pdf |
| Alternate Webpage(s) | http://alpha.uhasselt.be/jan.vandenbussche/dnaqlfull.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
