DNA computing: Arrival of biological mathematics
From MaRDI portal
Publication:1361168
DOI10.1007/BF03024425zbMATH Open0942.68562OpenAlexW1503767004WikidataQ113906589 ScholiaQ113906589MaRDI QIDQ1361168FDOQ1361168
Authors: Lila Kari 
Publication date: 9 June 1999
Published in: The Mathematical Intelligencer (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03024425
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the computational power of DNA
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On the splicing operation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Contextual insertions/deletions and computability
- DNA computing based on splicing: The existence of universal computers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Getting started in mathematical biology.
- On the power of the splicing operation1
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (22)
- Approximate reasoning on a DNA‐chip
- Parsimonious computational completeness
- Insertion-deletion systems with substitutions. I
- Insertion-deletion systems with substitutions. I
- Using DNA to solve the bounded Post correspondence problem
- Small universal devices
- Insertion-deletion with substitutions. II: About the role of one-sided context
- Coding properties of DNA languages.
- Adding matrix control: insertion-deletion systems with substitutions. III
- On the generative capacity of matrix insertion-deletion systems of small sum-norm
- Splicing representations of stricly locally testable languages
- Reasoning continuously: a formal construction of continuous proofs
- DNA algorithms for fractal construction—an application of theSInsDelPsystem
- Efficient DNA sticker algorithms for NP-complete graph problems
- Splicing in abstract families of languages
- Possibilities of constructing two dimensional pictures in DNA computing: Part I
- Transposition based contextual insertion on linear DNA strands with deletion precedence
- Possibilities of constructing two dimensional pictures in DNA computing: Part II
- Universality in Molecular and Cellular Computing
- Bioinformatics: organisms from Venus, technology from Jupiter, algorithms from Mars
- Some properties of involution binary relations
- Unconventional construction of DNA codes: group homomorphism
This page was built for publication: DNA computing: Arrival of biological mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361168)
