Pages that link to "Item:Q2476101"
From MaRDI portal
The following pages link to Computing by polymerase chain reaction (Q2476101):
Displaying 15 items.
- Further remarks on DNA overlap assembly (Q515580) (← links)
- Algorithmic applications of XPCR (Q553918) (← links)
- The principles of informational genomics (Q1682867) (← links)
- Mathematically modeling PCR: an asymptotic approximation with potential for optimization (Q1942357) (← links)
- From biopolymer duplication to membrane duplication and beyond (Q1983038) (← links)
- Nondeterministic state complexity of site-directed deletion (Q2164749) (← links)
- Mathematical models of diffusion-constrained polymerase chain reactions: basis of high-throughput nucleic acid assays and simple self-organizing systems (Q2187605) (← links)
- Explaining DNA structure (Q2243590) (← links)
- On the overlap assembly of strings and languages (Q2311303) (← links)
- Comparison of different methods to analyze a DNA computing library using the polymerase chain reaction (Q2629952) (← links)
- Decoding Genomic Information (Q3295748) (← links)
- DNA Computing (Q5494346) (← links)
- State Complexity of Overlap Assembly (Q5859665) (← links)
- Conjugate word blending: formal model and experimental implementation by XPCR (Q6095510) (← links)
- The nondeterministic state complexity of the site-directed deletion language operation (Q6175008) (← links)