Authors: R. Geetha Ramani; P. Nancy; Shomona Gracia Jacob
Addresses: Department of Information Science and Technology, College of Engineering, Anna University, Chennai, India ' Department of Computer Science and Engineering, Faculty of Information and Communication Engineering, Rajalakshmi Engineering College, Anna University, Chennai, India ' Department of Computer Science and Engineering, SSN College of Engineering College, Anna University, Chennai, India
Abstract: In graph theory and network analysis, gauges of centrality discover significant vertices within a graph or network. Centrality which is optimal for one application is often sub-optimal for a different application. The traditional centrality measures, degree focuses on visibility, betweenness focuses on vertex control of communication, and closeness focuses on vertex independency. This research aims at proposing a novel centrality measure - Entropy based Shortest Path (ESP) which focuses on a node's potential to expand interaction and identify rescuable cancer mutants in the p53 mutation records that depict the amino-acid substitutions obtained by yeast assays. We show that the traditional centrality measures resulted in different assessment of the vertices (proteins) while the proposed measure tailored to the investigations of p53 mutation network was instrumental in the identification of new rescuable cancer mutants. The proposed measure is also applied to social networks like Zachary karate network to validate its correctness in identifying influential nodes.
Keywords: p53 mutants; centrality; social network; biological network; rescuable cancer mutants; influential nodes.
International Journal of Biomedical Engineering and Technology, 2017 Vol.25 No.2/3/4, pp.310 - 325
Available online: 23 Oct 2017 *Full-text access for editors Access for subscribers Purchase this article Comment on this article