作者: Rui-Sheng Wang , Luonan Chen , Xiang-Sun Zhang , Yong Wang
DOI:
关键词: Theoretical computer science 、 Machine learning 、 Shortest path problem 、 Interpretation (logic) 、 Experimental data 、 Biology 、 Construct (python library) 、 Interaction network 、 False positive paradox 、 Artificial intelligence 、 Binary data 、 Mechanism (biology)
摘要: Most gene products facilitate their functions within complex interconnected networks by interacting with other biomolecules. Thus elucidating protein functional relationships from neighbors is one of the challenging problems post-genomic era. High-throughput experiments such as genome-wide protein-protein interaction are expected to be fertile sources information for deriving relationships. However, a high rate false positives and sheer volume data making reliable interpretation these difficult. In this work, we overcome difficulties using network-based statistical significance analysis method that forms associations between proteins. The basic mechanism if two proteins share similar globally than random, they have close associations. Our tries establish framework explore analyzing sharing global partnerships all pairs in network. framework, many methods can integrated define construct neighborhood data. Furthermore our applied directly binary data, experimental strength integration Applying yeast datasets shortest path form neighborhood, shown able infer linkages which verified GO functions.