Sciweavers

65 search results - page 13 / 13
» On the Kolmogorov-Chaitin Complexity for short sequences
Sort
View
BMCBI
2004
151views more  BMCBI 2004»
13 years 10 months ago
Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
Jens Reeder, Robert Giegerich
MST
2006
149views more  MST 2006»
13 years 10 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
DNA
2008
Springer
14 years 19 days 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
BMCBI
2006
95views more  BMCBI 2006»
13 years 11 months ago
Estimate haplotype frequencies in pedigrees
Background: Haplotype analysis has gained increasing attention in the context of association studies of disease genes and drug responsivities over the last years. The potential us...
Qiangfeng Zhang, YuZhong Zhao, Guoliang Chen, Yun ...
BMCBI
2005
115views more  BMCBI 2005»
13 years 10 months ago
SUPERFICIAL - Surface mapping of proteins via structure-based peptide library design
Background: The determination of protein surfaces and the detection of binding sites are essential to our understanding of protein-protein interactions. Such binding sites can be ...
Andrean Goede, Ines S. Jaeger, Robert Preissner