In biology, molecules can have multi-way interactions within cells, and until recently, computational analysis of these links has been “incomplete,” according to T. M. Murali, associate professor of computer science in the College of Engineering at Virginia Tech.
His group authored an article on their new approach to address these shortcomings, titled “Reverse Engineering Molecular Hypergraphs,” that received the Best Paper Award at the recent 2012 ACM Conference on Bioinformatics, Computational Biology and Biomedicine.
Intricate networks of connections among molecules control the processes that occur within cells. The “analysis of these interaction networks has relied almost entirely on graphs for modeling the information. Since a link in a graph connects at most two molecules (e.g., genes or proteins), such edges cannot accurately represent interactions among multiple molecules. These interactions occur very often within cells,” the computer scientists wrote in their paper.
To overcome the limitations in the use of the graphs, Murali and his students used hypergraphs, a generalization of a graph in which an hyperedge can connect multiple molecules.
“We used hypergraphs to capture the uncertainty that is inherent in reverse engineering gene to gene networks from systems biology datasets,” explained Ahsanur Rahman, the lead author on the paper. “We believe hypergraphs are powerful representations for capturing the uncertainty in a network’s structure.”
They developed reliable algorithms that can discover hyperedges supported by sets of networks. In ongoing research, the scientists seek to use hyperedges to suggest new experiments. By capturing uncertainty in network structure, hyperedges can directly suggest groups of genes for which further experiments may be required in order to precisely discover interaction patterns. Incorporating the data from these experiments might help to refine hyperedges and resolve the interactions among molecules, resulting in fruitful interplay and feedback between computation and experiment.