Topics in the theory of DNA computing.

DOI10.1016/S0304-3975(02)00134-2MaRDI QIDQ1853473zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Martyn Amos, Arto Salomaa, Gheorghe Păun, Grzegorz Rozenberg

Publication date 21 January 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(02)00134-2

zbMATH Keywords

DNA computingTuring universalityBoolean circuitsCryptographyDNA moleculesRecursively enumerable languagesMolecular computingSplicing systemsBiomolecular tool box

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites work

• scientific article; zbMATH DE number 981617 (Why is no real title available?)
• scientific article; zbMATH DE number 992003 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 1189114 (Why is no real title available?)
• scientific article; zbMATH DE number 1189119 (Why is no real title available?)
• scientific article; zbMATH DE number 3767067 (Why is no real title available?)
• scientific article; zbMATH DE number 42045 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• scientific article; zbMATH DE number 1241360 (Why is no real title available?)
• scientific article; zbMATH DE number 1286204 (Why is no real title available?)
• scientific article; zbMATH DE number 1343486 (Why is no real title available?)
• scientific article; zbMATH DE number 1086502 (Why is no real title available?)
• scientific article; zbMATH DE number 2087036 (Why is no real title available?)
• scientific article; zbMATH DE number 1568809 (Why is no real title available?)
• scientific article; zbMATH DE number 745858 (Why is no real title available?)
• scientific article; zbMATH DE number 1836440 (Why is no real title available?)
• scientific article; zbMATH DE number 854547 (Why is no real title available?)
• scientific article; zbMATH DE number 907948 (Why is no real title available?)
• scientific article; zbMATH DE number 907955 (Why is no real title available?)
• scientific article; zbMATH DE number 1405641 (Why is no real title available?)
• scientific article; zbMATH DE number 3313249 (Why is no real title available?)
• A guide to membrane computing.
• Aspects of Molecular Computing
• Computing by splicing
• Computing with membranes
• DNA computing based on splicing: Universality results
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• Forbidding--enforcing systems
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Nine test tubes generate any RE language
• Regularity of splicing languages
• Sequences of languages in forbidding-enforcing families
• Simulating Boolean circuits on a DNA computer
• Splicing in abstract families of languages
• Splicing semigroups of dominoes and DNA
• TIME-VARYING DISTRIBUTED H SYSTEMS OF DEGREE 1 GENERATE ALL RECURSIVELY ENUMERABLE LANGUAGES

Cited in

(10)

• scientific article; zbMATH DE number 2016091 (Why is no real title available?)
• scientific article; zbMATH DE number 1405641 (Why is no real title available?)
• DNA-based logic
• A CONSTANT TIME ALGORITHM FOR DNA ADD
• Circular suggestions for DNA computing
• THE INFERENCE BASED ON MOLECULAR COMPUTING
• A genetic algorithm using triplet nucleotide encoding and DNA reproduction operations for unconstrained optimization problems
• scientific article; zbMATH DE number 2013808 (Why is no real title available?)
• scientific article; zbMATH DE number 1529360 (Why is no real title available?)
• scientific article; zbMATH DE number 1738643 (Why is no real title available?)

This page was built for publication: Topics in the theory of DNA computing.

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