Sciweavers

7289 search results - page 1252 / 1458
» A Dependent Set Theory
Sort
View
AI
2010
Springer
13 years 8 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
BMCBI
2010
105views more  BMCBI 2010»
13 years 8 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
83views more  BMCBI 2010»
13 years 8 months ago
Trees on networks: resolving statistical patterns of phylogenetic similarities among interacting proteins
Background: Phylogenies capture the evolutionary ancestry linking extant species. Correlations and similarities among a set of species are mediated by and need to be understood in...
William P. Kelly, Michael P. H. Stumpf
AI
2006
Springer
13 years 8 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
BMCBI
2006
127views more  BMCBI 2006»
13 years 8 months ago
On the attenuation and amplification of molecular noise in genetic regulatory networks
Background: Noise has many important roles in cellular genetic regulatory functions at the nanomolar scale. At present, no good theory exists for identifying all possible mechanis...
Bor-Sen Chen, Yu-Chao Wang
« Prev « First page 1252 / 1458 Last » Next »