Strand design for biomolecular computation.
From MaRDI portal
Publication:1853477
DOI10.1016/S0304-3975(02)00135-4zbMath1061.68051DBLPjournals/tcs/BrennemanC02OpenAlexW1970529854WikidataQ56750198 ScholiaQ56750198MaRDI QIDQ1853477
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)00135-4
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biochemistry, molecular biology (92C40)
Related Items (11)
Solving the minimum bisection problem using a biologically inspired computational model ⋮ A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing ⋮ Solving the maximum weighted clique problem based on parallel biological computing model ⋮ Deterministic polynomial-time algorithms for designing short DNA words ⋮ Design methods for 3D wireframe DNA nanostructures ⋮ Molecular solution to the optimal linear arrangement problem based on DNA computation ⋮ Dipole codes attractively encode glue functions ⋮ Linear constructions for DNA codes ⋮ On codeword design in metric DNA spaces ⋮ Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences ⋮ A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem
Uses Software
Cites Work
- Two new bounds on the size of binary codes with a minimum distance of three
- A new table of constant weight codes
- Comma-Free Codes
- The uniqueness of the Best code
- On the construction of comma-free codes
- Some new constant weight codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strand design for biomolecular computation.
