The Community for Technology Leaders
Green Image
ISSN: 1545-5963
Craig Estep , Virginia Tech, Blacksburg
David J. Badger , Virginia Tech, Blacksburg
Christopher L. Poirel , Virginia Tech, Blacksburg
Ahsanur Rahman , Virginia Tech, Blacksburg
T. M. Murali , Virginia Tech, Blacksburg
Analysis of molecular interaction networks is pervasive in systems biology. This research relies almost entirely on graphs for modeling interactions. However, edges in graphs cannot represent multi-way interactions among molecules, which occur very often within cells. Hypergraphs may be better representations for networks having such interactions, since hyperedges can naturally represent relationships among multiple molecules. Here we propose using hypergraphs to capture the uncertainty inherent in reverse engineering gene-gene networks. Some subsets of nodes may induce highly varying subgraphs across an ensemble of networks inferred by a reverse engineering algorithm. We provide a novel formulation of hyperedges to capture this uncertainty in network topology. We propose a clustering-based approach to discover hyperedges. We show that our approach can recover hyperedges planted in synthetic datasets with high precision and recall, even for moderate amount of noise. We apply our techniques to a dataset of pathways inferred from genetic interaction data in S. cerevisiae related to the unfolded protein response. Our approach discovers several hyperedges that capture the uncertain connectivity of genes in relevant protein complexes, suggesting that further experiments may be required to precisely discern their interaction patterns. We also show that these complexes are not discovered by an algorithm that computes frequent and dense subgraphs.
Graphs and Networks, Biology and genetics, Hypergraphs
Craig Estep, David J. Badger, Christopher L. Poirel, Ahsanur Rahman, T. M. Murali, "Reverse Engineering Molecular Hypergraphs", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. , no. , pp. 0, 5555, doi:10.1109/TCBB.2013.71
91 ms
(Ver )