Krishnadev, O and Brinda, KV and Vishveshwara, Saraswathi (2005) A Graph Spectral Analysis of the Structural Similarity Network of Protein Chains. In: Proteins: Structure, Function, and Bioinformatics, 61 . pp. 152-163.
We present a simple method for the analysis of large networks based on their graph spectral properties. One of the advantages of this method is that it uses a single numerical computation to identify subclusters in a connected graph, which can significantly simplify the complexity involved in analyzing large graphs. This is illustrated using a network of protein chains constructed on the basis of their structural similarities. The largescale network properties and the cluster and subcluster organization of the protein chain network are presented. We summarize the results of structural and functional analyses of the nodes present in these clusters and elucidate the implications of structural similarity in the protein chain universe.
|Item Type:||Journal Article|
|Additional Information:||The copyright belongs to Wiley-Liss, Inc.|
|Keywords:||protein chain universe graph;realworld networks;eigenvalue eigenvector components of graphs;sub graph density;weighted graphs|
|Department/Centre:||Division of Biological Sciences > Molecular Biophysics Unit|
|Date Deposited:||09 Sep 2005|
|Last Modified:||19 Sep 2010 04:20|
Actions (login required)