2010
DOI: 10.1186/1471-2105-11-520
|View full text |Cite
|
Sign up to set email alerts
|

Comparative study of discretization methods of microarray data for inferring transcriptional regulatory networks

Abstract: BackgroundMicroarray data discretization is a basic preprocess for many algorithms of gene regulatory network inference. Some common discretization methods in informatics are used to discretize microarray data. Selection of the discretization method is often arbitrary and no systematic comparison of different discretization has been conducted, in the context of gene regulatory network inference from time series gene expression data.ResultsIn this study, we propose a new discretization method "bikmeans", and co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
27
0
2

Year Published

2012
2012
2024
2024

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(31 citation statements)
references
References 18 publications
2
27
0
2
Order By: Relevance
“…Because gene expression is noisy as reported (25), unsupervised discretization methods were usually used to discretize the gene expression profiles in gene regulatory network construction including equal width discretization, equal frequency discretization, K-means, column K-means discretization, and bidirectional K-means discretization. We discretized the expression values by rank ordering across genes and dividing the ranked 2158 expression values of each gene across experiments into three bins, labeled as "1" (upper 719 experiments where the gene ranked highest), "0" (lower 719 experiments where the gene ranked lowest), and "middle" (720 remaining experiments).…”
Section: Gene Expression Profilesmentioning
confidence: 99%
“…Because gene expression is noisy as reported (25), unsupervised discretization methods were usually used to discretize the gene expression profiles in gene regulatory network construction including equal width discretization, equal frequency discretization, K-means, column K-means discretization, and bidirectional K-means discretization. We discretized the expression values by rank ordering across genes and dividing the ranked 2158 expression values of each gene across experiments into three bins, labeled as "1" (upper 719 experiments where the gene ranked highest), "0" (lower 719 experiments where the gene ranked lowest), and "middle" (720 remaining experiments).…”
Section: Gene Expression Profilesmentioning
confidence: 99%
“…We obtained a network for a specific tissue type by constructing the subgraph of the original Pathway Commons network using the set of active genes in that tissue. Specifically, given the integrated network as a graph G = (V, E) and the set of active genes for a condition as V t , the tissue specific graph is given as [21]. In this study, we used a simple approach for identification of gene activity.…”
Section: Tissue/disease Specific Networkmentioning
confidence: 99%
“…Gene Set Enrichment Analysis [12] and Gene Set Analysis [13] are some of the many approaches currently available that focus on the analysis of gene sets, which may be obtained via databases such as the Molecular Signatures Database [12] or by discretizing time series data [14] and steady state data. Gene sets are more interpretable as they correspond to lists of biological processes [15] and may be thought of as derived sample features that succinctly summarize the original gene expression data [16].…”
Section: Introductionmentioning
confidence: 99%