Mining Relationships among Multiple Entities in Biological Networks.

Authors:
Jiajie Peng
Jiajie Peng
School of Computer Science and Technology
China
Yadong Wang
Yadong Wang
School of Computer Science and Technology
Los Angeles | United States
Jin Chen
Jin Chen
Michigan State University
East Lansing | United States

IEEE/ACM Trans Comput Biol Bioinform 2019 Mar 13. Epub 2019 Mar 13.

Identifying topological relationships among multiple entities in biological networks is critical towards the understanding of the organizational principles of network functionality. Theoretically, this problem can be solved using minimum Steiner tree (MSTT) algorithms. However, due to large network size, it remains to be computationally challenging, and the predictive value of multi-entity topological relationships is still unclear. We present a novel solution called Cluster-based Steiner Tree Miner (CST-Miner) to instantly identify multi-entity topological relationships in biological networks. Given a list of user-specific entities, CST-Miner decomposes a biological network into nested cluster-based subgraphs, on which multiple minimum Steiner trees are identified. By merging all of them into a minimum cost tree, the optimal topological relationships among all the user-specific entities are revealed. Experimental results showed that CST-Miner can finish in nearly log-linear time and the tree constructed by CST-Miner is close to the global minimum.

Download full-text PDF

Source
http://dx.doi.org/10.1109/TCBB.2019.2904965DOI Listing
March 2019

Publication Analysis

Top Keywords

topological relationships
16
biological networks
12
entities biological
8
steiner tree
8
user-specific entities
8
multiple entities
8
multi-entity topological
8
minimum steiner
8
relationships multiple
8
relationships biological
4
list user-specific
4
networks list
4
cst-miner decomposes
4
network nested
4
biological network
4
decomposes biological
4
identify multi-entity
4
entities cst-miner
4
miner cst-miner
4
solution called
4

Similar Publications