TY - GEN
T1 - Development of a bacteria computer
T2 - 6th Conference on Computability in Europe, CiE 2010
AU - Sakakibara, Yasubumi
PY - 2010/7/29
Y1 - 2010/7/29
N2 - We overview a series of our research on implementing finite automata in vitro and in vivo in the framework of DNA-based computing [1,2]. First, we employ the length-encoding technique proposed and presented in [3,4] to implement finite automata in test tube. In the length-encoding method, the states and state transition functions of a target finite automaton are effectively encoded into DNA sequences, a computation (accepting) process of finite automata is accomplished by self-assembly of encoded complementary DNA strands, and the acceptance of an input string is determined by the detection of a completely hybridized double-strand DNA. Second, we report our intensive in vitro experiments in which we have implemented and executed several finite-state automata in test tube. We have designed and developed practical laboratory protocols which combine several in vitro operations such as annealing, ligation, PCR, and streptavidin-biotin bonding to execute in vitro finite automata based on the length-encoding technique. We have carried laboratory experiments on various finite automata with 2 up to 6 states for several input strings. Third, we present a novel framework to develop a programmable and autonomous in vivo computer using Escherichia coli (E. coli), and implement in vivo finite-state automata based on the framework by employing the protein-synthesis mechanism of E. coli. We show some successful experiments to run an in vivo finite-state automaton on E. coli.
AB - We overview a series of our research on implementing finite automata in vitro and in vivo in the framework of DNA-based computing [1,2]. First, we employ the length-encoding technique proposed and presented in [3,4] to implement finite automata in test tube. In the length-encoding method, the states and state transition functions of a target finite automaton are effectively encoded into DNA sequences, a computation (accepting) process of finite automata is accomplished by self-assembly of encoded complementary DNA strands, and the acceptance of an input string is determined by the detection of a completely hybridized double-strand DNA. Second, we report our intensive in vitro experiments in which we have implemented and executed several finite-state automata in test tube. We have designed and developed practical laboratory protocols which combine several in vitro operations such as annealing, ligation, PCR, and streptavidin-biotin bonding to execute in vitro finite automata based on the length-encoding technique. We have carried laboratory experiments on various finite automata with 2 up to 6 states for several input strings. Third, we present a novel framework to develop a programmable and autonomous in vivo computer using Escherichia coli (E. coli), and implement in vivo finite-state automata based on the framework by employing the protein-synthesis mechanism of E. coli. We show some successful experiments to run an in vivo finite-state automaton on E. coli.
UR - http://www.scopus.com/inward/record.url?scp=77954883108&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77954883108&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-13962-8_40
DO - 10.1007/978-3-642-13962-8_40
M3 - Conference contribution
AN - SCOPUS:77954883108
SN - 3642139612
SN - 9783642139611
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 362
EP - 371
BT - Programs, Proofs, Processes - 6th Conference on Computability in Europe, CiE 2010, Proceedings
Y2 - 30 June 2010 through 4 July 2010
ER -