Sciweavers

202 search results - page 18 / 41
» A Sticker-Based Model for DNA Computation
Sort
View
CANDC
2000
ACM
13 years 7 months ago
Sequence Complexity for Biological Sequence Analysis
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
Lloyd Allison, Linda Stern, Timothy Edgoose, Trevo...
RECOMB
2005
Springer
14 years 8 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao
BMCBI
2008
130views more  BMCBI 2008»
13 years 7 months ago
Function approximation approach to the inference of reduced NGnet models of genetic networks
Background: The inference of a genetic network is a problem in which mutual interactions among genes are deduced using time-series of gene expression patterns. While a number of m...
Shuhei Kimura, Katsuki Sonoda, Soichiro Yamane, Hi...
DNA
2007
Springer
127views Bioinformatics» more  DNA 2007»
14 years 1 months ago
Discrete Simulations of Biochemical Dynamics
Abstract. Metabolic P systems, shortly MP systems, are a special class of P systems, introduced for expressing biological metabolism. Their dynamics are computed by metabolic algor...
Vincenzo Manca
DNA
2004
Springer
14 years 1 months ago
DNA-Based Computation Times
Abstract. Speed of computation and power consumption are the two main parameters of conventional computing devices implemented in microelectronic circuits. As performance of such d...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Petar...