- Research article
- Open Access
- Published:

# A Network of SCOP Hidden Markov Models and Its Analysis

*BMC Bioinformatics*
**volume 12**, Article number: 191 (2011)

## Abstract

### Background

The Structural Classification of Proteins (SCOP) database uses a large number of hidden Markov models (HMMs) to represent families and superfamilies composed of proteins that presumably share the same evolutionary origin. However, how the HMMs are related to one another has not been examined before.

### Results

In this work, taking into account the processes used to build the HMMs, we propose a working hypothesis to examine the relationships between HMMs and the families and superfamilies that they represent. Specifically, we perform an all-against-all HMM comparison using the HHsearch program (similar to BLAST) and construct a network where the nodes are HMMs and the edges connect similar HMMs. We hypothesize that the HMMs in a connected component belong to the same family or superfamily more often than expected under a random network connection model. Results show a pattern consistent with this working hypothesis. Moreover, the HMM network possesses features distinctly different from the previously documented biological networks, exemplified by the exceptionally high clustering coefficient and the large number of connected components.

### Conclusions

The current finding may provide guidance in devising computational methods to reduce the degree of overlaps between the HMMs representing the same superfamilies, which may in turn enable more efficient large-scale sequence searches against the database of HMMs.

## Background

The Structural Classification of Proteins (SCOP) database is a comprehensive protein database that organizes and classifies proteins based on their evolutionary and structural relationships [1–3]. It is organized into four hierarchical levels: family, superfamily, fold, and classes. At the lowest level (family), individual proteins are clustered into families based on some criteria that may indicate their common evolutionary origin, such as having a pairwise sequence similarity of more than 30% or lower sequence similarity but similar functions and structures. A good example of the latter is seen in globin proteins whose pairwise sequence similarities are much lower than 30% but which have similar protein functions. Next, families are grouped into superfamilies if their structures and/or function features indicate a possible common evolutionary origin. Then superfamilies are clustered into folds if superfamilies share major secondary structures with the same topological arrangements. Finally, different folds are grouped into classes based on their secondary structural compositions. Unlike the other levels, a class might not necessarily imply common evolutionary origins and exists more for convenience than for actual biological implications.

Apart from the hierarchical classification and organization of proteins, the SCOP database employs hidden Markov models (HMMs) to represent superfamilies [4, 5]. The basic procedure of building an HMM for a particular superfamily starts with a seed protein and performs sequence search in a database to obtain other proteins that have sequence similarities above a set threshold. The newly obtained sequences are used to iterate the search for some number of times to obtain additional proteins. Finally, all sequences are aligned and an HMM is constructed for the multiple sequence alignment [4, 5]. It has been shown that different seed proteins might produce HMMs that cover different members of the superfamily [4, 5]. Thus, in order to represent the full set of proteins in a superfamily, multiple HMMs are built for the superfamily using multiple seed proteins. For example, the beta-beta-alpha zinc fingers superfamily has altogether 91 HMMs representing it, and the P-loop containing nucleoside triphosphate hydrolases superfamily has 406 HMMs representing it.

Because each superfamily might be represented by multiple HMMs, there may be a high degree of overlap and redundancy among the models. However, there have not been any studies examining this issue systematically. To understand how the HMMs in the SCOP database are related to one another and the degree of overlap or redundancy among HMMs from either the same or different superfamilies, we perform a detailed analysis of the HMMs in SCOP for their similarity and relationships using a network approach. Specifically, we perform an all-against-all HHsearch for the library of HMMs in the SCOP database.

HHsearch is similar to BLAST, except that instead of matching a sequence against a database of sequences, it uses a query HMM or sequence to match against a database of HMMs and identifies the HMMs significantly homologous to the query HMM or sequence [6]. We then construct a network of HMMs, where the link between two HMMs is based on their similarity, and examine some commonly evaluated network properties. We compare the current network with previously documented networks and outline some questions for future research.

## Results and Discussion

### General statistics of the HMMs and their network

A general description of the HMMs used to construct the network is shown in Table 1. There are seven classes in the collection of HMMs, falling into 721 folds, 1163 superfamilies, and 2573 families. Class *c* has the highest number of HMMs (3391) and class *f* the fewest (145).

