On the Power of Circular Splicing Systems and DNA Computability

On the Power of Circular Splicing Systems and DNA Computability (1997)

Cached

Download Links

by Takashi Yokomori , Satoshi Kobayashi , Claudio Ferretti

Venue:	Proc. of IEEE Intern. Conf. on Evol. Comput. (ICEC'97
Citations:	19 - 4 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	On the Power of Circular Splicing Systems and DNA Computability	user correction - Legacy Corrections
AUTHOR NAME	Takashi Yokomori	SVM HeaderParse 0.1
AUTHOR AFFIL	Dept. of Computer Science and Information Mathematics; University of Electro-Communications	SVM HeaderParse 0.2
AUTHOR ADDR	1-5-1 Chofugaoka, Chofu, Tokyo 182, JAPAN	SVM HeaderParse 0.1
AUTHOR NAME	Satoshi Kobayashi	SVM HeaderParse 0.1
AUTHOR AFFIL	Dept. of Computer Science and Information Mathematics; University of Electro-Communications	SVM HeaderParse 0.2
AUTHOR ADDR	1-5-1 Chofugaoka, Chofu, Tokyo 182, JAPAN	SVM HeaderParse 0.1
AUTHOR NAME	Claudio Ferretti	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; University of Milano	SVM HeaderParse 0.2
AUTHOR ADDR	via Comelico 39, 20135 Milano, ITALY	SVM HeaderParse 0.1
ABSTRACT	From a biological motivation of interactions between linear and circular DNA sequences, we propose a new type of splicing models called circular H systems and show that they have the same computational power as Turing machines. It is also shown that there effectively exists a universal circular H system which can simulate any circular H system with the same terminal alphabet, which strongly suggests a feasible design for a DNA computer based on circular splicing. 1 Introduction Since Adleman's breath-taking paper on molecular (DNA) computing ([1]), there have already been quite a few papers on this challenging topic : [10] shows how to solve NP-complete problems using DNA, while [3] discusses a design method for simulating a Turing machine by molecular biological techniques and shows how to compute PSPACE, and [4]) gives a methodology for breaking the DES using techniques in genetic engineering. In response to the rapid stream of experimental research on this new computation paradigm...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE	Proc. of IEEE Intern. Conf. on Evol. Comput. (ICEC'97	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	219--224	INFERENCE
CITATIONS	19 found	ParsCit 1.0