497 search results - page 49 / 100 » DNA Computing Based on Splicing: Universality Results |
196
click to vote
SIAMDM
2010
15 years 4 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
166
click to vote
CIBCB
2007
IEEE
16 years 7 days ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
184
click to vote
APGV
2004
ACM
15 years 11 months ago
2004
ACM
We describe a new computational approach to stylize the colors of an image by using a reference image. During processing, we take characteristics of human color perception into ac...
170
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Detailed information on DNA-binding transcription factors (the key players in the regulation of gene expression) and on transcriptional regulatory interactions of micr...
179
click to vote
BMCBI
2011
14 years 9 months ago
2011
Background: Using microarray and sequencing platforms, a large number of copy number variations (CNVs) have been identified in humans. In practice, because our human genome is a d...