The entire HMM network is shown in Figure 1, where the e-value cutoff is 0.001. There are altogether 151,461 edges for the 11,929 vertices. A significant property shown in Figure 1 is that the entire network is highly disconnected, with many much smaller connected components. In fact, there are altogether 1524 connected components (CCs). The size distribution of CCs is shown in Figure 2. The smallest CC contains two vertices, the largest 590 vertices, 566/1524 = 37% contain only two vertices and about 73% contain five or fewer vertices. The median CC size is 3 and the mean 7.8. The top 20 largest CCs are listed in Table 2.

### Degree distribution

The distribution of the degrees of the HMM network is shown in Figure 3. Degree ranges from 1 to 268, with the average of 26 and median of 10. The log-log degree distribution is also shown (Figure 4). It is evident that a power law distribution does not fit the data. The best fitting quadratic curve is also plotted with the data. It provides a relatively good fit for the smaller values of log(degree), and then towards the larger degrees, the fit is not so good.

### Network Density

Density, computed as the number of edges over the number of all possible edges (in a fully connected graph), provides some quantitative evaluation on the connectivity of a network. The density of the entire network is low, only 0.002 . In contrast, individual CCs tend to have high densities (Figure 5), with more than 82.5% of CCs having density greater than 0.95. 1236 CCs are fully connected, i.e., cliques, with the largest clique of size 70. Overall, 566 have size 2, 261 size 3, 140 size 4, 85 size 5, 60 size 6, and 124 sizes greater than 6.

