Computational power of intramolecular gene assembly

DOI10.1142/S0129054107005169zbMATH Open1202.68229MaRDI QIDQ3065620FDOQ3065620

Authors: Tseren-Onolt Ishdorj, Ion Petre, Vladimir Rogojin 

Publication date: 6 January 2011

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

Recommendations

• scientific article; zbMATH DE number 1568810
• scientific article; zbMATH DE number 1836434
• Computing Through Gene Assembly
• scientific article; zbMATH DE number 1948482
• scientific article; zbMATH DE number 2156287

zbMATH Keywords

Turing universalitygene assembly in ciliates

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Contextual insertions/deletions and computability

Cited In (10)

• Title not available (Why is that?)
• Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons
• Computational efficiency of intermolecular gene assembly
• Theoretical and computational properties of transpositions
• GENE ASSEMBLY MODELS AND BOOLEAN CIRCUITS
• Title not available (Why is that?)
• Combinatorial Pattern Matching
• Solving a PSPACE-complete problem by gene assembly
• Computing Through Gene Assembly
• Solutions to computational problems through gene assembly

This page was built for publication: Computational power of intramolecular gene assembly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065620)