Ballouz Sara, Weber Melanie, Pavlidis Paul, Gillis Jesse
Stanley Institute for Cognitive Genomics, Cold Spring Harbor Laboratory, Woodbury, NY 11797, USA.
Department of Mathematics and Computer Science, University of Leipzig, Leipzig, Germany.
Bioinformatics. 2017 Feb 15;33(4):612-614. doi: 10.1093/bioinformatics/btw695.
Evaluating gene networks with respect to known biology is a common task but often a computationally costly one. Many computational experiments are difficult to apply exhaustively in network analysis due to run-times. To permit high-throughput analysis of gene networks, we have implemented a set of very efficient tools to calculate functional properties in networks based on guilt-by-association methods. ( xtending ' uilt-by- ssociation' by egree) allows gene networks to be evaluated with respect to hundreds or thousands of gene sets. The methods predict novel members of gene groups, assess how well a gene network groups known sets of genes, and determines the degree to which generic predictions drive performance. By allowing fast evaluations, whether of random sets or real functional ones, provides the user with an assessment of performance which can easily be used in controlled evaluations across many parameters.
The software package is freely available at https://github.com/sarbal/EGAD and implemented for use in R and Matlab. The package is also freely available under the LGPL license from the Bioconductor web site ( http://bioconductor.org ).
Supplementary data are available at Bioinformatics online.
根据已知生物学知识评估基因网络是一项常见任务,但通常计算成本很高。由于运行时间的原因,许多计算实验难以在网络分析中全面应用。为了实现基因网络的高通量分析,我们基于“关联有罪”方法实现了一套非常高效的工具来计算网络中的功能特性。(按度扩展“关联有罪”)允许针对数百或数千个基因集评估基因网络。这些方法可预测基因组成员、评估基因网络对已知基因集的分组效果,并确定一般预测对性能的驱动程度。通过允许快速评估,无论是随机集还是实际功能集,都能为用户提供性能评估,可轻松用于跨多个参数的对照评估。
补充数据可在《生物信息学》在线获取。