PT  - JOURNAL ARTICLE
AU  - Sara Ballouz
AU  - Melanie Weber
AU  - Paul Pavlidis
AU  - Jesse Gillis
TI  - EGAD: Ultra-fast functional analysis of gene networks
AID  - 10.1101/053868
DP  - 2016 Jan 01
TA  - bioRxiv
PG  - 053868
4099  - http://biorxiv.org/content/early/2016/05/17/053868.short
4100  - http://biorxiv.org/content/early/2016/05/17/053868.full
AB  - Summary 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. EGAD (Extending ‘Guilt-by-Association’ by Degree) 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, EGAD provides the user with an assessment of performance which can easily be used in controlled evaluations across many parameters.Availability and Implementation 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).Contact JGillis{at}cshl.eduSupplementary information Supplementary data are available at Bioinformatics online and the full manual at http://gillislab.labsites.cshl.edu/software/egad-extending-guilt-by-association-by-degree/.