Thus, individual CCs tend to have very high connectivity, whereas the entire network is not well connected. The density of the 20 largest CCs is shown in Table 2. The largest CC with 590 vertices has the lowest density, and the 18th largest CC with 70 vertices has a density of 1, and is therefore a fully connected component. There is a significant negative correlation between CC size and density (Kendall's rank correlation *τ* = -0.43, *p*-value < 2.2 · 10^{-16} for CC size > 2).

### Vertex centrality

Vertex centrality measures the "importance" of a vertex. Two centrality metrics, degree and betweenness, were computed for the vertices in the entire HMM network. The top 20 HMMs that have the highest degrees all belong to the same superfamily, b.1.1, Immunoglobulin, and also to the third largest CC that has 277 vertices. Thus, these 20 HMMs are connected with almost all other HMMs in the third CC. The HMM d1n26a1 (SCOP ID b.1.1.4, (A:1-93)) has the highest degree, 268, belonging to the Interleukin-6 receptor alpha chain, N-terminal domain. Table 3 shows the top 20 HMMs that have the highest betweenness. Thirteen of the 20 HMMs belong to the superfamily c.2.1 (NAD(P)-binding Rossmann-fold domains), two to the superfamily b35.1.2, and two to the superfamily c.37.1. Eighteen of the 20 HMMs belong to the largest CC and the two remaining (c.37.1.14 and c.37.1.11) to the second largest. The HMM d1bg6a2 (SCOP ID c.2.1.6, (A:4-187)) has the highest betweenness, 14916, belonging to N-(1-D-carboxylethyl)-L-norvaline dehydrogenase (Arthrobacter, strain 1c). Interestingly, there is no overlap of HMMs that have the highest of both degree and betweenness.

Because the entire HMM network contains many CCs, among which there are no connections, we computed three centrality measurements (degree, betweenness, and closeness) for the 20 largest CCs. Table 4 lists the two HMMs that have one of the highest centrality measurements. Unlike the observation for the entire network, there is great consistency between HMMs with the highest three centrality measurements, i.e., the same HMMs that have one of the highest centrality measurements, tend to also have the highest other two measurements. For example, for the largest CC, d1bg6a2 is the HMM with the highest betweenness, closeness, and the second highest degree. Because the network has many connected components, examining the importance of vertices for these subnetworks seems to be more meaningful than for the entire network. It is thus very useful to observe that different measurements of vertex centrality give similar results, suggesting that one does not have to be overly concerned with the choice of centrality measurements when determining the important HMMs.

The results show that from the entire network, the vertices with the highest degrees do not necessarily have the highest betweenness, and vice versa. Degree measures how many immediate neighbors one HMM has, and therefore, the more it has, the more central it is. The vertices with the 20 largest degrees are all from the third largest CC, and are connected to about 94% of its vertices. The vertices with the 20 largest betweenness are from either the largest CC or the second largest CC. Since betweenness reflects how essential one vertex is to the connection of any other two vertices in the graph, in the case of HMMs, it may reflect the possibility that one HMM is the *hybrid* of two HMMs, that is, between the two HMMs, there is no significant similarity, but through the one HMM, the HMMs can be linked. Biologically, this idea seems to reflect hybrid or mosaic proteins where one protein contains domains from multiple proteins. To our knowledge, the idea of hybrid HMMs has not been discussed previously and deserves more research attention. Moreover, we hypothesize that the HMMs with high centrality measurements may be better able to pick up the sequences that belong to the superfamily than the more peripheral HMMs. This idea seems to be especially promising considering the observation that the three centrality measurements identify similar sets of vertices within the connected components. Future studies can be directed to test this hypothesis.

### Network diameter

The diameter of the largest CC (containing 590 vertices) is 9. The average distance between the vertices in the component is 2.94. This bears some similarity to the yeast protein interaction network [7], constructed using the protein interaction data from the January 2007 version of the BioGRID database, an online repository for interaction datasets aggregated from both high-throughput data and focused individual studies for the affinity of interacting protein pairs [8, 9]. This protein interaction network consists of 5,151 proteins and 31,201 interactions. Its largest CC (containing 5,128 vertices) also has the same diameter of 9, but a larger average distance of 3.68. Thus, this protein interaction network seems to have more vertices that are a bit more spread out, which contributes to a larger average distance. To this point, it is very interesting that despite the big difference in the sizes of the two CCs of the two networks, the diameters are the same.

We also measured the diameters of all the CCs to see how they change as a function of CC size. Figure 6 shows that larger CCs tend to have larger diameters. However, smaller CCs can have large diameters as well. For example, a CC of size 32 has diameter seven, the same as a CC of size 155; a CC size of 16 has diameter six, the same as a CC of size 121. There are 1236 CCs with diameter 1, corresponding to the number of cliques.

### The effect of e-value cutoff on the network

As the e-value measures the degree of similarity between two HMMs, we examined how changing e-value cutoff affects the general properties of the network, such as the number and sizes of CCs. Figure 7 shows the effect of changing the e-value cutoff on the number of CCs in the network. The number of CCs increases gradually with the more stringent e-value cutoffs, reaching the highest for 10^{-18} (the slight drop for e-value cutoffs of 10^{-19} and 10^{-20} is due to the exclusion of CCs of size 1). Similar patterns are observed when only CCs that are greater than size two, three, and four are considered, generally, the number of CCs increases with more stringent e-value cutoffs. To see what specific sized CC groups are more affected by the stringency of e-value cutoffs, the CC size distribution was also studied as a function of e-value cutoffs. Figure 8 shows that changing e-value cutoff has the largest effect on the number of CCs that are of size two, and the effect reduces greatly for larger sized CCs. With low stringency e-value cutoffs, there are more larger CCs.

Figure 9 shows the sizes of the 20 largest CCs with varying e-value cutoffs. The e-value cutoff has a more pronounced effect on the sizes of the largest CCs than on those of the smaller CCs. For example, there are almost twice as many vertices in the largest CC for e-value cutoff of 0.01 as for 0.001. Thus the low e-value of 0.01 allows the formation of really large CCs that may include some low similarities between HMMs. The number of vertices contained in the same ranked CCs shows less difference after the second largest CC.

### CCs and SCOP hierarchy

Within the CCs, we examined whether the HMM members are from the same family, superfamily, fold, or class. There are altogether 1178 CCs whose members have the same SCOP domain classification (conserved at all hierarchical levels), 271 CCs whose HMMs belong to the same superfamily but to different families, 24 whose members belong to the same fold, but to different superfamilies, 18 whose members belong to the same class but have different folds, and the remaining 33 whose members are from different classes.

The consistency between the prediction of HMM memberships at different hierarchical levels in the SCOP database based on the e-value cutoffs and the classification of the SCOP database was evaluated by ROC curves, shown in Figure 10. We make several observations. First, for all four levels of the hierarchy, the higher the e-value cutoff, the higher the sensitivity (true positive rate), so is the false positive rate, which is expected because higher e-value means a less stringent prediction criterion that in turn leads to a higher number of true positive predictions, and also a higher number of false positive predictions. Meanwhile, the rate of increase in sensitivity outpaces the rate of increase in the false negative rate as the e-value becomes more stringent, suggesting that beyond a certain e-value cutoff, the HMMs belonging to the same hierarchical levels also tend to have high similarity, which make them robust to the e-value cutoff change. Second, the curves for the prediction of fold and superfamily are very similar to each other, indicating that for the same e-value cutoff, the predictions for whether two HMMs belong to the same fold or superfamily are similar. In fact, for the same e-value cutoff, the difference in true positive rate (sensitivity) between the fold and superfamily ROC curves is either 0 or 0.01, and the difference in false positive rate (1-specificity) falls within the narrow range [0.01-0.04]. Third, the prediction quality is the worst for class as compared to the other three levels, with worst sensitivity and specificity for the same e-value cutoffs. This might not be so surprising as classification at the class level is more for convenience than for biological reasons.

Because fold and superfamily show similar classifications, we focused on studying the superfamilies further. In order to see how the superfamilies are represented in terms of connected components, we examined the number of HMMs representing the 1163 superfamilies to see how many CCs the HMMs are dispersed into. Table 5 shows the top ten superfamilies that have the highest number of HMM representations and also the top ten superfamilies that are split into the highest number of CCs. It shows that superfamilies differ in the extent of dispersion of their HMMs, with some superfamilies having really high dispersal, some very low. For example, the superfamily c.69.1 has 106 HMMs, all clustered into the same CC (CC size rank #8). In contrast, a.4.5 has 150 HMMs, but dispersed into 20 CCs. We also computed a dispersal index (the number of CCs/the number of HMMs) for all the superfamilies, and found that the superfamilies with the highest dispersal are dominated by superfamilies that have only one or two HMMs, and the superfamilies with a large number of HMMs tend to have low dispersal, in fact, among the 20 superfamilies with the lowest dispersal, six of them have the largest number of HMMs.

### The working hypothesis

Taking into account the processes that built the HMMs and the hierarchical classification of the HMMs in the SCOP database, we hypothesize that the network should reflect this process, i.e., *the HMMs in a connected component belong to the same family or superfamily more often than expected under a random network connection model*. The results show strong evidence that HMMs in a connected component tend to represent the same family or superfamily. Among the total 1524 CCs, more than 77% have only members from the same family; more than 95% have only members from the same superfamily. Thus, there is overwhelming evidence supporting our working hypothesis that HMMs belonging to the same family or superfamilies tend to cluster together in the network.

However, to formally evaluate this and provide some statistical support, we also simulated 10,000 random networks, while preserving the degree distribution and the number and sizes of connected components. Each random network has the same number of connected components as our original network, and the working hypothesis predicts that the connected components of such a network have a lower degree of conservation in the family and superfamily assignment. Among the 10,000 simulated random networks, the highest proportions of CCs having only members from the same family and superfamily are as low as 0.5% and 0.7%. This shows that in the observed network, the HMMs from the same family or superfamily do have a strong tendency to cluster, agreeing with our working hypothesis.

### Comparison with other networks

It is evident that the HMM network is highly clustered. In fact, its clustering coefficient is 0.85, which, to our knowledge, seems to be the highest among the biological networks that have been studied so far. As shown by Newman [10], the undirected networks that tend to have high clustering coefficients are social networks. For example, the film directors network has a clustering coefficient of 0.20 and coauthorship networks for math, physics, and biology disciplines are 0.15, 0.45, and 0.088, respectively, whereas biological networks such as metabolic network and protein interaction network have only a clustering coefficient of 0.09 and 0.07, respectively [10]. The comparison indicates that the current network has distinct features from the previously characterized real-world networks.

## Conclusions

In this paper, we examined the properties of the network constructed for HMM models in the SCOP protein structural classification database. A number of questions remain to be addressed in future research. For example, can we devise a computational method to measure or evaluate the degree of redundancy or overlap between HMM models that are used to represent the same superfamily? This research is meaningful given the ever increasing number of large-scale genomic sequences (therefore more protein sequences). Given that we can measure the redundancy of the HMMs of a superfamily, the logical question becomes, can we computationally reduce the redundancy of the HMM library, e.g., possibly by constructing super-HMMs, each of which represents a collection of redundant HMMs, so that a protein sequence is scanned against a reduced set of HMMs (super-HMMs) rather than the entire set of HMMs that have overlaps and redundancies? Finally, because the HMM network shows distinct properties from many documented networks as discussed above, can we propose a theoretical model to better account for the observations in the current network? Moreover, as our HMM network is also weighted, with edges quantifying the similarity between two HMMs, future proposed models can also consider the incorporation of weighted edges into the network.

## Methods

The SCOP library of HMMs (scop70_1.75.hhm.tar.gz) was downloaded from the website http://scop.mrc-lmb.cam.ac.uk/scop/count.html#scop-1.75, where the SCOP version was filtered to 70% maximum pairwise sequence identity. The library contains a total of 13,730 HMMs, from seven classes *a, b, c, d, e, f, g*, where class *a* contains only *α* (i.e., *α* helix) proteins, class *b* contains only *β* (i.e., *β* sheet) proteins, class *c* contains *α* and *β* proteins (mainly parallel *β* sheets (*beta - alpha - beta* units)), class *d* contains *α* and *β* proteins (mainly antiparallel *β* sheets, i.e., segregated *α* and *β* regions), class *e* contains multi-domain proteins (i.e., folds consisting of two or more domains belonging to different classes), class *f* contains membrane and cell surface proteins, and class *g* contains small proteins. It is useful to mention that the SCOP domain classification ID specifies the entire hierarchy, e.g. c.1.1.1, the first field is for the class *c*, second for the fold, third for the superfamily, and the last for the family.

HHsearch [6] was performed for all-against-all HMMs with the default parameters. The command used was "hhsearch -i hmm.hhm -d hmmlib.hhm", where hmm.hhm is the query HMM and hmmlib.hhm is the library of all the HMMs. The secondary structure scoring option was not used, as our goal was not to detect remote homology between HMMs and sequences. According to the HHsearch authors, no calibration is necessary, as the HHsearch is performed on the SCOP database. HHsearch, similar to BLAST, uses a query that can be either a protein sequence or an HMM to search a database of sequences or HMMs and identify homology between the query and sequences and HMM models in the databases that is above a given threshold. In the current study, the e-value, a measurement of homology similar to BLAST's e-value, was set to 0.001. This e-value cutoff has also been used by Pfam to identify a Pfam clan [11], which is essentially equivalent to the superfamily hierarchy. A total of 13,547 HMMs have matches that met the criterion, with 1,618 having no other matches except themselves. Thus, 11,929 HMMs were used for the subsequent network analysis.

To study the relationship of the HMMs, an undirected network *G* = (*V*, *E*) was constructed, where the vertices *V* are HMMs, and there is an edge in *E* between two HMMs if their e-value is below the threshold. General network statistics were computed, and a quadratic function was fitted to the log-log degree distribution. Three common vertex centrality measurements, degree centrality, betweenness centrality, and closeness centrality, were computed to evaluate the "importance" of vertices in the network. The degree of a vertex *a* is the number of edges incident on *a*. Betweenness for a vertex *a*,

introduced in Freeman [12], measures roughly the number of shortest paths going through *a* *σ* (*s*, *t*) is the number of shortest paths between vertices *s* and *t*, and *σ* (*s*, *t* | *a*) is the number of shortest paths between vertices *s* and *t* that go through *a*. Thus, the higher the betweenness of a vertex, the more "central"/important the vertex is. In a fully connected network, the betweenness of all vertices is 0.

The closeness centrality measures the number of steps required to access every other vertex from a given vertex, specifically, the closeness of a vertex *a*, *c* (*a*), is computed by

where *d*_{
a, i
} is the length of the shortest path between vertex *a* and vertex *i*. Closeness ranges from 0 (does not reach 0) to 1; the higher it is for a vertex, the more "central" the vertex is. These centrality measurements have different motivations and show different aspects for the importance of vertices in a network.

The network clustering coefficient, C, also known as transitivity, measured by the ratio between the number of triangles and the number of connected triplets, was computed for the entire network. The number of connected components that are trees, where there are *N* vertices but only *N* - 1 edges between the vertices, was computed for the entire network as well.

To systematically study the consistency between the e-value cutoffs for the prediction of whether or not HMMs belong to the same hierarchical level and classification of the SCOP database, we examined the Receiver Operating Characteristic (ROC) curves for the prediction of the hierarchical categories of two HMMs provided by different e-value cutoffs. The ROC curve shows how the true positive rate changes with the false positive rate for a classification. Specifically, for example, at the family level, if a sample of two HMMs were classified to the same family by the SCOP database, the prediction based on a specific e-value cutoff is considered to be a false negative (FN) if the e-value similarity of the two HMMs is worse/higher than the e-value cutoff, a true positive (TP) if the e-value is better (i.e., lower) than the cutoff, if the two HMMs were not classified to the same family by the SCOP database, the prediction based on the specific e-value cutoff is considered to be a true negative (TN) if the e-value similarity of the two HMMs is worse/higher than the e-value cutoff, a false positive (FP) if their e-value is better (i.e., lower) than the cutoff. Similar rules were applied to classify each pair of HMMs into the four categories (TP, FP, FN, and TN), for the four hierarchies, class, fold, superfamily, and family. True positive rate (i.e., sensitivity) was calculated as

and false positive rate (ie., 1 - specificity) as

An ROC curve was plotted for the four levels (i.e., class, fold, superfamily, and family) with different e-value cutoffs ranging from 10^{-20} to 10^{-3}.

## References

- 1.
Andreeva A, Howorth D, Chandonia JM, Brenner SE, Hubbard TJ, Chothia C, Murzin AG: Data growth and its impact on the SCOP database: New developments. Nucleic Acids Res 2008, (36 Database):D419–25.

- 2.
Lo Conte L, Brenner SE, Hubbard TJ, Chothia C, Murzin AG: SCOP database in 2002: Refinements accommodate structural genomics. Nucleic Acids Res 2002, 30: 264–7. 10.1093/nar/30.1.264

- 3.
Murzin AG, Brenner SE, Hubbard T, Chothia C: SCOP: A structural classification of proteins database for the investigation of sequences and structures. J Mol Biol 1995, 247(4):536–40.

- 4.
Gough J, Chothia C: SUPERFAMILY: HMMs representing all proteins of known structure. SCOP sequence searches, alignments and genome assignments. Nucleic Acids Res 2002, 30: 268–72. 10.1093/nar/30.1.268

- 5.
Gough J, Karplus K, Hughey R, Chothia C: Assignment of homology to genome sequences using a library of hidden Markov models that represent all proteins of known structure. J Mol Biol 2001, 313(4):903–19. 10.1006/jmbi.2001.5080

- 6.
Soding J: Protein homology detection by HMM-HMM comparison. Bioinformatics 2005, 21(7):951–60. 10.1093/bioinformatics/bti125

- 7.
Kolaczyk E: Statistical Analysis of Network Data: Methods and Models. New York, Springer; 2009.

- 8.
Stark C, Breitkreutz BJ, Reguly T, Boucher L, Breitkreutz A, Tyers M: BioGRID: a general repository for interaction datasets. Nucleic Acids Res 2006, (34 Database):D535–9.

- 9.
Stark C, Breitkreutz BJ, Chatr-Aryamontri A, Boucher L, Oughtred R, Livstone MS, Nixon J, Van Auken K, Wang X, Shi X, Reguly T, Rust JM, Winter A, Dolinski K, Tyers M: The BioGRID Interaction Database: 2011 update. Nucleic Acids Res 2011, (39 Database):D698–704.

- 10.
Newman ME: Networks: An Introduction. New York, NY, USA: Oxford University Press. Inc; 2010.

- 11.
Finn RD, Mistry J, Schuster-Bockler B, Griffiths-Jones S, Hollich V, Lassmann T, Moxon S, Marshall M, Khanna A, Durbin R, Eddy SR, Sonnhammer EL, Bateman A: Pfam: Clans, web tools and services. Nucleic Acids Res 2006, (34 Database):D247–51.

- 12.
Freeman L: A set of measures of centrality based on betweenness. Sociometry 1977, 40: 35–41. 10.2307/3033543

## Acknowledgements

The authors thank T Murali for discussion. The work was partially supported by USDA 2009-35205-05221 and AFRL Grant FA8650-09-2-3938 and AFOSR Grant FA9550-09-1-0153.

## Author information

## Additional information

### Authors' contributions

LZ, LTW, LSH conceived the research. LZ analyzed the data and wrote the manuscript. LZ, LTW, LSH revised the manuscript. All authors read and approved the final manuscript.

## Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

## Rights and permissions

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## About this article

### Cite this article

Zhang, L., Watson, L.T. & Heath, L.S. A Network of SCOP Hidden Markov Models and Its Analysis.
*BMC Bioinformatics* **12, **191 (2011) doi:10.1186/1471-2105-12-191

Received:

Accepted:

Published:

### Keywords

- Cluster Coefficient
- Protein Interaction Network
- Closeness Centrality
- Vertex Centrality
- High Betweenness