Sciweavers

2004 search results - page 88 / 401
» Sampling from large graphs
Sort
View
BMCBI
2007
215views more  BMCBI 2007»
14 years 12 months ago
Learning causal networks from systems biology time course data: an effective model selection procedure for the vector autoregres
Background: Causal networks based on the vector autoregressive (VAR) process are a promising statistical tool for modeling regulatory interactions in a cell. However, learning the...
Rainer Opgen-Rhein, Korbinian Strimmer
BMCBI
2006
200views more  BMCBI 2006»
14 years 12 months ago
Comparison and evaluation of methods for generating differentially expressed gene lists from microarray data
Background: Numerous feature selection methods have been applied to the identification of differentially expressed genes in microarray data. These include simple fold change, clas...
Ian B. Jeffery, Desmond G. Higgins, Aedín C...
NIPS
2008
15 years 1 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
BMCBI
2008
208views more  BMCBI 2008»
14 years 12 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
BMCBI
2008
220views more  BMCBI 2008»
14 years 12 months ago
Gene prediction in metagenomic fragments: A large scale machine learning approach
Background: Metagenomics is an approach to the characterization of microbial genomes via the direct isolation of genomic sequences from the environment without prior cultivation. ...
Katharina J. Hoff, Maike Tech, Thomas Lingner, Rol...