Graph splicing systems

DOI10.1016/J.DAM.2005.12.005MaRDI QIDQ2495908zbMATH OpenOpenAlexFDO

Authors Rahul Santhanam, Kamala Krithivasan

Publication date 30 June 2006

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.12.005

zbMATH Keywords

computational completenessconstrained splicing systemsextended graph splicing systems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1539546
• Splicing systems with targets are computationally universal
• scientific article; zbMATH DE number 1836439
• scientific article; zbMATH DE number 1189124
• Multiple splicing systems and the universal computability

Cites work

• DNA computing based on splicing: The existence of universal computers
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• scientific article; zbMATH DE number 992003 (Why is no real title available?)
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• On the computational power of DNA

Cited in

(9)

• Aparallel digraphs and splicing machines
• Lictedg and Litactedg graph representation of self cross-over graph systems in graph splicing languages
• scientific article; zbMATH DE number 1286204 (Why is no real title available?)
• scientific article; zbMATH DE number 1539546 (Why is no real title available?)
• scientific article; zbMATH DE number 1738640 (Why is no real title available?)
• scientific article; zbMATH DE number 2087037 (Why is no real title available?)
• Graph Self-Replication System
• Graph splicing with three matrix semigraph representation
• Matrix splicing system

This page was built for publication: Graph splicing systems

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