1793 search results - page 14 / 359 » On the Design of Codes for DNA Computing |
106
click to vote
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...
DNA
2004
Springer
15 years 5 months ago
2004
Springer
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA com...
DNA
2003
Springer
15 years 5 months ago
2003
Springer
Affinity separation with magnetic beads is an important and widely used technique for DNA computing. We have designed and implemented an experimental lab-on-a-chip module for affin...
100
click to vote
BMCBI
2008
14 years 12 months ago
2008
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
APBC
2004
15 years 1 months ago
2004
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...