Sciweavers

2107 search results - page 367 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
BMCBI
2008
211views more  BMCBI 2008»
13 years 9 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
JCC
2011
87views more  JCC 2011»
13 years 3 months ago
Determining equilibrium constants for dimerization reactions from molecular dynamics simulations
Abstract: With today’s available computer power, free energy calculations from equilibrium molecular dynamics simulations “via counting” become feasible for an increasing num...
Djurre H. De Jong, Lars V. Schäfer, Alex H. D...
IMC
2006
ACM
14 years 2 months ago
Quantifying path exploration in the internet
A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of prot...
Ricardo V. Oliveira, Beichuan Zhang, Dan Pei, Rafi...
BMCBI
2008
118views more  BMCBI 2008»
13 years 9 months ago
DOVIS: an implementation for high-throughput virtual screening using AutoDock
Background: Molecular-docking-based virtual screening is an important tool in drug discovery that is used to significantly reduce the number of possible chemical compounds to be i...
Shuxing Zhang, Kamal Kumar, Xiaohui Jiang, Anders ...
MOBIHOC
2008
ACM
14 years 8 months ago
Dynamic packet fragmentation for wireless channels with failures
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
Predrag R. Jelenkovic, Jian Tan