Sciweavers

321 search results - page 8 / 65
» Design of DNA origami
Sort
View
AI
2003
Springer
13 years 12 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
DNA
2005
Springer
14 years 7 days ago
Two Proteins for the Price of One: The Design of Maximally Compressed Coding Sequences
Abstract. The emerging field of synthetic biology moves beyond conventional genetic manipulation to construct novel life forms which do not originate in nature. We explore the pro...
Bei Wang, Dimitris Papamichail, Steffen Mueller, S...
BMCBI
2006
116views more  BMCBI 2006»
13 years 6 months ago
MICA: desktop software for comprehensive searching of DNA databases
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
William A. Stokes, Benjamin S. Glick
IPPS
2000
IEEE
13 years 11 months ago
A Surface-Based DNA Algorithm for the Expansion of Symbolic Determinants
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
Zhiquan Frank Qiu, Mi Lu
ISMB
2000
13 years 8 months ago
Computation and Visualization of Degenerate Repeats in Complete Genomes
The repetitive structure of genomic DNA holds many secrets to be discovered. A systematic study of repetitive DNA on a genomic or inter-genomic scale requires extensive algorithmi...
Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher...