Sciweavers

242 search results - page 13 / 49
» dna 2008
Sort
View
TCS
2008
13 years 9 months ago
On the weight of universal insertion grammars
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...
Lila Kari, Petr Sosík
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
13 years 11 months ago
Fast Structured Motif Search in DNA Sequences
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
Mihail Halachev, Nematollaah Shiri
ALMOB
2008
95views more  ALMOB 2008»
13 years 9 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
DATE
2008
IEEE
120views Hardware» more  DATE 2008»
14 years 4 months ago
Error Detection/Correction in DNA Algorithmic Self-Assembly
A novel error detection/correction technique for algorithmic self-assembly is presented in this paper. Through the use of a tile set that allows errors to be isolated and propagat...
Stephen Frechette, Fabrizio Lombardi
DFT
2008
IEEE
107views VLSI» more  DFT 2008»
14 years 4 months ago
Checkpointing of Rectilinear Growth in DNA Self-Assembly
Error detection/correction techniques have been advocated for algorithmic self-assembly. Under rectilinear growth, it requires only two additional tiles, generally referred to as ...
Stephen Frechette, Yong-Bin Kim, Fabrizio Lombardi