DNA computing based on splicing: The existence of universal computers
From MaRDI portal
Publication:1277368
Recommendations
- DNA computing based on splicing: Universality results
- scientific article; zbMATH DE number 1241363
- Publication:4888094
- scientific article; zbMATH DE number 1241374
- scientific article; zbMATH DE number 1086502
- DNA splicing: Computing by observing
- DNA computing, sticker systems, and universality
- scientific article; zbMATH DE number 2145151
- scientific article; zbMATH DE number 2089955
Cited in
(36)- Splicing semigroups of dominoes and DNA
- Splicing on tree-like structures
- Sticker systems
- DNA computing: Arrival of biological mathematics
- DNA computing based on splicing: Universality results
- On the universality of Post and splicing systems
- Using DNA to solve the bounded Post correspondence problem
- Aparallel digraphs and splicing machines
- Cut, paste and filter.
- Derivation languages and descriptional complexity measures of restricted flat splicing systems
- Accepting splicing systems with permitting and forbidding words
- Graph splicing systems
- P systems with proteins on membranes: a survey
- Splicing systems: accepting versus generating
- A brief tour of theoretical tile self-assembly
- scientific article; zbMATH DE number 1189119 (Why is no real title available?)
- Algorithms for Splicing Systems
- scientific article; zbMATH DE number 1241363 (Why is no real title available?)
- scientific article; zbMATH DE number 1735661 (Why is no real title available?)
- scientific article; zbMATH DE number 1086502 (Why is no real title available?)
- scientific article; zbMATH DE number 1948488 (Why is no real title available?)
- scientific article; zbMATH DE number 2087029 (Why is no real title available?)
- scientific article; zbMATH DE number 907955 (Why is no real title available?)
- scientific article; zbMATH DE number 908772 (Why is no real title available?)
- scientific article; zbMATH DE number 935111 (Why is no real title available?)
- Insertion-deletion systems with substitutions. I
- Non-preserving accepting splicing systems
- Simulating ADD operation by DNA finite splicing systems
- DNA Computing
- Computational power of weighted splicing systems
- Multiple splicing systems and the universal computability
- Probabilistic simple splicing systems
- Splicing systems with targets are computationally universal
- Programmed Mutagenesis is universal
- DNA splicing: Computing by observing
- Accepting splicing systems
This page was built for publication: DNA computing based on splicing: The existence of universal computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277368)