Calculation of centralities in protein kinase A
Topological analysis of amino acid networks is a common method that can help to understand the roles of individual residues. The most popular approach for network construction is to create a connection between residues if they interact. These interactions are usually weighted by absolute values of correlation coefficients or mutual information. Here we argue that connections in such networks have to reflect levels of cohesion within the protein instead of a simple fact of interaction between residues. If this is correct, an indiscriminate combination of correlation and anti-correlation, as well as the all-inclusive nature of the mutual information metrics, should be detrimental for the analysis. To test our hypothesis, we studied amino acid networks of the protein kinase A created by Local Spatial Pattern alignment, a method that can detect conserved patterns formed by Cα-Cβ vectors. Our results showed that, in comparison with the traditional methods, this approach is more efficient in detecting functionally important residues. Out of four studied centrality metrics, Closeness centrality was the least efficient measure of residue importance. Eigenvector centrality proved to be ineffective as the spectral gap values of the networks were very low due to the bilobal structure of the kinase. We recommend using joint graphs of Betweenness centrality and Degree centrality to visualize different aspects of amino acid roles.