Sciweavers

1522 search results - page 167 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
15 years 2 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
BMCBI
2007
158views more  BMCBI 2007»
14 years 10 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
BMCBI
2006
98views more  BMCBI 2006»
14 years 10 months ago
JLIN: A java based linkage disequilibrium plotter
Background: A great deal of effort and expense are being expended internationally in attempts to detect genetic polymorphisms contributing to susceptibility to complex human disea...
Kim W. Carter, Pamela A. McCaskie, Lyle J. Palmer
CORR
2011
Springer
158views Education» more  CORR 2011»
14 years 5 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer
IEEEINTERACT
2002
IEEE
15 years 3 months ago
Code Cache Management Schemes for Dynamic Optimizers
A dynamic optimizer is a software-based system that performs code modifications at runtime, and several such systems have been proposed over the past several years. These systems ...
Kim M. Hazelwood, Michael D. Smith