Sciweavers

2695 search results - page 220 / 539
» The Complexity of Forecast Testing
Sort
View
144
Voted
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 6 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
147
Voted
BMCBI
2006
169views more  BMCBI 2006»
15 years 5 months ago
Comparative analysis of haplotype association mapping algorithms
Background: Finding the genetic causes of quantitative traits is a complex and difficult task. Classical methods for mapping quantitative trail loci (QTL) in miceuse an F2 cross b...
Phillip McClurg, Mathew T. Pletcher, Tim Wiltshire...
BMCBI
2007
203views more  BMCBI 2007»
15 years 5 months ago
A Grid-based solution for management and analysis of microarrays in distributed experiments
Several systems have been presented in the last years in order to manage the complexity of large microarray experiments. Although good results have been achieved, most systems ten...
Ivan Porro, Livia Torterolo, Luca Corradi, Marco F...
149
Voted
ICDM
2009
IEEE
145views Data Mining» more  ICDM 2009»
15 years 2 months ago
Significance of Episodes Based on Minimal Windows
Discovering episodes, frequent sets of events from a sequence has been an active field in pattern mining. Traditionally, a level-wise approach is used to discover all frequent epis...
Nikolaj Tatti
172
Voted
BMCBI
2011
15 years 1 days ago
Pathway-based analysis using reduced gene subsets in genome-wide association studies
Background: Single Nucleotide Polymorphism (SNP) analysis only captures a small proportion of associated genetic variants in Genome-Wide Association Studies (GWAS) partly due to s...
Jingyuan Zhao, Simone Gupta, Mark Seielstad, Jianj...