A Repeated Local Search Algorithm for Biclustering of Gene Expression Data

Given a gene expression data matrix where each cell is the expression level of a gene under a certain condition, biclustering is the problem of searching for a subset of genes that coregulate and coexpress only under a subset of conditions. The traditional clustering algorithms cannot be applied for biclustering as one cannot measure the similarity between genes (or rows) and conditions (or columns) by normal geometric similarities. Identifying a network of collaborating genes and a subset of experimental conditions which activate the specific network is a crucial part of the problem. In this paper, the BIClustering problem is solved through a REpeated Local Search algorithm, called BICRELS. The experiments on real datasets show that our algorithm is not only fast but it also significantly outperforms other state-of-the-art algorithms.



Titolo: A Repeated Local Search Algorithm for Biclustering of Gene Expression Data
Autori: Truong, Duy Tin; Battiti, Roberto; Brunato, Mauro
Autori Unitn: 
Truong, Duy Tin
Battiti, Roberto
Brunato, Mauro
Titolo del volume contenente il saggio: Similarity-Based Pattern Recognition, Second International Workshop, SIMBAD 2013, York, UK, July 3-5, 2013, Proceedings
Luogo di edizione: Berlino
Casa editrice: -Heidelberg : Springer-Verlag
Anno di pubblicazione: 2013
Codice identificativo Scopus: 2-s2.0-84879858351
ISBN: 9783642391392
Handle: http://hdl.handle.net/11572/97348
Appare nelle tipologie:04.1 Saggio in atti di convegno (Paper in proceedings)

File in questo prodotto:
Non ci sono file associati a questo prodotto.
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/11572/97348
  • Citazioni
  • PubMed Central ND
  • Scopus
  • WOS ND

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
 
 
 
Powered by IRIS-about IRIS-Utilizzo dei cookie
Logo CINECA  Copyright © 2020