eCite Digital Repository
Active subnetwork recovery with a mechanism-dependent scoring function; with application to angiogenesis and organogenesis studies
Citation
Lichtenstein, I and Charleston, MA and Caetano, TS and Gamble, JR and Vadas, MA, Active subnetwork recovery with a mechanism-dependent scoring function; with application to angiogenesis and organogenesis studies, Bioinformatics, 14 Article 59. ISSN 1367-4803 (2013) [Refereed Article]
 | PDF 2Mb |
Copyright Statement
Copyright 2013 Lichtenstein et al. Licensed under Creative Commons Attribution 2.0 Generic (CC BY 2.0) https://creativecommons.org/licenses/by/2.0/
DOI: doi:10.1186/1471-2105-14-59
Abstract
Background
The learning active subnetworks problem involves finding subnetworks of a bio-molecular network that are active in a particular condition. Many approaches integrate observation data (e.g., gene expression) with the network topology to find candidate subnetworks. Increasingly, pathway databases contain additional annotation information that can be mined to improve prediction accuracy, e.g., interaction mechanism (e.g., transcription, microRNA, cleavage) annotations. We introduce a mechanism-based approach to active subnetwork recovery which exploits such annotations. We suggest that neighboring interactions in a network tend to be co-activated in a way that depends on the "correlation" of their mechanism annotations. e.g., neighboring phosphorylation and de-phosphorylation interactions may be more likely to be co-activated than neighboring phosphorylation and covalent bonding interactions.
Results
Our method iteratively learns the mechanism correlations and finds the most likely active subnetwork. We use a probabilistic graphical model with a Markov Random Field component which creates dependencies between the states (active or non-active) of neighboring interactions, that incorporates a mechanism-based component to the function. We apply a heuristic-based EM-based algorithm suitable for the problem. We validated our method’s performance using simulated data in networks downloaded from GeneGO against the same approach without the mechanism-based component, and two other existing methods. We validated our methods performance in correctly recovering (1) the true interaction states, and (2) global network properties of the original network against these other methods. We applied our method to networks generated from time-course gene expression studies in angiogenesis and lung organogenesis and validated the findings from a biological perspective against current literature.
Conclusions
The advantage of our mechanism-based approach is best seen in networks composed of connected regions with a large number of interactions annotated with a subset of mechanisms, e.g., a regulatory region of transcription interactions, or a cleavage cascade region. When applied to real datasets, our method recovered novel and biologically meaningful putative interactions, e.g., interactions from an integrin signaling pathway using the angiogenesis dataset, and a group of regulatory microRNA interactions in an organogenesis network.
Item Details
| Item Type: | Refereed Article |
|---|---|
| Keywords: | condition-specific networks, active subnetwork, Markov random field, edge label |
| Research Division: | Biological Sciences |
| Research Group: | Genetics |
| Research Field: | Genetics not elsewhere classified |
| Objective Division: | Expanding Knowledge |
| Objective Group: | Expanding knowledge |
| Objective Field: | Expanding knowledge in the biological sciences |
| UTAS Author: | Charleston, MA (Professor Michael Charleston) |
| ID Code: | 121078 |
| Year Published: | 2013 |
| Web of Science® Times Cited: | 3 |
| Deposited By: | Mathematics and Physics |
| Deposited On: | 2017-09-08 |
| Last Modified: | 2017-11-01 |
| Downloads: | 191 View Download Statistics |
Repository Staff Only: item control page