Pages that link to "Item:Q1125440"
From MaRDI portal
The following pages link to Parallel biomolecular computation: Models and simulations (Q1125440):
Displaying 15 items.
- Graph-theoretic formalization of hybridization in DNA sticker complexes (Q256713) (← links)
- A parallel approach to direct analog-to-residue conversion (Q294665) (← links)
- Parallel DNA arithmetic operation based on \(n\)-moduli set (Q1026280) (← links)
- Molecular computing, bounded nondeterminism, and efficient recursion (Q1125447) (← links)
- A comparison of resource-bounded molecular computation models (Q1293873) (← links)
- How efficiently can room at the bottom be traded away for speed at the top? (Q1426835) (← links)
- The computational power of Benenson automata (Q2575082) (← links)
- PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES (Q3022012) (← links)
- Approximate reasoning on a DNA‐chip (Q3059787) (← links)
- Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes (Q3092332) (← links)
- PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA (Q3444840) (← links)
- Mechanisms Inducing Parallel Computation in a Model of <i>Physarum polycephalum</i> Transport Networks (Q4598895) (← links)
- PROCEDURES FOR MULTIPLE INPUT FUNCTIONS WITH DNA MOLECULES (Q4675878) (← links)
- Parallelized Parameter Estimation of Biological Pathway Models (Q5376900) (← links)
- DNAQL: a query language for DNA sticker complexes (Q6095484) (← links)