Binary Tree DNA Computing Model Based on the Insert - Remove System
| Autor: | Bin Wu, Jie Lian, Qing Hu Wang, Zhi Li Pei |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Quantitative Biology::Biomolecules
Sequence Binary tree Computer science General Medicine ENCODE Quantitative Biology::Genomics Insert (molecular biology) law.invention chemistry.chemical_compound Turing machine symbols.namesake Tree traversal chemistry DNA computing law symbols Automata theory Algorithm DNA |
| Zdroj: | Applied Mechanics and Materials. :2062-2066 |
| ISSN: | 1662-7482 |
| DOI: | 10.4028/www.scientific.net/amm.411-414.2062 |
| Popis: | DNA computing has the support of automata theory completely, based on the equivalent for expressing problem by DNA computing model and the double-shift language in automata theory, using a DNA molecule may encode the instantaneous description of Turing machine, and the operation of continuous sequence can be realized by the DNA molecule s operation with enzymes. Insert - Remove System is a computing system in DNA computing, designed an Binary Tree DNA computing model based on the Insert - Remove System in this paper, which can realize the insert, delete and traversal operation, and has the completeness of the theory. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|