Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Discovering Relations Among GO-Annotated Clusters by Graph Kernel Methods
| |
|
Discovering Relations Among GO-Annotated Clusters by Graph Kernel Methods
Italo Zoppis1, Daniele Merico1, Marco Antoniotti1, Bud Mishra2 and Giancarlo Mauri1
| (1) |
Dipartimento di Informatica, Sistemistica e Comunicazione, Universitá degli Studi di Milano Bicocca, Via Bicocca degli Arcimboldi
8, U7, I-20126 Milano, Italy |
| (2) |
Bioinformatics Group, Courant Institute of Mathematical Sciences, New York University, 715 Broadway, New York, NY, 10003, USA |
Abstract
The biological interpretation of large-scale gene expression data is one of the challenges in current bioinformatics. The
state-of-the-art approach is to perform clustering and then compute a functional characterization via enrichments by Gene
Ontology terms [1]. To better assist the interpretation of results, it may be useful to establish connections among different
clusters. This machine learning step is sometimes termed cluster meta-analysis, and several approaches have already been proposed; in particular, they usually rely on enrichments based on flat lists of
GO terms. However, GO terms are organized in taxonomical graphs, whose structure should be taken into account when performing
enrichment studies. To tackle this problem, we propose a kernel approach that can exploit such structured graphical nature.
Finally, we compare our approach against a specific flat list method by analyzing the cdc15-subset of the well known Spellman’s
Yeast Cell Cycle dataset [2].
This work has been supported by EC “Marie Curie” grant MIRG-CT-2005-031140.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|