We will consider here the splicing systems, generative devicesinspired by cut and paste phenomena on DNA molecules under the actionof restriction and ligase enzymes. A DNA strand can be viewed as a stringover a four letter alphabet (the four deoxyribonucleotides), therefore wecan model DNA computation within the framework of formal languagetheory. In spite of a vast literature on splicing systems, briefly surveyedhere, a few problems related to their computational power are still open.We intend to evidence how classical techniques and concepts in automatatheory are a legitimate tool for investigating some of these problems.
Bonizzoni, P., De Felice, C., Mauri, G., Zizza, R. (2003). Decision problems for linear and circular splicing systems. In Developments in Language Theory 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers (pp.78-92). Springer [10.1007/3-540-45005-X_7].
Decision problems for linear and circular splicing systems
BONIZZONI, PAOLA;MAURI, GIANCARLO;
2003
Abstract
We will consider here the splicing systems, generative devicesinspired by cut and paste phenomena on DNA molecules under the actionof restriction and ligase enzymes. A DNA strand can be viewed as a stringover a four letter alphabet (the four deoxyribonucleotides), therefore wecan model DNA computation within the framework of formal languagetheory. In spite of a vast literature on splicing systems, briefly surveyedhere, a few problems related to their computational power are still open.We intend to evidence how classical techniques and concepts in automatatheory are a legitimate tool for investigating some of these problems.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
