Sciweavers

15073 search results - page 2808 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
UAI
2008
15 years 3 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
ICGA
1997
122views Optimization» more  ICGA 1997»
15 years 3 months ago
A Comparison of Global and Local Search Methods in Drug Docking
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...
Christopher D. Rosin, R. Scott Halliday, William E...
BMCBI
2010
105views more  BMCBI 2010»
15 years 2 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
Tiejun Cheng, Zhihai Liu, Renxiao Wang
BMCBI
2010
189views more  BMCBI 2010»
15 years 2 months ago
High quality protein sequence alignment by combining structural profile prediction and profile alignment using SABERTOOTH
Background: Protein alignments are an essential tool for many bioinformatics analyses. While sequence alignments are accurate for proteins of high sequence similarity, they become...
Florian Teichert, Jonas Minning, Ugo Bastolla, Mar...
BMCBI
2010
104views more  BMCBI 2010»
15 years 2 months ago
Bidirectional best hit r-window gene clusters
Background: Conserved gene clusters are groups of genes that are located close to one another in the genomes of several species. They tend to code for proteins that have a functio...
Melvin Zhang, Hon Wai Leong
« Prev « First page 2808 / 3015 Last » Next »