Computing by polymerase chain reaction
From MaRDI portal
Publication:2476101
Recommendations
Cites work
- An algorithmic analysis of DNA structure
- DNA Computing
- DNA Computing
- DNA Computing
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 1738639 (Why is no real title available?)
- scientific article; zbMATH DE number 2182435 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 2087017 (Why is no real title available?)
Cited in
(18)- The principles of informational genomics
- Mathematically modeling PCR: an asymptotic approximation with potential for optimization
- From biopolymer duplication to membrane duplication and beyond
- Nondeterministic state complexity of site-directed deletion
- Mathematical models of diffusion-constrained polymerase chain reactions: basis of high-throughput nucleic acid assays and simple self-organizing systems
- Explaining DNA structure
- On the overlap assembly of strings and languages
- Comparison of different methods to analyze a DNA computing library using the polymerase chain reaction
- Decoding genomic information
- DNA Recombination by XPCR
- PCR NONADAPTIVE GROUP TESTING OF DNA LIBRARIES FOR BIOMOLECULAR COMPUTING AND TAGGANT APPLICATIONS
- scientific article; zbMATH DE number 804673 (Why is no real title available?)
- Further remarks on DNA overlap assembly
- DNA Computing
- Algorithmic applications of XPCR
- State complexity of overlap assembly
- Conjugate word blending: formal model and experimental implementation by XPCR
- The nondeterministic state complexity of the site-directed deletion language operation
This page was built for publication: Computing by polymerase chain reaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476101)