Clustering incorporating shortest paths identifies relevant modules in functional interaction networks

  • Authors:
  • Jennifer Hallinan;Matthew Pocock;Stephen Addinall;David A. Lydall;Anil Wipat

  • Affiliations:
  • School of Computing Science, Newcastle University, Newcastle upon Tyne, UK;School of Computing Science, Newcastle University, Newcastle upon Tyne, UK;Centre for the Integrated Systems Biology of Ageing and Nutrition, Newcastle upon Tyne, UK;Centre for the Integrated Systems Biology of Ageing and Nutrition, Newcastle upon Tyne, UK;School of Computing Science, Newcastle University and Centre for the Integrated Systems Biology of Ageing and Nutrition, Newcastle upon Tyne, UK

  • Venue:
  • CIBCB'09 Proceedings of the 6th Annual IEEE conference on Computational Intelligence in Bioinformatics and Computational Biology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many biological systems can be modeled as networks. Hence, network analysis is of increasing importance to systems biology. We describe an evolutionary algorithm for selecting clusters of nodes within a large network based upon network topology together with a measure of the relevance of nodes to a set of independently identified genes of interest. We apply the algorithm to a previously published integrated functional network of yeast genes, using a set of query genes derived from a whole genome screen of yeast strains with a mutation in a telomere uncapping gene. We find that the algorithm identifies biologically plausible clusters of genes which are related to the cell cycle, and which contain interactions not previously identified as potentially important. We conclude that the algorithm is valuable for the querying of complex networks, and the generation of biological hypotheses.