497 search results - page 5 / 100 » DNA Computing Based on Splicing: Universality Results |
JUCS
2006
15 years 5 months ago
2006
: We cast a new look on time-varying distributed H systems. In their original definition, where only new strings are passed to the next component, this language definition in itsel...
156
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Exonic splicing enhancers (ESEs) activate nearby splice sites and promote the inclusion (vs. exclusion) of exons in which they reside, while being a binding site for S...
164
click to vote
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
Our group has recently developed a compact, universal protein binding microarray (PBM) that can be used to determine the binding preferences of transcription factors (TFs) [1]. Thi...
153
click to vote
TCS
2008
15 years 5 months ago
2008
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
154
click to vote
DNA
2007
Springer
15 years 9 months ago
2007
Springer
Reliable DNA computing requires a large pool of oligonucleotides that do not produce cross-hybridize. In this paper, we present a transformed algorithm to calculate the maximum wei...