首页> 外文会议>IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology >Clustering Incorporating Shortest Paths Identifies Relevant Modules in Functional Interaction Networks
【24h】

Clustering Incorporating Shortest Paths Identifies Relevant Modules in Functional Interaction Networks

机译:包含最短路径的聚类识别功能交互网络中的相关模块

获取原文

摘要

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.
机译:许多生物系统可以被建模为网络。因此,网络分析对系统生物学的重要性越来越重要。我们描述了一种基于网络拓扑选择大网络内的节点集群的进化算法,以及节点与一组独立识别的感兴趣基因的测量。我们将该算法应用于先前公布的酵母基因的综合功能网络,使用来自酵母菌株的整个基因组筛网的一组查询基因,其在端粒未接下来基因中的突变。我们发现该算法鉴定了与细胞周期相关的生物合理的基因簇,并且含有先前未被识别的相互作用潜在重要的基因。我们得出结论,该算法对于查询复杂网络以及生物假设的产生是有价值的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号