2017
DOI: 10.1093/bioinformatics/btx199
|View full text |Cite
|
Sign up to set email alerts
|

Gracob: a novel graph-based constant-column biclustering method for mining growth phenotype data

Abstract: MotivationGrowth phenotype profiling of genome-wide gene-deletion strains over stress conditions can offer a clear picture that the essentiality of genes depends on environmental conditions. Systematically identifying groups of genes from such high-throughput data that share similar patterns of conditional essentiality and dispensability under various environmental conditions can elucidate how genetic interactions of the growth phenotype are regulated in response to the environment.ResultsWe first demonstrate … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 56 publications
0
5
0
Order By: Relevance
“…However, their use depends on the choice of color. In both methods, a shuffling of rows/columns could be needed for an improved visualization [ 69 , 161 , 162 ].…”
Section: Evaluation Measuresmentioning
confidence: 99%
“…However, their use depends on the choice of color. In both methods, a shuffling of rows/columns could be needed for an improved visualization [ 69 , 161 , 162 ].…”
Section: Evaluation Measuresmentioning
confidence: 99%
“…The biclustering algorithm was first proposed in Hartigan (1972), is a two-dimensional data mining technique that allows simultaneous clustering of rows (representing genes) and columns (representing samples/conditions) in a gene expression matrix. Developments continued in the following decades, with (Cheng and Church, 2000;Lazzeroni and Owen, 2000;Bergmann et al, 2003;Kluger et al, 2003;Chiu et al, 2004;Prelić et al, 2006;Dhollander et al, 2007;Gu and Liu, 2008;Li et al, 2009;Hochreiter et al, 2010;Madeira et al, 2010;Medina et al, 2010;Chen et al, 2011;De Smet and Marchal, 2011;Zhao et al, 2011;Zhou et al, 2012;Goncalves and Madeira, 2014;Henriques and Madeira, 2016a,b;Alzahrani et al, 2017;Guo et al, 2021) being articles on different clustering algorithms. Among them, BCPlaid (Lazzeroni and Owen, 2000), QUBIC (Li et al, 2009), C&C (Cheng and Church, 2000), FABIA (Hochreiter et al, 2010) are the more popular biclustering algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…However, there are two types of patterns that show special interest in nature: shifting and scaling patterns [14]. Most of the approaches for shifting pattern induction are based on a measure named Mean Square Residue (MSR) [4] and its variants [15][16][17][18], or on graph theory [19][20][21].…”
Section: Introductionmentioning
confidence: 99%