Abstract

Different ensemble voting approaches have been successfully applied for reverse-engineering of gene regulatory networks. They are based on the assumption that a good approximation of true network structure can be derived by considering the frequencies of individual interactions in a large number of predicted networks. Such approximations are typically superior in terms of prediction quality and robustness as compared to considering a single best scoring network only. Nevertheless, ensemble approaches only work well if the predicted gene regulatory networks are sufficiently similar to each other. If the topologies of predicted networks are considerably different, an ensemble of all networks obscures interesting individual characteristics. Instead, networks should be grouped according to local topological similarities and ensemble voting performed for each group separately. We argue that the presence of sets of co-occurring interactions is a suitable indicator for grouping predicted networks. A stepwise bottom-up procedure is proposed, where first mutual dependencies between pairs of interactions are derived from predicted networks. Pairs of co-occurring interactions are subsequently extended to derive characteristic interaction sets that distinguish groups of networks. Finally, ensemble voting is applied separately to the resulting topologically similar groups of networks to create distinct group-ensembles. Ensembles of topologically similar networks constitute distinct hypotheses about the reference network structure. Such group-ensembles are easier to interpret as their characteristic topology becomes clear and dependencies between interactions are known. The availability of distinct hypotheses facilitates the design of further experiments to distinguish between plausible network structures. The proposed procedure is a reasonable refinement step for non-deterministic reverse-engineering applications that produce a large number of candidate predictions for a gene regulatory network, e.g. due to probabilistic optimization or a cross-validation procedure.

Highlights

  • Reverse-engineering of gene regulatory networks from gene expression measurements is applied to identify direct effectortarget relations, i.e. to identify transcription factors binding to the promoter regions of genes to regulate gene expression

  • A Characteristic Interaction Set Extraction Approach The approach we present here consists of three subsequent steps: Calculation of interaction frequencies, derivation of scores for mutual dependencies, and grouping of networks

  • To create networks for subsequent characteristic set extraction and validation, we applied a genetic algorithm (GA) to reverseengineer dynamical models based on Petri Nets and Fuzzy Logic (PNFL, [20,21])

Read more

Summary

Introduction

Reverse-engineering of gene regulatory networks from gene expression measurements is applied to identify direct effectortarget relations, i.e. to identify transcription factors binding to the promoter regions of genes to regulate gene expression (for reviews see [1,2,3,4,5]). A major class of reverse-engineering algorithms are dynamical model based approaches which describe the actual effector-target relations by various mathematical frameworks (such as ODEs [6,7,8], Petri Nets [9,10,11], Boolean Nets [12,13,14]). The dynamical models can be created and optimized based on nondeterministic procedures involving iterative modifications of model structure and parameters (e.g. genetic algorithms, Monte Carlo methods, see [15,16]). Models are repeatedly confronted with expression data from different perturbation scenarios (wild type, knockouts, overexpression, chemical treatment, etc.) and predicted gene expression levels are compared to experimental data to assess the validity of the models. The resulting network of interactions between pairs of genes constitutes a hypothesis about the (true) gene regulatory network

Methods
Results
Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.