Sciweavers

1208 search results - page 145 / 242
» Gene set analysis for longitudinal gene expression data
Sort
View
EDBT
2011
ACM
199views Database» more  EDBT 2011»
13 years 10 days ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
BMCBI
2010
152views more  BMCBI 2010»
13 years 9 months ago
Comparative study of discretization methods of microarray data for inferring transcriptional regulatory networks
Background: Microarray data discretization is a basic preprocess for many algorithms of gene regulatory network inference. Some common discretization methods in informatics are us...
Yong Li, Lili Liu, Xi Bai, Hua Cai, Wei Ji, Dianji...
TCBB
2008
107views more  TCBB 2008»
13 years 8 months ago
Coclustering of Human Cancer Microarrays Using Minimum Sum-Squared Residue Coclustering
It is a consensus in microarray analysis that identifying potential local patterns, characterized by coherent groups of genes and conditions, may shed light on the discovery of pre...
Hyuk Cho, Inderjit S. Dhillon
IJCSA
2007
98views more  IJCSA 2007»
13 years 8 months ago
Extracted Knowledge Interpretation in mining biological data: a survey
This paper discusses different approaches for integrating biological knowledge in gene expression analysis. Indeed we are interested in the fifth step of microarray analysis pro...
Martine Collard, Ricardo Martínez
BMCBI
2010
178views more  BMCBI 2010»
13 years 9 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...