Sciweavers

1993 search results - page 360 / 399
» Analysis of the Effectiveness of G3PARM Algorithm
Sort
View
BMCBI
2010
89views more  BMCBI 2010»
14 years 9 months ago
Spatial normalization improves the quality of genotype calling for Affymetrix SNP 6.0 arrays
Background: Microarray measurements are susceptible to a variety of experimental artifacts, some of which give rise to systematic biases that are spatially dependent in a unique w...
High-Seng Chai, Terry M. Therneau, Kent R. Bailey,...
BMCBI
2007
113views more  BMCBI 2007»
14 years 9 months ago
In silico panning for a non-competitive peptide inhibitor
Background: Peptide ligands have tremendous therapeutic potential as efficacious drugs. Currently, more than 40 peptides are available in the market for a drug. However, since cos...
Yukiko Yagi, Kotaro Terada, Takahisa Noma, Kazunor...
JAIR
2000
123views more  JAIR 2000»
14 years 9 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
BPM
2006
Springer
166views Business» more  BPM 2006»
15 years 1 months ago
Process Mining by Measuring Process Block Similarity
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Joonsoo Bae, James Caverlee, Ling Liu, Hua Yan
CIKM
2006
Springer
15 years 1 months ago
On the structural properties of massive telecom call graphs: findings and implications
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, D...