# Analysis of biclusters with applications to gene expression data

Abstract : For a given matrix of size $n \times m$ over a finite alphabet $\mathcal{A}$, a bicluster is a submatrix composed of selected columns and rows satisfying a certain property. In microarrays analysis one searches for largest biclusters in which selected rows constitute the same string (pattern); in another formulation of the problem one tries to find a maximally dense submatrix. In a conceptually similar problem, namely the bipartite clique problem on graphs, one looks for the largest binary submatrix with all '1'. In this paper, we assume that the original matrix is generated by a memoryless source over a finite alphabet $\mathcal{A}$. We first consider the case where the selected biclusters are square submatrices and prove that with high probability (whp) the largest (square) bicluster having the same row-pattern is of size $\log_Q^2 n m$ where $Q^{-1}$ is the (largest) probability of a symbol. We observe, however, that when we consider $\textit{any}$ submatrices (not just $\textit{square}$ submatrices), then the largest area of a bicluster jumps to $A_n$ (whp) where $A$ is an explicitly computable constant. These findings complete some recent results concerning maximal biclusters and maximum balanced bicliques for random bipartite graphs.
Keywords :
Type de document :
Communication dans un congrès
Conrado Martìnez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.267-274, 2005, DMTCS Proceedings
Domaine :

Littérature citée [10 références]

https://hal.inria.fr/hal-01184220
Contributeur : Coordination Episciences Iam <>
Soumis le : jeudi 13 août 2015 - 13:34:59
Dernière modification le : jeudi 11 mai 2017 - 01:02:54
Document(s) archivé(s) le : samedi 14 novembre 2015 - 10:24:09

### Fichier

Fichiers éditeurs autorisés sur une archive ouverte

### Identifiants

• HAL Id : hal-01184220, version 1

### Citation

Gahyun Park, Wojciech Szpankowski. Analysis of biclusters with applications to gene expression data. Conrado Martìnez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.267-274, 2005, DMTCS Proceedings. 〈hal-01184220〉

### Métriques

Consultations de la notice

## 240

Téléchargements de fichiers