Solutions to Computational Problems Through Gene Assembly

A4 Conference proceedings


Internal Authors/Editors


Publication Details

List of Authors: Alhazov A, Petre I, Rogojin V
Editors: Max Garzon HY
Publisher: Springer Berlin
Publication year: 2008
Publisher: Springer
Book title: DNA Computing, 13th International Meeting on DNA Computing
Title of series: Lecture Notes in Computer Science
Volume number: 4848
Start page: 36
End page: 45


Abstract

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.

Last updated on 2020-17-01 at 03:49