Sciweavers

621 search results - page 16 / 125
» DNA Computing
Sort
View
CPM
2007
Springer
222views Combinatorics» more  CPM 2007»
14 years 1 months ago
Computing Exact p-Value for Structured Motif
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
Jing Zhang, Xi Chen, Ming Li
RECOMB
2005
Springer
14 years 8 months ago
Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis
Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan...
RECOMB
2003
Springer
14 years 8 months ago
Engineering a scalable placement heuristic for DNA probe arrays
Andrew B. Kahng, Ion I. Mandoiu, Pavel A. Pevzner,...
DNA
2004
Springer
168views Bioinformatics» more  DNA 2004»
14 years 1 months ago
Biomolecular Implementation of Computing Devices with Unbounded Memory
We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down...
Matteo Cavaliere, Natasa Jonoska, Sivan Yogev, Ron...
DNA
2008
Springer
13 years 9 months ago
A Simple DNA Gate Motif for Synthesizing Large-Scale Circuits
The prospects of programming molecular systems to perform complex autonomous tasks has motivated research into the design of synthetic biochemical circuits. Of particular interest ...
Lulu Qian, Erik Winfree