Sciweavers

758 search results - page 145 / 152
» Pattern-Constrained Test Case Generation
Sort
View
BMCBI
2007
141views more  BMCBI 2007»
13 years 9 months ago
Using structural motif descriptors for sequence-based binding site prediction
Background: Many protein sequences are still poorly annotated. Functional characterization of a protein is often improved by the identification of its interaction partners. Here, ...
Andreas Henschel, Christof Winter, Wan Kyu Kim, Mi...
CCE
2004
13 years 9 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
BMCBI
2010
113views more  BMCBI 2010»
13 years 10 months ago
Improving performance of mammalian microRNA target prediction
Background: MicroRNAs (miRNAs) are single-stranded non-coding RNAs known to regulate a wide range of cellular processes by silencing the gene expression at the protein and/or mRNA...
Hui Liu, Dong Yue, Yidong Chen, Shou-Jiang Gao, Yu...
CVPR
2008
IEEE
14 years 11 months ago
Reduce, reuse & recycle: Efficiently solving multi-label MRFs
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
STACS
2010
Springer
14 years 4 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen