1. EDGE-WEIGHTING OF GENE EXPRESSION GRAPHS
- Author
-
Grainne Kerr, Martin Crane, Dimitri Perrin, and Heather J. Ruskin
- Subjects
Bioinformatics ,Computer simulation ,computer.software_genre ,Missing data ,Expression (mathematics) ,Weighting ,Control and Systems Engineering ,Search algorithm ,Robustness (computer science) ,Bipartite graph ,Statistical physics ,Data mining ,Edge-weighting, weighted graphs, gene expression, bi-clustering ,Representation (mathematics) ,Cluster analysis ,computer ,Numerical analysis ,Mathematics - Abstract
In recent years, considerable research efforts have been directed to micro-array technologies and their role in providing simultaneous information on expression profiles for thousands of genes. These data, when subjected to clustering and classification procedures, can assist in identifying patterns and providing insight on biological processes. To understand the properties of complex gene expression datasets, graphical representations can be used. Intuitively, the data can be represented in terms of a bipartite graph, with weighted edges corresponding to gene-sample node couples in the dataset. Biologically meaningful subgraphs can be sought, but performance can be influenced both by the search algorithm, and, by the graph-weighting scheme and both merit rigorous investigation. In this paper, we focus on edge-weighting schemes for bipartite graphical representation of gene expression. Two novel methods are presented: the first is based on empirical evidence; the second on a geometric distribution. The schemes are compared for several real datasets, assessing efficiency of performance based on four essential properties: robustness to noise and missing values, discrimination, parameter influence on scheme efficiency and reusability. Recommendations and limitations are briefly discussed. Keywords: Edge-weighting; weighted graphs; gene expression; bi-clustering
- Published
- 2010