Ultranet: Efficient solver for the sparse inverse covariance selection problem in gene network modeling

7Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Graphical Gaussian models (GGMs) are a promising approach to identify gene regulatory networks. Such models can be robustly inferred by solving the sparse inverse covariance selection (SICS) problem. With the high dimensionality of genomics data, fast methods capable of solving large instances of SICS are needed.We developed a novel network modeling tool, Ultranet, that solves the SICS problem with significantly improved efficiency. Ultranet combines a range of mathematical and programmatical techniques, exploits the structure of the SICS problem and enables computation of genome-scale GGMs without compromising analytic accuracy.Availability and implementation: Ultranet is implemented in C++ and available at www.broadinstitute.org/ultranet. © 2013 The Author.

Cite

CITATION STYLE

APA

Järvstråt, L., Johansson, M., Gullberg, U., & Nilsson, B. (2013). Ultranet: Efficient solver for the sparse inverse covariance selection problem in gene network modeling. Bioinformatics, 29(4), 511–512. https://doi.org/10.1093/bioinformatics/bts717

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free