1793 search results - page 171 / 359 » On the Design of Codes for DNA Computing |
228
click to vote
PPPJ
2009
ACM
15 years 11 months ago
2009
ACM
The usage of cellular phones, PDAs, and other mobile devices has increased dramatically over the past ten years. Java is targeted to be one of the most popular execution environme...
248
click to vote
RECOMB
2001
Springer
16 years 7 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
180
click to vote
BMCBI
2006
15 years 7 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
179
click to vote
BMCBI
2006
15 years 7 months ago
2006
Background: Recent, rapid growth in the quantity of available genomic data has generated many protein sequences that are not yet biochemically classified. Thus, the prediction of ...
235
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: During the most recent decade many Bayesian statistical models and software for answering questions related to the genetic structure underlying population samples have...