COMPUTATIONAL POWER OF INTRAMOLECULAR GENE ASSEMBLY

DOI10.1142/S0129054107005169zbMath1202.68229MaRDI QIDQ3065620

Tseren-Onolt Ishdorj, Ion Petre, Vladimir Rogozhin

Publication date: 6 January 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

Turing universalitygene assembly in ciliates

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

GENE ASSEMBLY MODELS AND BOOLEAN CIRCUITS ⋮ Solutions to computational problems through gene assembly ⋮ Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons

Cites Work

• Unnamed Item
• Contextual insertions/deletions and computability
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors

This page was built for publication: COMPUTATIONAL POWER OF INTRAMOLECULAR GENE ASSEMBLY