Sciweavers

1941 search results - page 385 / 389
» On the Hardness of Approximate Reasoning
Sort
View
BMCBI
2008
242views more  BMCBI 2008»
14 years 11 months ago
New time-scale criteria for model simplification of bio-reaction systems
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
Junwon Choi, Kyung-won Yang, Tai-yong Lee, Sang Yu...
BMCBI
2008
123views more  BMCBI 2008»
14 years 11 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich
BMCBI
2007
129views more  BMCBI 2007»
14 years 11 months ago
Algebraic correction methods for computational assessment of clone overlaps in DNA fingerprint mapping
Background: The Sulston score is a well-established, though approximate metric for probabilistically evaluating postulated clone overlaps in DNA fingerprint mapping. It is known t...
Michael C. Wendl
CORR
2010
Springer
141views Education» more  CORR 2010»
14 years 11 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
CGF
2006
191views more  CGF 2006»
14 years 11 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt