Toggle Main Menu Toggle Search

Open Access padlockePrints

Clustering incorporating shortest paths identifies relevant modules in functional interaction networks

Lookup NU author(s): Dr Jennifer Hallinan, Dr Matthew Pocock, Dr Stephen Addinall, Professor David Lydall, Professor Anil Wipat

Downloads


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.


Publication metadata

Author(s): Hallinan JS, Pocock MR, Addinall S, Lydall D, Wipat A

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: CIBCB '09: IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology

Year of Conference: 2009

Pages: 228-236

Date deposited: 24/05/2010

Publisher: IEEE

URL: http://dx.doi.org/10.1109/CIBCB.2009.4925733

DOI: 10.1109/CIBCB.2009.4925733

Library holdings: Search Newcastle University Library for this item

ISBN: 9781424427567


Actions

Find at Newcastle University icon    Link to this publication


Share