Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

SIAMCOMP
2008

favoriteEmaildiscussreport

123views more SIAMCOMP 2008»

Approximation Algorithms for Biclustering Problems

13 years 4 months ago

Approximation Algorithms for Biclustering Problems

Download www.cs.cityu.edu.hk

One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) that exhibit similar expression patterns. This is the so-called biclustering problem. In this paper, we consider two variations of the biclustering problem: the consensus submatrix problem and the bottleneck submatrix problem. The input of the problems contains an m

Lusheng Wang, Yu Lin, Xiaowen Liu

Real-time Traffic

Bottleneck Submatrix Problem | Consensus Submatrix Problem | SIAMCOMP 2008 | Submatrix Problem |

claim paper

Related Content

» Possibilistic Approach to Biclustering An Application to Oligonucleotide Microarray Data A...

» An approximation ratio for biclustering

» Identification of coherent patterns in gene expression data using an efficient biclusterin...

» Comparative analysis of biclustering algorithms

» Exemplarbased Robust Coherent Biclustering

» Approximation algorithms for coclustering

» A visual analytics approach for understanding biclustering results from microarray data

» Evolutionary Biclustering of Microarray Data

» BottomUp Multiple Row Addition Algorithms for the BiclusteringProblem

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	SIAMCOMP
Authors	Lusheng Wang, Yu Lin, Xiaowen Liu

Comments (0)