Sciweavers

156 search results - page 2 / 32
» In Search of Optimal Codes for DNA Computing
Sort
View
AI
2003
Springer
14 years 4 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
BMCBI
2002
120views more  BMCBI 2002»
13 years 10 months ago
tacg - a grep for DNA
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
Harry Mangalam
DBSEC
2010
129views Database» more  DBSEC 2010»
14 years 9 days ago
Secure Outsourcing of DNA Searching via Finite Automata
This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
Marina Blanton, Mehrdad Aliasgari
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
14 years 4 months ago
Evolutionary computation and the c-value paradox
The C-value Paradox is the name given in biology to the wide variance in and often very large amount of DNA in eukaryotic genomes and the poor correlation between DNA length and p...
Sean Luke
CSB
2003
IEEE
113views Bioinformatics» more  CSB 2003»
14 years 4 months ago
An Optimal DNA Segmentation Based on the MDL Principle
: The biological world is highly stochastic and inhomogeneous in its behaviour. There are regions in DNA with high concentration of G or C bases; stretches of sequences with an abu...
Wojciech Szpankowski, Wenhui Ren, Lukasz Szpankows...