Sciweavers

88 search results - page 3 / 18
» Performance Analysis of a Family of WHT Algorithms
Sort
View
BMCBI
2010
136views more  BMCBI 2010»
13 years 7 months ago
SCPS: a fast implementation of a spectral method for detecting protein families on a genome-wide scale
Background: An important problem in genomics is the automatic inference of groups of homologous proteins from pairwise sequence similarities. Several approaches have been proposed...
Tamás Nepusz, Rajkumar Sasidharan, Alberto ...
TCBB
2008
126views more  TCBB 2008»
13 years 7 months ago
Graphical Models of Residue Coupling in Protein Families
Abstract-- Many statistical measures and algorithmic techniques have been proposed for studying residue coupling in protein families. Generally speaking, two residue positions are ...
John Thomas, Naren Ramakrishnan, Chris Bailey-Kell...
JAR
2000
123views more  JAR 2000»
13 years 7 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
PPOPP
2005
ACM
14 years 28 days ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
CGO
2011
IEEE
12 years 11 months ago
Flow-sensitive pointer analysis for millions of lines of code
—Many program analyses benefit, both in precision and performance, from precise pointer analysis. An important dimension of pointer analysis precision is flow-sensitivity, whic...
Ben Hardekopf, Calvin Lin