Anzeige
Erschienen in:
01.09.2008
Equivalence in template-guided recombination
Erschienen in: Natural Computing | Ausgabe 3/2008
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Template-guided recombination (TGR) is a formal model for the DNA rearrangement which occurs in certain ciliates. In this paper, the equivalence problem for TGR is considered: given two sets of templates, is their action is the same for all operands? This question is motivated by molecular computation, as we view equivalence in TGR as a method for discerning whether modifications to the functioning of a ciliate via the set of templates has any effect on the rearrangement it defines. This motivation is also suggested by recent experiments into the role of RNA in the rearrangement of ciliate DNA. We give a language-theoretic characterization of equivalence which leads to decidability results for common language classes. In particular, we show a positive answer for regular sets of templates. For context-free sets of templates, the answer is negative. The same language-theoretic characterization also applies to intra-molecular TGR. The problem for iterated TGR remains open.