2001
DOI: 10.1007/3-540-44992-2_2
|View full text |Cite
|
Sign up to set email alerts
|

Successive state transitions with I/O interface by molecules

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2001
2001
2013
2013

Publication Types

Select...
6
3

Relationship

3
6

Authors

Journals

citations
Cited by 18 publications
(10 citation statements)
references
References 8 publications
0
10
0
Order By: Relevance
“…3 All of the strong constraints could be satisfied with only 3 bases [15]. Other groups that employed three-base words likewise used random word-generation for their word design [24,23].…”
Section: Stochastic Methodsmentioning
confidence: 99%
“…3 All of the strong constraints could be satisfied with only 3 bases [15]. Other groups that employed three-base words likewise used random word-generation for their word design [24,23].…”
Section: Stochastic Methodsmentioning
confidence: 99%
“…Benenson, Paz-Elizur, Adar, Keinan, Livneh, and Shapiro [38] reported development of a programmable 'finite automaton', using a restriction nucleaseand ligase as hardware and software consisting of transition rules encoded by DNA. Komiya, Sakamoto, Gouzo, Yokoyama, Arita, Nishikawa, and Hagiya [39] showed that a single-stranded DNA can serve as an independent machine by using a solid support technique in three experimental achievements in computation model based on 'whiplash' reactions, while Garzon, Gao, Rose, Murphy, Deaton, Franceschetti, and Stevens [40] used a ligation-based approach for in-vitro implementation of finite-state machines, which requires sequential input feed and different molecules for different machines. In their second implementation not based on ligation transitions are represented by reusable molecules and the input, coded as a molecule, can be introduced at once.…”
Section: Dna Computation Systemsmentioning
confidence: 96%
“…Benenson, Paz-Elizur, Adar, Keinan, Livneh, and Shapiro [6] reported development of a programmable 'finite automaton', using a restriction nucleaseand ligase as hardware and software consisting of transition rules encoded by DNA. Komiya, Sakamoto, Gouzo, Yokoyama, Arita, Nishikawa, and Hagiya [18] showed that a single-stranded DNA can serve as an independent machine by using a solid support technique in three experimental achievements in computation model based on 'whiplash' reactions, while Garzon, Gao, Rose, Murphy, Deaton, Franceschetti, and Stevens [12] used a ligation-based approach for in-vitro implementation of finite-state machines, which requires sequential input feed and different molecules for different machines. In their second implementation not based on ligation transitions are represented by reusable molecules and the input, coded as a molecule, can be introduced at once.…”
Section: More Advanced Techniques Of Computing On Moleculesmentioning
confidence: 99%