跳到主要导航 跳到搜索 跳到主要内容

Mining Relationships among Multiple Entities in Biological Networks

  • Beijing Xiaoju Technology Co Ltd. (DIDI)
  • School of Computer Science and Technology, Harbin Institute of Technology
  • University of Kentucky

科研成果: 期刊稿件 › 文章 › 同行评审

15 引用 (Scopus)

摘要

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.

源语言英语
期刊论文编号8666735
页(从-至)769-776
页数8
期刊IEEE/ACM Transactions on Computational Biology and Bioinformatics
卷17
期3
DOI
出版状态已出版 - 1 5月 2020

学术指纹

探究 'Mining Relationships among Multiple Entities in Biological Networks' 的科研主题。它们共同构成独一无二的学术指纹。

引用此