Solutions to Computational Problems Through Gene Assembly

A4 Konferenspublikationer


Interna författare/redaktörer


Publikationens författare: Alhazov A, Petre I, Rogojin V
Redaktörer: Max Garzon HY
Förläggare: Springer Berlin
Publiceringsår: 2008
Förläggare: Springer
Moderpublikationens namn: DNA Computing, 13th International Meeting on DNA Computing
Seriens namn: Lecture Notes in Computer Science
Volym: 4848
Artikelns första sida, sidnummer: 36
Artikelns sista sida, sidnummer: 45


Abstrakt

Gene assembly in ciliates is an impressive computational process. Ciliates have a unique way of storing their genetic information in two fundamentally different forms within their two types of nuclei. Micronuclear genes are broken into blocks (called MDSs), with MDSs shuffled and separated by non-coding material; some of the MDSs may even be inverted. During gene assembly, all MDSs are sorted in the correct order to yield the transcription-able macronuclear gene. Based on the intramolecular model for gene assembly, we prove in this paper that gene assembly may be used in principle to solve computational problems. We prove that any given instance of the hamiltonian path problem may be encoded in a suitable way in the form of an "artificial" gene so that gene assembly is successful on that gene-like pattern if and only if the given problem has an affirmative answer.

Senast uppdaterad 2019-17-10 vid 02:44