Sciweavers

4934 search results - page 322 / 987
» complexity 2008
Sort
View
ACSC
2008
IEEE
16 years 1 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
JAC
2008
15 years 8 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
BMCBI
2008
155views more  BMCBI 2008»
15 years 7 months ago
AMMOS: Automated Molecular Mechanics Optimization tool for in silico Screening
Background: Virtual or in silico ligand screening combined with other computational methods is one of the most promising methods to search for new lead compounds, thereby greatly ...
Tania Pencheva, David Lagorce, Ilza Pajeva, Bruno ...
BMCBI
2008
106views more  BMCBI 2008»
15 years 7 months ago
Identification of hot-spot residues in protein-protein interactions by computational docking
Background: The study of protein-protein interactions is becoming increasingly important for biotechnological and therapeutic reasons. We can define two major areas therein: the s...
Solène Grosdidier, Juan Fernández-Re...
BMCBI
2008
87views more  BMCBI 2008»
15 years 6 months ago
Volume-based solvation models out-perform area-based models in combined studies of wild-type and mutated protein-protein interfa
Background: Empirical binding models have previously been investigated for the energetics of protein complexation (G models) and for the influence of mutations on complexation (i....
Salim Bougouffa, Jim Warwicker