Sciweavers

2036 search results - page 404 / 408
» From Sampling to Model Counting
Sort
View
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 10 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
ALMOB
2006
155views more  ALMOB 2006»
13 years 9 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
BMCBI
2006
120views more  BMCBI 2006»
13 years 9 months ago
An improved distance measure between the expression profiles linking co-expression and co-regulation in mouse
Background: Many statistical algorithms combine microarray expression data and genome sequence data to identify transcription factor binding motifs in the low eukaryotic genomes. ...
Ryung S. Kim, Hongkai Ji, Wing Hung Wong
BMCBI
2006
99views more  BMCBI 2006»
13 years 9 months ago
A proposed metric for assessing the measurement quality of individual microarrays
Background: High-density microarray technology is increasingly applied to study gene expression levels on a large scale. Microarray experiments rely on several critical steps that...
Kyoungmi Kim, Grier P. Page, T. Mark Beasley, Step...
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 9 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...