TRaCE - Transitive Reduction and Closure Ensemble
Inferring the structure of gene regulatory networks (GRNs) from expression data is a major topic in systems biology. Despite the large number of methods developed for this purpose, such inference is still an open problem. The network inference is often stated to be underdetermined. The underdetermined nature of the network inference problem implies that there could be multiple network solutions to the inference problem, i.e. the solution consists of an ensemble of networks. TRaCE and its extension TRaCE+ were developed using an ensemble inference approach. TRaCE and TRaCE+ generate the upper-bound and lower-bound directed graphs (digraphs) of the GRN ensemble. The difference between the upper and lower bounds (i.e. edges in the upper bound that are not in the lower bound) defines the set of uncertain edges, representing gene regulations that could not be verified by the data. While TRaCE deals with an ensemble of digraphs, TRaCE+ further considers the signs of the edges. A positive edge represents an activation, while a negative edge represents a repression. These ensemble bounds can be used to optimise gene KO experiments (see our tool: REDUCE).
TRaCE and TRaCE+ were implemented and tested on MATLAB 2011a platform.
Redistribution and use in source and binary forms, with or without modification, are permitted provided agreeing to the Simplified BSD Style License.
Read about Simplified BSD Style License at http://www.opensource.org/licenses/bsd-license.php
Download & Installation
Please use the following references when using TRaCE and TRaCE+
- Ud-Dean, SMM., Heise, S., Klamt, S. and Gunawan, R. TRaCE+: Ensemble inference of gene regulatory networks from transcriptional expression profiles of gene knock-out experiments. BMC Bioinformatics 17, 252 (2016). abstract
- Ud-Dean, SMM., and Gunawan, R. Ensemble Inference and Inferability of Gene Regulatory Networks. PLoS ONE, 9(8), e103812 (2014). abstract
This work is supported by funding from Swiss National Science Foundation.