Abstract
With the development of high-throughput technologies in recent years, more and more scientists focus on protein-protein interaction (PPI) networks. Previous studies showed that there are modular structures in PPI networks. It is well known that Newman algorithm is a classical method for mining associations existed in complex networks, which has advantages of high accuracy and low complexity. Based on the Newman algorithm, we proposed an improved Newman algorithm to mine overlapping modules from PPI networks. Our method mainly consists of two steps. Firstly, we try to discover all candidate nodes whose neighbors belong to more than one module. Secondly, we determine candidate nodes that have positive effects on modularity as overlapping nodes and copy these nodes into their corresponding modules. In addition, owing to the features of existing system noise in PPI networks, we designed corresponding methods for de-noising. Experimental results concerning MIPS dataset show that, the proposed improved Newman algorithm not only has the ability of finding overlapping modular structure but also has low computational complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.