Optimized null model for protein structure networks.
Much attention has recently been given to the statistical significance of topological features observed in biological networks. Here, we consider residue interaction graphs (RIGs) as network representations of protein structures with residues as nodes and inter-residue interactions as edges. Degree-preserving randomized models have been widely used for this purpose in biomolecular networks. However, such a single summary statistic of a network may not be detailed enough to capture the complex topological characteristics of protein structures and their network counterparts. Here, we investigate a variety of topological properties of RIGs to find a well fitting network null model for them. The RIGs are derived from a structurally diverse protein data set at various distance cut-offs and for different groups of interacting atoms. We compare the network structure of RIGs to several random graph models. We show that 3-dimensional geometric random graphs, that model spatial relationships between objects, provide the best fit to RIGs. We investigate the relationship between the strength of the fit and various protein structural features. We show that the fit depends on protein size, structural class, and thermostability, but not on quaternary structure. We apply our model to the identification of significantly over-represented structural building blocks, i.e., network motifs, in protein structure networks. As expected, choosing geometric graphs as a null model results in the most specific identification of motifs. Our geometric random graph model may facilitate further graph-based studies of protein conformation space and have important implications for protein structure comparison and prediction. The choice of a well-fitting null model is crucial for finding structural motifs that play an important role in protein folding, stability and function. To our knowledge, this is the first study that addresses the challenge of finding an optimized null model for RIGs, by comparing various RIG definitions against a series of network models.
Milenković
Tijana
T
Department of Computer Science, University of California Irvine, Irvine, CA, USA.
Filippis
Ioannis
I
Lappe
Michael
M
Przulj
Natasa
N
D000465:Algorithms; D020816:Amino Acid Motifs; D000818:Animals; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods; D003198:Computer Simulation; D030562:Databases, Protein; D006801:Humans; D008962:Models, Theoretical; D017510:Protein Folding; D011506:Proteins / Q000737:chemistry*; D020543:Proteome; D040901:Proteomics / Q000379:methods*
D011506:Proteins; D020543:Proteome