ROC and confusion analysis of structure comparison methods identify the main causes of divergence from manual protein classification
 Vichetra Sam^{1},
 ChinHsien Tai^{2},
 Jean Garnier^{1, 3},
 JeanFrancois Gibrat^{3},
 Byungkook Lee^{2} and
 Peter J Munson^{1}Email author
DOI: 10.1186/147121057206
© Sam et al; licensee BioMed Central Ltd. 2006
Received: 08 November 2005
Accepted: 13 April 2006
Published: 13 April 2006
Abstract
Background
Current classification of protein folds are based, ultimately, on visual inspection of similarities. Previous attempts to use computerized structure comparison methods show only partial agreement with curated databases, but have failed to provide detailed statistical and structural analysis of the causes of these divergences.
Results
We construct a map of similarities/dissimilarities among manually defined protein folds, using a score cutoff value determined by means of the Receiver Operating Characteristics curve. It identifies folds which appear to overlap or to be "confused" with each other by two distinct similarity measures. It also identifies folds which appear inhomogeneous in that they contain apparently dissimilar domains, as measured by both similarity measures. At a low (1%) false positive rate, 25 to 38% of domain pairs in the same SCOP folds do not appear similar. Our results suggest either that some of these folds are defined using criteria other than purely structural consideration or that the similarity measures used do not recognize some relevant aspects of structural similarity in certain cases. Specifically, variations of the "common core" of some folds are severe enough to defeat attempts to automatically detect structural similarity and/or to lead to false detection of similarity between domains in distinct folds. Structures in some folds vary greatly in size because they contain varying numbers of a repeating unit, while similarity scores are quite sensitive to size differences. Structures in different folds may contain similar substructures, which produce false positives. Finally, the common core within a structure may be too small relative to the entire structure, to be recognized as the basis of similarity to another.
Conclusion
A detailed analysis of the entire available protein fold space by two automated similarity methods reveals the extent and the nature of the divergence between the automatically determined similarity/dissimilarity and the manual fold type classifications. Some of the observed divergences can probably be addressed with better structure comparison methods and better automatic, intelligent classification procedures. Others may be intrinsic to the problem, suggesting a continuous rather than discrete protein fold space.
Background
A protein fold is often defined by the number, direction in space and connectivity (or topology) of its secondary structural elements[1] (alpha helices and beta strands). In two major fold databases, the definition of a fold is itself partially ambiguous. In SCOP[2], the definition is "same major number and direction of secondary structures with a same connectivity", without quantification of the term "major". In CATH[3], it is "overall shape and connectivity of the secondary structures", without a precise definition of "shape", although there is a degree of quantitation in this case since a structure comparison score is used to cluster domains in the same fold family. These "soft" definitions are required by the observed variations in the structures between proteins of identical biochemical function as amino acid sequence identities fall below 40%[4].
The situation is complicated by the presence of domains in protein structures. Their identification and delineation are not straightforward. Nevertheless, to have a better understanding of the effect of discrete classification as a description of the fold space, we analyzed the SCOP domain classification using two structure comparison methods applied directly to these domains. Numerous structure comparison methods exist [5–19] and some of them have been used to conduct such analyses. Shapiro & Brutlag[14], Ye & Godzik[17] and Kolodni et al[20] used the Receiver Operating Characteristic (ROC) curve[21, 22] and Sierk & Pearson[23] a variant of it, mainly to compare their own method with other methods, using SCOP or CATH as the gold standard. Getz et al[24] devised an optimization algorithm to automatically classify new domains into existing SCOP folds or CATH topologies. They did not use the ROC curve, and only present the pairwise similarity score matrix. They also noted the existence of folds which are in twilight zone and difficult to classify. Hadley & Jones[25] and Day et al[26] compared 3 classifications: SCOP, CATH and FSSP ranging from completely manual to entirely automatic. They give the coverage, i.e. the percentage of pairs that are common between the 3 classifications, the percentages of pairs that are common to all 3 methods. Hadley and Jones[25] in their analysis briefly described a few examples of structural discrepancies between the automatic method FSSP and the manual and semimanual SCOP and CATH classifications.
Here we use two structure comparison methods which are based on different principles and with which we are familiar. One, VAST[5, 6], is based on only secondary structure elements in its first stage of comparison while the other, SHEBA[16], uses the amino acid sequence along with other structural properties of each residue in its initial step. We first construct the ROC curves using the SCOP fold definitions. We then generate the confusion matrix that results after setting a score cutoff value determined from the ROC curves. We analyze various aspects of this matrix to understand and extract the main properties of the fold space which cause the divergence with the automatic similarity assignment and the manual SCOP classification. Although some of the previous works[14, 17, 20, 23–28] cover portions of what we describe here, none, as exhaustively analyzes and lists the fundamental mechanisms that produce the observed divergences.
Results
ROC curves
An optimal cutoff value for the binary decision of similarity can be determined from the ROC curve either by specifying the desired FPR (False Positive Rate, see Methods) or by specifying the desired TPR (True Positive Rate, see Methods). To reach a 1% FPR, the corresponding cutoff value is 2.5 for Pcli and 2.7 for Zscore (see Methods), with corresponding TPR values of 61.6% and 74.8% for VAST and SHEBA, respectively.
Confusion matrix heat maps
Neither the VAST nor the SHEBA heat map is strictly symmetric (Figure 2); the computed similarity measure depends on which domain is used as query and which as target. SHEBA gives a substantially more asymmetric heat map than VAST. Out of the total of M*(M1) = 21,860,300 domain pairs (excluding identity pairs) on which the heat map is based, VAST and SHEBA have 11,007 and 189,551 asymmetric pairs, respectively. A domain pair similarity score is considered asymmetric if its similarity score exceeds the cutoff value in one comparison, but does not when the query and target structures are exchanged.
VAST uses an heuristic algorithm to find the maximal clique so the comparison of domain A with B may not select the same clique as the comparison of B with A when there are several near maximal cliques. The result is a slight asymmetry in the Pcli Score. The more noticeable asymmetry manifest by SHEBA is due to the Zscore computation which uses the average and the standard deviation of the distribution of mscores between a fixed query domain and all other domains in the database, making the mscore distribution dependent on which domain, A or B, is declared the query domain. Since the average mscore similarity of a query domain A to the database may depend on parts of A which are not matched to B, the average similarity of B to the database might be quite different. Hence the Zscore becomes asymmetric.
False negatives
About 40% of the folds (216) achieve a fold specific true positive rate (TPR_{ i }) above 0.85 for both methods. All classes are nearly proportionally represented in this set. For the exhaustive list of TPR_{ i }obtained by each SCOP fold with VAST and SHEBA, [See Additional file 2].
Folds having domain pairs with undetected similarity by both VAST and SHEBA.
Class  List of folds 

A  a.4(1576/13572), a.118(777/2550), a.39(282/1640), a.60(238/812), a.138(166/272), a.24(77/930), a.1(62/930), a.2(47/272), a.100(39/90), a.25(37/182), a.3(37/992), a.29(25/132), a.26(20/650), a.23(10/20), a.28(10/72), a.69(9/20), a.7(9/342), a.93(8/42), a.102(7/600), a.112(4/20), a.127(4/30), a.35(4/110), a.61(4/30), a.5(3/90), a.55(3/20), a.74(3/272), a.116(2/20), a.126(2/30), a.133(2/20), a.137(2/6), a.64(2/20), a.128(1/42), a.144(1/12), a.27(1/72), a.48(1/6), a.6(1/42). 
B  b.1(2973/57840), b.40(1382/7482), b.34(436/2652), b.82(341/930), b.10(323/1640), b.2(164/702), b.29(163/1056), b.85(91/156), b.43(69/702), b.84(49/182), b.30(32/110), b.50(16/132), b.18(14/552), b.13(12/110), b.35(11/72), b.7(11/182), b.19(10/30), b.6(8/1406), b.80(8/110), b.92(7/56), b.3(6/110), b.60(6/420), b.106(5/6), b.52(4/132), b.49(3/12), b.58(3/20), b.21(2/6), b.45(2/12), b.53(2/6), b.83(2/2). 
C  c.37(6218/14762), c.1(1152/32942), c.55(929/2756), c.26(255/1722), c.52(228/506), c.2(197/9702), c.23(161/4160), c.69(92/2550), c.94(90/600), c.66(87/1190), c.56(38/552), c.47(17/2550), c.58(16/110), c.92(16/110), c.3(13/2070), c.10(12/306), c.53(12/72), c.8(12/90), c.14(9/110), c.51(9/156), c.72(6/210), c.43(4/42), c.61(3/272), c.36(2/342), c.19(1/6), c.63(1/20), c.78(1/132), c.87(1/30), c.9(1/2), c.97(1/12). 
D  d.58(2052/17556), d.92(235/552), d.3(221/380), d.142(164/380), d.15(104/3080), d.169(74/552), d.26(74/306), d.17(59/552), d.81(54/210), d.153(49/600), d.166(42/90), d.211(40/132), d.144(33/650), d.110(26/306), d.129(23/182), d.68(23/90), d.2(22/132), d.14(14/240), d.79(14/210), d.108(12/210), d.16(12/182), d.87(10/156), d.4(8/12), d.104(5/210), d.109(4/182), d.122(4/110), d.143(4/6), d.41(4/90), d.67(4/20), d.10(3/20), d.50(3/72), d.184(2/2), d.52(2/90), d.18(1/2), d.74(1/56), d.82(1/6). 
E  e.8(110/182), e.26(3/6) 
F  f.1(58/110), f.4(46/182), f.21(12/42), f.23(5/20), f.7(4/6). 
G  g.3(357/1406), g.41(96/420), g.15(5/90), g.17(4/132), g.39(2/132). 
Detailed analysis of these false negative pairs highlights some common factors which explain the varying success of automated methods in detecting the similarity among domains in a SCOP fold. Most of the false negatives can be explained by structural variation within a fold and to a lesser extend by structures made of repeating units.
Structural variation of the common core
Structures made of repeating units
Decoration of the common core by many secondary structure elements
Miscellaneous cases
Some folds, such as fold d.184 or a.138, are described in SCOP as including a variety of structures. We also note the existence of several ambiguous fold definitions leading necessarily to a low TPR_{ i }. For instance, fold c.37 whose SCOP description is "3 layers: alpha/beta/alpha, parallel or mixed betasheets of variable sizes", can probably be split into at least 2 folds. We also spotted what appears to be a bookkeeping error by SCOP. Domains d1kkea2 and d1qiua2 of fold b.83 were not found to be similar either by VAST or SHEBA. The protein 1kke has two domains, which belong to two different folds. The Nterminal domain (residues 250–312) forms an extended structure belonging to the SCOP fold b.83 ("Triple betaspiral"). The Cterminal domain (residues 313–455) forms a beta barrel belonging to the SCOP fold b.21 ("Virus attachment protein globular domain"). In SCOP and in the Astral database, the domain d1kkea1, which consists of the residues 250–312, is placed in the b.21 fold and d1kkea2, which consists of residues 313–455, is placed in the b.83 fold.
Differences between VAST and SHEBA
There are 27 folds with a TPR_{ i }below 0.05 by VAST yet above 0.9 by SHEBA. They are a.16, a.37, a.38, a.97, a.115, a.121, a.130, a.158, a.159, b.76, c.107, d.6, d.83, d.88, d.101, d.118, d.175, f.10, f.14, f.17, g.14, g.22, g.24, g.38, g.49, g.50, g.53. These are mainly small folds with only 2 domains each. No fold has been identified with a TPR_{ i }less than 0.05 by SHEBA but above 0.9 by VAST. Additionally, the class specific true positive rates reported in Figure 3, shows an important difference between VAST and SHEBA in the A class (0.37 for VAST and 0.74 for SHEBA).
Some of the differences observed between VAST and SHEBA are related to the calculation of the scoring function in VAST (see Appendix, Calculation of Pcli), and to the fact that structures sharing fewer than 3 secondary structure elements (SSEs) are often judged not significant by VAST. This latter factor also affects true positive rates computed by VAST in the A class, where the TPR_{ i }averages only 0.2 for folds with 2,3 or 4 SSEs, but rises to 0.7 when the fold has about 9 or more SSEs (data not shown). But at least one case could not be explained by the issue of the Pcli calculation. Domains d1h8pa1, d1l6ja3, d1pmla_, d2hpqp_and d2pf1_1, of fold g.14 defined as a disulphiderich fold, scored low in VAST similarity but surprisingly high by SHEBA. These domains have particularly small SSEs, distributed sparsely over the backbone of the structure. It is quite understandable that VAST which relies on the SSEs, finds low similarity among them. It was also observed that pairs for which SHEBA Zscore was high also had a higher level of sequence homology than those for which the SHEBA Zscore was low (data not shown). This indicates that SHEBA benefited by using the sequence homology in finding the initial alignment (see the Methods).
False positives
The offdiagonal pixels in the heat maps, on Figure 2, represent fold pairs having a nonzero foldspecific false positive rate FPR_{i,j}. The confusion made by each method has different characteristics, shown by the difference in the distribution of the dark areas. There are a relatively small number of pixels between classes. In contrast, confusion within each class varies with the method and can be high.
The main confusion is within classes B, C and D, with respectively 37 folds out of 78 within B class, 80 folds out of 94 within class C, and 53 folds out of 139 within class D, involved in some type of confusion. VAST does not show a noticeable level of confusion within classes A, and F, although SHEBA does. The relatively high Aclass confusion level for SHEBA is probably related to its use of the dynamic programming algorithm, without gap penalty, in finding the best alignment between a pair of superimposed structures[16].
Besides these global observations, more specific confusion trends can be determined by analyzing the predominant confusion patterns shown by the heat maps.
Intraclass confusion
Confused folds occur mainly near the diagonal of the sorted heat map, as a result of the hierarchal clustering and reordering of the folds within each fold class (see Methods).
Sets of folds confused by both VAST and SHEBA.
Sets of confused folds, S  Number of domains in S  Sheba FPR_{ S }(%)  Sheba TPR_{ S }(%)  Sheba FPR_{S}/TPR_{S}(%)  Vast FPR_{ S }(%)  Vast TPR_{ S }(%)  Vast FPR_{S}/TPR_{S}(%)  Explanation for confusion  

1  a.28, a.39  50  29  57  51  10  16  64  4 helix bundle upanddown (a.28), and 4 helix array of 2 hairpins folds. Confusion is caused by match of helices oriented similarly. Folds confused mostly by SHEBA. 
2  a.46, a.52  9  45  97  46  7  36  20  4 helix bundle left and righthanded super helix (a.46), and 4 helix righthanded super helix folds. Confusion is caused by match of helices oriented similarly. Folds confused mostly by SHEBA. 
3  a.47, a.7  24  87  88  98  8  20  40  3 helix bundle (a.7) and 4 helix bundle (a.47) folds. Confusion due to match of very similar structure. Folds confused mostly by SHEBA. 
4  b.68, b.69, b.66, b.67, b.70  45  92  98  94  40  83  48  Betapropellers (repetitive 4stranded blades) folds, of 4, 5, 6, 7 or 8 blades depending on the fold. Confusion is caused by match of several 4stranded blades among domains of these folds. 
5  b.1, b.2, b.3, b.7, b.12.  297  19  66  29  32  68  48  Beta sandwich folds of 7, 8, 9 strandedsheet, with Greekkey topology. The motif causing the confusion among folds is a sandwich, which is rather well matched between domains of these folds. 
6  b.24, b.71  24  69  97  72  27  93  29  Sandwich fold, with 10 strands in 2 sheets, and "folded meander topology" fold (b.24), and folded sheet with Greekkey topology. Confusion is due to match of parts of the sheets of the common core of these folds. 
7  b.60, b.61  30  63  90  70  57  78  74  Closed barrel, with meander topology. Confusion caused by good match of between barrel motifs of the common core. 
8  b.43, b.49, b.58, b.44  39  42  71  59  32  72  44  Folds of closed barrel with Greekkey topology. Confusion is due the match of substantial part of the barrel common core, among domains of these folds. 
9  b.107, b.4  4  100  100  100  25  100  25  Sandwich fold (b.4), and closed barrel fold (b.107). Confusion is caused by the good match between a deformed barrel motif and a sandwich motif. 
10  b.34, b.38  62  69  67  103  19  49  39  Barrel folds, with meander topology. Confusion is caused by the match between the barrel common cores. 
11  b.38, b.56  12  52  100  52  65  93  70  Open barrel (b.38) and closed barrel (b.56) folds. Confusion is caused by the match of the barrel. 
12  b.10, b.19, b.13, b.18, b.22, b.23  91  42  76  55  16  54  29  Folds with common core motif of beta sandwich; the 2 sheets are made of 8, 9 or 10 strands depending on the fold, and with jelly roll topology. The confusion among these folds is caused by the match of the strands of the beta sandwich common core. 
13  c.1, c.6  185  62  75  83  78  87  90  TIM barrel (c.1) and variant of beta/alpha barrel, with closed parallel betasheet barrel (c.6) folds. Confusion is caused by the match of almost the whole TIM barrel. 
14  c.8, c.98  14  50  75  68  30  54  56  3 layer beta/beta/alpha (c.8) and 3 layer alpha/beta/alpha (c.98) folds. Confusion is caused by the match between common beta/alpha layers. 
15  c.84, c.95  19  65  91  71  55  92  60  3 layer alpha/beta/alpha of 4 strands (c.84), and of 5 strands (c.95) folds. Match of the 3 layer alpha/beta/alpha common core causes the confusion. 
16  c.101, c.73, c.27  7  11  100  11  49  100  49  3 layer alpha/beta/alpha folds, with 5, 6 or 8 strands depending on the fold. Confusion is caused by the match of the 3 layer alpha/beta/alpha common core. 
17  c.100, c.28, c.25, c.24, c.30, c.78, c.108, c.116, c.31, c.114, c.3, c.4, c.49, c.59, c.16, c.57, c.44, c.48, c.2, c.33, c.32, c.34, c.23, c.62, c.65, c.5  334  24  80  31  51  92  56  3 layer alpha/beta/alpha folds, with beta sheet of 4, 5, 6 or 7 strands depending of the fold. 3 layer beta/beta/alpha with central of 5 strands for c.3. Confusion among 3 layer alpha/beta/alpha folds is caused by the match of the 3 layer alpha/beta/alpha common core. Confusion between 3 layer alpha/beta/alpha and beta/beta/alpha is caused by the match of the 2 layer beta/alpha. 
18  d.13, d.173  7  26  93  28  43  86  50  Fold containing the 3 layer alpha/beta/alpha common core (d.130 and unusual fold containing a common core of betaalphabetaalphabetaalphabeta (d.173). Confusion caused by the match of some strands and helices. 
19  d.65, d.67  7  47  46  102  60  64  93  2 layer alpha/beta sandwich fold. Confusion caused by the match of 2 layer alpha/beta sandwich common core. 
20  d.181, d.212  5  50  60  83  17  60  28  Folds containing betaalphabeta units. Confusion caused by match on the alpha/beta layers. 
21  d.10, d.50  14  34  66  51  40  61  66  2 layer alpha/beta folds. Confusion caused by match on the 2 layer alpha/beta common cores. 
22  d.140, d.68  12  34  68  51  40  52  77  Fold with 2 layer beta/alpha sandwich common core. Confusion is caused by match of the 2 layer beta/alpha sandwich. 
23  d.151, d.160  7  75  100  75  58  100  58  Betasandwich; duplication of alpha+beta (d.151), 4 layers: alpha/beta/beta/alpha; mixed beta sheets (d.160) folds. Confusion due to match of the alpha beta sandwich. 
24  d.95, d.206, d.64  12  18  96  18  34  79  43  2 layer alpha/beta sandwich folds. Confusion caused by the match of the 2 layer alpha/beta sandwich. 
25  d.11, d.40  5  100  100  100  67  100  67  2 layer alpha/beta sandwich folds. Confusion caused by match of the 2 layer alpha/beta sandwich. 
26  d.130, d.80, d.52  19  53  90  59  51  62  82  2 layer alpha/beta sandwich folds. Confusion is caused by the match of the 2 layer alpha/beta sandwich. 
27  d.45, d.74, d.58, d.51, d.94, d.141, d.105  160  43  58  74  48  59  81  2 layer alpha/beta sandwich, and two betasheets and one alphahelix packed around single core (d.141) folds. Confusion caused by match of the sheet and strands of the 2 layer alpha/beta sandwich core motif. 
28  e.24, c.16, c.57, c.44, c.23, c.5  79  47  73  64  68  85  80  A domain component of a "multidomain" domain of fold e.24 can matches the full domain of another fold which does not belong to the E class 
29  e.4, c.48, c.2, c.32, c.33, c.34, c.23  178  35  74  48  74  87  85  A domain component of a "multidomain" domain of fold e.4 matches the full domain of another fold which does not belong to the E class 
Confused folds in the A class include helix bundles of either identical or a similar number of helices in similar relative orientations. Examples are reported in Table 2, rows 1, 2 and 3. The close similarity of some domain pairs, for example d1m7ka_ and d1hs7a_ belonging to folds a.7 and a.47, respectively, indicates that these "confusions" appear to be cases wherein SCOP includes considerations other than purely structural similarity/dissimilarity.
The next cluster of five folds in Figure 7 (Table 2, row 5), includes all beta sandwich immunoglobulinlike folds, with 7, 8 or 9 strands in 2 sheets with a Greekkey topology. Their confusion is caused by the sharing of the motif of the beta sandwich of the common core. Others confused sets of folds in the B class also involve mainly beta sandwich folds (Table 2, rows 6, 9, and 12), or beta barrel folds (Table 2, rows 7, 8, 10 and 11). The confusion among domains of these clusters of folds is similarly caused by a common beta sandwich or beta barrel motif. In the B class, where folds defined by the beta barrel or the beta sandwich motifs are frequent, confusion among folds of either motif is frequent as well.
The C class also shows some small confused sets among folds with different architectures. For example, confused folds c.1 and c.6 (Table 2, row 13) correspond respectively to TIM betaalpha barrel and variants having 7 strands or less. Confused folds c.8 and c.98 (Table 2, row 14) are described respectively as "3 layers: beta/beta/alpha; the central sheet is parallel, and the other one is antiparallel" and "core: 3 layers, alpha/beta/alpha; parallel betasheet of 4 strands". The confusion occurs due to a common beta/alpha substructure.
Interclass confusion
Finally, the heat maps also show offdiagonal grey or black pixels where members of a SCOP fold in one class are detected as similar to domains in another. Both heat maps present such confusion patterns. As apparent in Figure 2, the confusion between classes is very low for both methods. Nevertheless, it is still detectable between some classes, in particular, between classes B and D, C and D, C and E, and between D and G. For VAST, there is no additional noticeable confusion between classes. However SHEBA shows additional minor confusion of the class A with the classes B, C, D, F, and G, and between classes D and F.
The confusions involving the Eclass ("Folds consisting of two or more domains belonging to different classes") are easily understandable. They all involve structures which contain a domain which shares similarity with another domain in a different class, mainly class C. Examples include fold e.24 confused with c.16, c.57, c.44, c.23 and c.5, (Table 2, row 28), and fold e.4 confused with folds c.48, c.2, c.32, c.33, c.34 and c.23, (Table 2, row 29).
Additionally, SHEBA confuses some folds from class A, with folds in classes D and F ("membrane proteins"). The most confused folds from the A and D classes, having more than 100 confused domain pairs, are: (a.118, d.211: 250 confused pairs), (a.60, d.58: 132), (a.1, d.58: 118), (a.77, d.58: 114), (a.6, d.58: 104), (a.4, d.95: 104). For confused folds a.118 and d.211, for example, even though VAST and SHEBA match a similar number of residues, the Sheba Zscore tends to be high while the VAST Pcli is below the cutoff value. A similar trend is observed between the A and F classes. The way the Zscore is computed has the tendency to increase the confusion, by overemphasizing the significance of the match, compared to the number of matched residues when helices are matched.
Discussion
The combined use of the ROC curve and the confusion matrix heat map has been the key in making this large scale analysis of protein classification. Several authors[14, 17, 20, 23] have used the ROC curve to evaluate structure comparison methods using the CATH or SCOP protein classification database as the reference. In the most recent and comprehensive study, Kolodny et al[20] compared six different methods and found the highest true positive rate to be 50%, at 1% false positive rate, attained by the DALI method using the native DALI score and CATH as the reference. Our ROC analysis finds a true positive rate of 61.6% and 74.8% at 1% false positive rate, for the comparisons of VAST and SHEBA to SCOP, respectively. The differences between their result and ours might be explained by differences between the comparison methods (DALI, VAST, SHEBA), by differences between the definitions used for the false and true positive rates (they do not give explicit equations), and/or by the use of different databases of protein structures (CATH vs. SCOP). In particular, CATH groups domains into different numbers of folds than does SCOP, as noted by Hadley & Jones[25] and Day et al[26].
Aside from providing a global measure of the agreement, ROC curves are also useful because they provide a practical means to select a score cutoff value for deciding if a pair of structures is to be considered similar or not, by trading off true and false positive rates. Other approaches have used methods other than ROC analysis or have ignored that tradeoff entirely. In their comparison of several structure comparison methods with CATH, Sierk and Pearson[23] selected a decision level corresponding to the first 100 errors made by the program. Other approaches [24–28] do not use the ROC curve and often fail to properly acknowledge the obligatory trade off between false and true positive rates, making it difficult to compare the reported degree of agreement with others.
Although the ROC AUC varies somewhat by method, none of the reported values are high as desired. This raises a fundamental and important question: What mechanisms cause the automatic structural comparison methods to diverge so significantly from SCOP or CATH? To address this aspect of the problem, we need to descend from a global view of the database to a more detailed view of individual folds and finally of the domains comprising each fold. To investigate why structural comparison methods diverge from SCOP, we used the confusion matrix to distribute the 1% false positive comparisons to the individual fold pairs, resulting in a "false and true positive rates" map of the protein fold space. This can be distinguished from the map of the fold space constructed by Hou et al.[31, 32] who applied multidimensional scaling to pairwise similarity scores. The exploration of the fold space, guided by our map, leads directly and objectively to the areas or subsets of folds where divergence with structural comparison methods is most evident. In particular, it has allowed us to move from the areas of high false positive or negative rates to the corresponding properties of the fold space. False negative rates are seen to relate directly to the issues of core variation and repeated substructures within a fold, while false positive rates are linked to the sharing of a common substructure between folds. Since the mathematical quantities FPR and TPR are interdependent, so are the corresponding properties of the folds space.
In looking at a particular area of our heat map, we can calculate an index of how likely a method is to confuse those folds, as the ratio of the average of foldspecific false positive rates to the average foldspecific true positive rate in that area. A value near 1 indicates that the folds in this area cannot be distinguished by the structure comparison method, on the average. It is worth noting that this index is cutoff dependent, as expressed in terms of true and false positive rates, and can thus be obtained for more or less severe false positive rates. The index of confusion is related but distinct from the index of "gregariousness" in Harrison et al.[13] for the CATH folds (topology level), which is a property of a fold that measures the number of other folds that are similar to it as judged by comparing the score to that of an empirically established standard score distribution at a certain cutoff level. The substantial number of highly confused sets of folds listed in Table 2 allows us to examine in detail the source of the discrepancy between SCOP and our structure comparison methods.
Causes of false negatives and false positives
In the Results section we presented several examples of false negative and false positive cases related in one way or another to the common core. SCOP defines the common core of domains in the same fold to have the "same secondary structure elements in the same arrangement with the same topological connections" (Brenner et al[29]), leaving open the possibility for some variation such as differences in length, relative orientations and/or number of the SSEs which we call variation of the common core.
Variation of the common core of domains within a fold, considered insignificant by SCOP, may still be large enough to cause VAST and SHEBA to find the domains dissimilar, giving rise to false negatives as in Figures 4 and 5. False negatives may also occur when the common core is so small compared to the whole structure that the overall structural similarity is unrecognizable, as in Figure 6. The evidence of structural variations of the common core of proteins within the same fold was shown in the work by Chothia & Lesk[4]. When the percentage of sequence identity between domains decreases much below 40%, their common cores tend to diverge structurally. The analysis of the confusion matrix shows that some false negatives for folds reported in Table 1 arise from such core structure variations.
When two domains share an apparent common core, but SCOP judges the core elements to be significantly different, SCOP places the domains in distinct folds. However, the automatic methods may find the domains similar, as in Figure 9 and 11, giving rise to false positives. Also, conversely to the case in Figure 5, when the repeats of a common motif are organized in a regular fashion in a domain, our methods may consider the domains similar, but SCOP may place them in distinct folds (see Figure 8). Table 2 enumerates a number of false positive cases arising from closely related common cores in distinct SCOP folds.
VAST and SHEBA decide on the similarity on the basis of the largest fraction of matching secondary structural elements or residues. However, visual inspection may allow the overall context of the matching and mismatching parts to play a role. If only a small part matches, but the matching part appears to be the core of each structure, then the match may appear more meaningful. If the number of repeats in a structure appears to be an important property of the structure, structures with different numbers of repeats may be placed in different folds. If, on the other hand, the precise number of repeats is not important for a structure, structures with different numbers of repeats are all placed in the same fold. If almost all parts match, but some important part, perhaps one critical betastrand or even an irregular loop, is missing or placed differently in one structure, it may be placed in a different fold, etc.
It is possible that the problem is rooted in part, in the way structural alignment is currently conceived. Analogous to sequence alignment methodology, structural alignment maximizes the match between two structures, at the residue or secondary structure level, to infer a similarity relationship. On the other hand, the concept of similarity implicitly defined by SCOP, is focused on the sharing of higher level (above SSEs) motifs. This is in contrast to similarity measures based on the residue or SSElevel matches as defined by many structure comparison methods. We have shown examples (beta propellers, or alphasolenoids) where occurrence of a motif is more appropriate for inferring similarity than is the maximum residue or SSElevel structural match. Although not evaluated directly here, we suspect that the structural comparison methods agree with SCOP when these two concepts agree, i.e. when the motif in question coincides with the maximum residue or SSElevel structural match, but disagree otherwise. Automatic structural similarity measures might thus be improved either by incorporating higher level structural motifs such as barrels or sheets, rather than remaining at the level of residues, strands or helices, or by weighting matching residues according to their structural context or functional importance.
Problems encountered by structural comparison methods might also be a reflection of intrinsic properties of the protein fold space. We have reported examples which tend to support the idea of structural drift [33], i.e. a series of gradual steps which connect one fold with another, and showed areas where folds were highly confused. In such sets of folds, some structures within the same fold are too dissimilar to be detectable by structural comparison methods, while those in different folds are not always completely distinct. This raises questions about the fold definition. We have observed, for example, that distinction between beta barrel and two layer betasandwich domains can be surprisingly difficult. As the relative orientations of the strands in the two beta sheets in a barrel departs from orthogonality, and become more parallel, the distinction between barrel and two layer beta sandwich motifs becomes fuzzy. Drawing the proper separations within a set of domains in which such phenomenon is observed is not obvious and necessarily introduces some arbitrariness. Should such diverse folds be subdivided into two, three or more folds? If this decision is taken at some point in time, with the then available structures, how stable and universal will this distinction remain over time? VAST and SHEBA are generally well able to a major part reproduce the fold classification of SCOP, consistent with the notion that protein folds are welldefined, discrete entities. However, despite many attempts, SCOP folds or CATH topologies continue to elude precise quantitative or computational definition. We suggest therefore, that for some parts of the fold space, folds are not well separated entities but more nearly a continuum of structural arrangements as also observed in [1, 3, 34–36], with some regions more populous than others. Here, apparent "folds" may arise as much from density fluctuations in regions where experimentally determined structures are sparse, as from thermodynamic stability wells which would partition the fold space. We speculate that the idea of continuum will become more apparent as a larger number of new structures are solved by structural genomics projects[31]. In any case, the classification of structures into folds is probably a valuable and practical way of describing the fold space. When the fold space is continuous, this necessitates some arbitrary classification decisions, which may in fact not be completely reproducible by any automated approach.
Conclusion
The results of this comprehensive comparison of VAST and SHEBA with the SCOP classification demonstrate that these two methods in their present form can reproduce at best 75% of the SCOP fold classification (for 1% false positive rate). Our detailed study of over 20 million pairs of protein domains underlines the difficulties encountered by automatic methods analyzing a classification of protein structures. A major difficulty arises from structural variation, which naturally accompanies amino acid sequence divergence, within the core of a defined fold. When severe enough, this can produce false negatives. When common cores of different folds are too similar, false positives result. Another, though less common, difficulty also arises when a motif is repeated several times within a single domain and in variable numbers. When the defining "common core" corresponds to only a small part of a whole structure, when the core is decorated extensively, automatic recognition of its similarity to other fold members becomes difficult. These divergences suggest a continuous rather than a discrete protein fold space, further complicating the problem of automatic classification. Clearly, improved algorithms of comparison must be developed and/or other types of classifications must be considered, and will be considered in future work.
Methods
Structural comparison methods
VAST is a method to superimpose and compare protein 3D structures. It consists of a two stage procedure. The first stage is based on a highlevel description of protein structures. Secondary Structure Elements (SSEs) are represented by vectors and an algorithm based on a maximum clique search which finds the best onetoone correspondence of a set of vectors in a query structure to a set of vectors in a target structure. Special care is paid to the significance of the onetoone correspondence found between the two 3D structures. The method calculates the probability of generating a similar onetoone correspondence by chance, and then correspondences are ranked and selected according to the value of this probability. Results of the first stage are used as seeds for the second stage.
In the second stage proteins are described using the alpha carbons (CAs) of the residues. The algorithm, based on a GibbsMonte Carlo procedure, tries to extend alignment of the initial seed to CAs belonging to the connecting loops. Usually, one wants to find the alignment that includes the maximum number of CAs yet with the smallest root mean square deviation (RMSD) value possible. Unfortunately, there is a correlation between the number of CAs included in the alignment and the value of RMSD: the larger the number of residues the higher the resulting RMSD value. The algorithm, in this second stage intended to solve this problem by answering questions such as: which alignment, one having 60 superimposed residues with a RMSD of 2.0, or one having 80 superimposed residues with a RMSD of 2.5 is the best one? This question is settled by choosing the alignment least likely to occur by chance, based on a Zscore calculation with respect to random distributions of the RMSD (see Appendix for more details). Please note that the VAST program we use is homologous to the version that can be downloaded at NCBI[37] (they both descent from a common ancestor[5, 6]). The original VAST source code includes S+ subroutines. In this version, these subroutines were reimplemented in C language and regular PDB files can be used as input. It can be downloaded at VAST INRA server [38]. No other changes were made from the original version.
SHEBA is a protein structure comparison program which performs pairwise protein structure alignment in two steps. The initial alignment is made by maximizing the weighted sum of scores for the sequence homology, secondary structural similarity, and the similarity of the environment profile. The environment profile includes the solvent accessibility and polarity of the atoms around a given residue. The alignment is then iteratively refined in the second step, in which a new alignment is obtained from the threedimensionally superimposed structures based on the current alignment, using a dynamic programming procedure that maximizes the number of residue pairs for which the CAs distance is less than 3.5 Å.
For each pair of proteins compared, SHEBA computes the m score defined as the number of matched residues divided by the mean length of the two protein domains. When one protein is compared to each protein in a database of target proteins, SHEBA also computes the Zscore computed from the score m as
where <m> and σ(m) are the mean and the standard deviation of the scores m between the same query domain and all other target domains in the database. SHEBA source code can be downloaded at SHEBA server[39].
Analysis of structure comparison methods
We consider a set of protein structural domains, D, and a collection of N folds {F_{ i }} of the SCOP classification. Structural similarity of a query domain q to a target domain t is declared when q and t are members of the same SCOP fold. In other words, given a query q, we say that q is similar to (or SCOPsimilar to) another domain t if and only if q ∈ F_{ i }and t ∈ F_{ i }, for some SCOP fold F_{ i }. Under this definition, structural similarity is an allornone phenomenon, as judged by SCOP, used as the reference.
Structure comparison methods are said to detect the structural similarity between a query domain q and a target domain t when the value of the computed similarity score S(q,t) (Pcli for VAST and Zscore for SHEBA) is above a prespecified cutoff value. Formally, domain q is detected as structurally similar to t if and only if S(q, t) ≥ c, for some fixed cutoff value c.
We proceed as follow. First, the similarity scores S(q,t) for every q ∈ D and every t ∈ D, are calculated by VAST and SHEBA. Then, the overall accuracy of detection of structural similarity, compared to SCOP fold similarity is evaluated using ROC methodology, for structure comparison methods VAST and SHEBA, excluding similarity scores for q≡t. Finally, divergences between structural similarities measured by either structure comparison methods, and the SCOP classification are investigated using a heat map representation of the confusion matrix.
ROC analysis
The four possible outcomes of ROC analysis for a particular domain.
Domain q is in the same SCOP fold as t  Domain q is not in the same fold as t  

Domain q is detected as similar to t  True Positive  False Positive 
Domain q is not detected as similar to t  False Negative  True Negative 
The True Positive Rate, TPR(c), the overall rate that a domain q is correctly detected to be similar to another domain is calculated first by comparing that domain to all other domains in its fold, then averaging this rate over all domains in the dataset D. Formally,
where M is the total number of structural domains in the dataset D, N is the number of folds (we consider only folds with n_{ i }>1), n_{ i }is the number of domains within a fold F_{ i }, and I(≺) is the indicator function, i.e. I(TRUE) = 1 and I(FALSE) = 0. TPR(c) is also the sensitivity of the method for SCOP.
Likewise, the False Positive Rate, the rate at which a domain q is falsely detected to be similar to another domain, is
The specificity of the method for SCOP is [1  FPR(c)].
The ROC curve and the area under the ROC curve
The ROC curve is obtained by plotting the True Positive Rate TPR(c) against the False Positive Rate FPR(c), for the entire range of possible cutoff values, c. On this plot, the line through the origin with slope 1 would correspond to the performance of a similarity detection based on a random similarity score. A method which detects SCOP similarity better than randomly must show a ROC curve situated above this diagonal. The overall performance of either VAST or SHEBA in detecting SCOP fold similarity can be measured by the area under the ROC curve (AUC)[21, 22], where a perfect detection method would yield AUC = 1 and a random prediction AUC = 0.5. The area is estimated using the trapezoid integration rule. Strictly speaking, we are presenting an average of the ROC curves for each individual foldrecognition problem, where the average is taken with the cutoff value, c, in common.
Confusion matrix heat map
The performance of a similarity detection method can be studied within specific folds or fold pairs. Thus, we define a fold specific false positive rate between two different folds, FPR_{i,j}(c) as the rate at which query domains in F_{ i }are detected to be similar to target domains in F_{ j }. We estimate this rate from our data as
We see this as a confusion in the similarity detection.
When i = j, we define the foldspecific true positive rate for domains in the same fold F_{ i }, estimated as
The confusion matrix, defined by TPR_{ i }(c) for i = j and by FPR_{i,j}(c) otherwise, for a particular value of c, can be visualized graphically as a heat map, with values of the matrix coded in grey scale (1 = black, 0 = white). To emphasize underlying patterns of confusion amongst the folds, the order of rows and columns (corresponding to the folds of SCOP) is permuted within fold class using hierarchical cluster analysis of the columns of the VAST heat map for class C and of the SHEBA heat map for the other classes. The hierarchical clustering was based on correlation between columns, and used Ward's method, as implemented in the Matlab Statistics toolbox (The Mathworks, Natick, MA). The same ordering of folds was then applied to the rows and columns of the confusion matrix heat map for both methods. Visually, the main diagonal of the heat map shows the agreement between SCOP and the structure comparison/similarity method, while the offdiagonal shows areas of confusion made by each structure comparison method in detecting SCOP fold similarity. The overall, global properties based on the entire set of SCOP folds may be appreciated by viewing the entire heat map, while particular properties of subsets of folds may be viewed by zooming into particular areas. Sets of confused folds may be quickly recognized and identified in this manner.
The TPR(c)(eq. 1) can be computed as the average of the TPR_{ i }(c) weighted by fold size, $\frac{1}{M}{\displaystyle \sum _{i=1}^{N}{n}_{i}TP{R}_{i}\left(c\right)}$. Likewise the FPR(c)(eq. 2) can be computed as the fold sizeweighted average of the fold specific false positive rate, $\frac{1}{M}{\displaystyle \sum _{i=1}^{N}\frac{{n}_{i}}{M{n}_{i}}}\left({\displaystyle \sum _{j=1;j\ne i}^{N}{n}_{j}FP{R}_{i,j}\left(c\right)}\right)$.
The true positive rate averaged over a subset of folds, S, is defined by
where M_{ s }is the total number of domains represented in set S. Likewise, the false positive rate averaged over a subset of folds is defined
A fold confusion index may be defined as the ratio FPR_{ S }/TPR_{ S }for a set S of folds. When the index has a value near 1.0, it means that domains in the same fold are no more distinguishable than domains in different folds, using that particular cutoff value.
An alternate, but straightforward definition of the TPR(c) could be obtained by counting all correctly detected similarappearing pairs divided by the total number of pairs in the same SCOP folds. This alternate definition would in fact weight the foldspecific TPR_{ i }(c) (eq. 4) according to the square of the fold size, thus overweighting the domains in large folds compared to those in small folds. Our preferred definition, given in the equation above, weights each domain, not each domain pair, equally. The confusion matrix computed for this study and the corresponding MATLAB code is available at MSCL server [40].
Datasets
The set of SCOP domains considered here are drawn from ASTRAL[41] version 1.63, with less that 40% pairwise sequence identity. The total number of domains in that sample is 4948, classified by SCOP into 740 folds. As more than one domain is required to evaluate the foldspecific TPR_{ i }, we study only the reduced data set of 468 folds containing 2 or more domains, which together contain M = 4676 domains. The sum of the squares of their respective content $\sum _{i}{n}_{i}^{2}$ is 226,900. The folds fall into classes A (all alpha helix proteins), B (all beta sheet proteins), C (alpha and beta proteins, alpha/beta), D(alpha and beta proteins, alpha+beta), E(multidomain proteins, alpha and beta), F(membrane and cell surface proteins and peptides) and G(small proteins) with 97, 78, 94, 139, 18, 17 and 25 folds each, respectively. The classes hold 844, 1091, 1330, 1070, 80, 67 and 194 domains each respectively.
All domain pairs drawn from the reduced dataset were compared by both VAST and SHEBA, corresponding to a total number of pairs of M*(M  1) = 21,860,300, excluding identity pairs. The calculations were made using the highperformance computational capabilities of the Biowulf PC/Linux cluster at the National Institutes of Health, Bethesda, Md.[42]. Data resulting from the computations were used to produce two large matrices containing the Zscore, the Pcli score, respectively. For pairs of domains for which VAST could not assign a quantitative measure of similarity the Pcli value was arbitrarily set to 10.
Appendix. VAST statistics: calculation of Pcli
In the first stage of VAST we consider a "high" level description of proteins. Proteins are represented by their secondary structure elements (SSEs), more specifically by the endpoints of vectors going through these SSEs. The basic task of the algorithm is to find the best 3D common substructure.
A 3D common substructure is formally defined as a onetoone correspondence between a subset of SSE vectors in the first protein and a subset of the SSE vectors in the second protein. This correspondence respects the type of SSE (i.e., helices are only paired with helices and strands with strands) and the topology. A correspondence {(i,k),(j,l)} of SSEs i and j in the first protein with SSEs j and k in the second, is said to respect the topology when i<j implies k<l. For instance, if SSEs 1 and 2 in the first protein and SSEs 4 and 7 in the second protein are paired 1–4 and 2–7, the correspondence respects the topology. The correspondence 1–7 and 2–4 does not.
Computation of the score for a common 3D substructure
The problem of searching for 3D common substructures is next transformed into a graph theory problem. A "comparison" graph is formed whose vertices are made of pairs of vectors, one from each protein to be compared. Two such vertices are connected by an edge if the two vectors in the first protein have the same relative orientation and spacing, within some tolerance, as the two vectors in the second. Each edge is labeled by a score s, reflecting the quality of the superimposition of the 2 pairs of vectors. Finding the best 3D common substructure is solved by finding the clique (i.e., a subgraph for which each vertex is linked with all others) with the best overall score. The overall score is defined as a normalized sum of scores for all the edges within the clique. The n vertices of a clique (an nclique) are labeled by i and j, and the overall score is defined:
Computation of the score for a 2clique
The 2clique score, s, is computed from the RMSD of the superimposition of the two corresponding pairs of vectors. The RMSD is normalized to an observed distribution of such values obtained from a large sample of random pairings of 2 SSEs from pairs of proteins drawn from a representative set of proteins. This empirical distribution represents the behavior of random pairing of two secondary structures, when there is presumably no overall structural similarity between the two proteins. By definition, we set s = log_{10} (P) where P is the empirical cumulative distribution function (cdf) value associated with the particular RMSD value. For instance if the RMSD is found to be 5.8 Å when the 2 pairs of vectors are superimposed, the probability P that the RMSD is less than or equal to 5.8 can be read off the curve as, say, P = 0.2. The score is then defined as minus the log of this probability: s = log_{10}(.2) = 0.7. Therefore the smaller the RMSD between the 2 pairs of SSEs the larger the resulting score.
Computing the probability distribution for the best nclique score
In the previous section, P represented the cdf value of the RMSD of a random 2clique. Accordingly, P has a uniform distribution and its score (log_{10}(P)/2.303) has a negative exponential distribution, after dividing by the natural logarithm of 10, ln(10) ≈ 2.303. Rewriting in terms of natural logarithms, we have score(n  clique) = $\frac{2}{2.303n}{\displaystyle \sum _{i=1}^{n}{\displaystyle \sum _{j>i}^{n}\mathrm{ln}\phantom{\rule{0.25em}{0ex}}\left({P}_{ij}\right)}}$. Since this is a sum of n(n  1)/2 independent exponential variates, multiplied by the factor 2/2.303n, it follows a classical Gamma distribution with parameters α = n(n  1)/2 and β = 2/2.303n.
For example, assume that we found a common 3D substructure between 2 proteins, and it is a 6clique with a score of 9.6. In order to determine the significance of this score one must compare it with a distribution of scores for randomly generated 6cliques. The mean of the 6clique score distribution is given by α·β = (61)/2.303 ≈ 2.171, 5 times larger than the mean of a 2clique score, 0.434. As n grows, the distributions become broader and more symmetric. Having calculated the score probability density distribution for a 6clique, it is then easy to estimate the significance of the score obtained for our 6clique found while comparing the 2 proteins. The corresponding cumulative probability distribution is calculated and used to compute the probability that a random score is = 9.6. This probability is written Q(s,n) = 1  P(s,n) where s and n refer respectively to the score and the number of elements of the clique.
Number of ncliques that can be generated with a particular pair of proteins
For the sake of simplicity, we consider proteins having only one type of SSE, for instance, helices (when both proteins contain helices and strands, the problem of estimating C(n, N 1, N 2) can be formulated as a substring matching problem, for which a fast recursive algorithm exists). If we compare 2 proteins having 6 helices and we find that the best clique has 6 elements, there is only one possibility of generating this 6clique. On the other hand, if both proteins have 12 helices, the number of 6cliques that can be generated is given by $\left(\begin{array}{c}12\\ 6\end{array}\right)\left(\begin{array}{c}12\\ 6\end{array}\right)={\left(\frac{12!}{6!6!}\right)}^{2}$ = 853776 cliques. It is thus much more probable to observe, just by chance, a 6clique with a score of 9.6 with 2 proteins having 12 helices rather than with 2 proteins having 6 helices. Let us call C(n, N1, N2) the number of ncliques that can be generated with a pair of proteins having respectively N1 and N2 SSEs.
Calculation of Pcli for the best clique
Because C(n, N1, N2) independent ncliques can be generated, in the best nclique for randomly paired proteins, we may observe a score larger than one would expect from the empirical distribution. The corrected significance, termed EPcli, is the probability that any random score in C(n, N1, N2) trials would exceed our observed score s. The probability of finding one value s* higher than observed value s, by chance alone is
This approximation is valid when C(n, N 1, N 2)·Q(s, n)<<1. With the above definition of EPcli, notice that the smaller the value of EPcli the more significant the clique. Finally, we define
Pcli = log_{10}(EPcli).
Remark on the calculation of Pcli
Two types of problems occur. The first one is related to the number of elements of the clique with respect to the number of secondary structure elements (SSEs) found in the 2 domains being compared. To illustrate let us consider the 7element clique that is generated when comparing domains d1amx_ and d1h6fa_ (fold b.2) having 14 and 19 SSEs, respectively. The score of this 7clique, calculated according to Eq. 1 is 8.6. The probability of generating a 7clique having a score s = 8.6 is given by P(s, n)= 10^{5.3}. The number of 7cliques that can be generated with the above two domains is C(7, 14, 19) = 10^{+7}. This leads to an approximation of EPcli > 1, and hence Pcli<0. The match found between the 2 domains is thus not significant. The second problem occurs with small proteins having few (3 or 4) SSEs. As shown in Eq. 1 the score of a clique depends on the number of elements. Small cliques will have relatively small scores and will appear more likely to have been generated by chance than large scores. This is analogous to the problem of detecting similarities for small peptides with sequence comparison methods: although a perfect match might be found, the resulting score, due to the size of the query sequence, will always be small and thus will appear not significant.
Abbreviations
 AUC:

Area Under the ROC Curve
 CA:

Carbon Alpha
 CATH:

Hierarchical classification of protein domain structures, which clusters proteins at four major levels, Class(C), Architecture(A), Topology(T) and Homologous superfamily (H).
 DALI:

Distance mAtrix aLIgnment
 FPR:

False Positive Rate
 NCBI:

National Center for Biotechnology Information
 PDB:

Protein Data Bank
 RMSD:

Root Mean Square Deviation
 ROC:

Receiver Operating Characteristic
 SCOP:

Structural Classification of Proteins
 SHEBA:

Structural Homology by EnvironmentBased Alignment
 SSE:

Secondary Structure Element
 TPR:

True Positive Rate
 VAST:

Vector Alignment Search Tool
Declarations
Acknowledgements
We thank Mr. Steve Fellini and Ms. Susan Chacko for their help with the Biowulf cluster, and Mr. Antej Nuhanovic for his contribution to make a version of the heat map publicly available. This research was supported in part by the Intramural Research Program of the NIH, Center for Information Technology and the National Cancer Institute.
Authors’ Affiliations
References
 Richardson JS: The anatomy and taxonomy of protein structure. Advance protein chemistry 1981, 34: 167–339.View ArticleGoogle Scholar
 Murzin AG, Brenner SE, Hubbard T, Chothia C: SCOP: a structural classification of proteins database for investigation of sequences and structures. Journal of Molecular Biology 1995, 247: 536–540. 10.1006/jmbi.1995.0159PubMedGoogle Scholar
 Orengo C, Michie AD, Jones S, Jones DT, Swindells MB, Thornton JM: CATHa hierarchic classification of protein domains structures. Structures 1997, 5: 1093–1108. 10.1016/S09692126(97)002608View ArticleGoogle Scholar
 Chothia C, Lesk AM: The relation between the divergence of sequence and structure in proteins. The EMBO journal 1986, 5: 823–826.PubMed CentralPubMedGoogle Scholar
 Gibrat JF, Madej T, Bryant SS: Surprising similarities in structure comparison. Current Opinion in Structural Biology 1996, 6: 377–385. 10.1016/S0959440X(96)800583View ArticlePubMedGoogle Scholar
 Madej T, Gibrat JF, Bryant SH: Threading a database of protein cores. Protein: Structure, Function, and Genetics 1995, 23: 356–369. 10.1002/prot.340230309View ArticleGoogle Scholar
 Ortiz AR, Strauss C, Olmea O: MAMMOTH (Matching Molecular Models Obtained from Theory): An automated method for model comparison. Protein Science 2002, 11: 2606–2621. 10.1110/ps.0215902PubMed CentralView ArticlePubMedGoogle Scholar
 Zemla A: LGA: a method for finding 3D similarities in protein structures. Nucleic Acids Research 2003, 31: 3370–3374. 10.1093/nar/gkg571PubMed CentralView ArticlePubMedGoogle Scholar
 GoldsmithFischman S, Honig B: Structural genomics: computational methods for structure analysis. Protein Science 2003, 12: 1813–1821. 10.1110/ps.0242903PubMed CentralView ArticlePubMedGoogle Scholar
 Koehl P: Protein structure similarities. Current Opinion in Structural Biology 2001, 11: 348–353. 10.1016/S0959440X(00)002141View ArticlePubMedGoogle Scholar
 Subbiah S, Laurents DV, Levitt M: Structural similarity of DNAbinding domains of bacteriophage repressors and the globin core. Current Biology 1993, 3: 141–148. 10.1016/09609822(93)90255MView ArticlePubMedGoogle Scholar
 Shindyalov IN, Bourne PE: Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Engineering 1998, 11: 739–747. 10.1093/protein/11.9.739View ArticlePubMedGoogle Scholar
 Harrison A, Pearl F, Mott R, Thornton J, Orengo C: Quantifying the similarities within fold space. Journal of Molecular Biology 2002, 323: 909–926, doi:10.1016/S0022–2836(02)00992–0. 10.1016/S00222836(02)009920View ArticlePubMedGoogle Scholar
 Shapiro J, Brutlag D: FoldMiner: Structural motif discovery using an improved superposition algorithm. Protein Science 2004, 13: 278–294. 10.1110/ps.03239404PubMed CentralView ArticlePubMedGoogle Scholar
 Yang AS, Honig B: An integrated approach to the analysis and modeling of protein sequences and structures. Protein structural alignment and a quantitative measure for protein structural distance. Journal of Molecular Biology 2000, 301: 665–678, doi:10.1006/jmbi.2000.3973. 10.1006/jmbi.2000.3973View ArticlePubMedGoogle Scholar
 Jung J, Lee B: Protein structure alignment using environmental profiles. Protein Engineering 2000, 13: 535–543. 10.1093/protein/13.8.535View ArticlePubMedGoogle Scholar
 Ye Y, Godzik A: Database searching by flexible protein structure alignment. Protein Science 2004, 13: 1841–1850. 10.1110/ps.03602304PubMed CentralView ArticlePubMedGoogle Scholar
 Shindyalov I, Bourne PE: An alternative view of protein fold space. Proteins: Structure, Function and Genetics 2000, 38: 247–260. Publisher Full Text 10.1002/(SICI)10970134(20000215)38:3<247::AIDPROT2>3.0.CO;2TView ArticleGoogle Scholar
 Holm L, Sander C: Protein structure comparison by alignment of distance matrices. Journal of Molecular Biology 1993, 233: 123–138, doi:10.1006/jmbi.1993.1489. 10.1006/jmbi.1993.1489View ArticlePubMedGoogle Scholar
 Kolodny R, Koehl P, Levitt M: Comprehensive evaluation of protein structure alignment methods: scoring by geometric measures. Journal of Molecular Biology 2005, 346: 1173–1188, doi:10.1016/j.jmb.2004.12.032. 10.1016/j.jmb.2004.12.032PubMed CentralView ArticlePubMedGoogle Scholar
 Hanley JA, McNeil BJ: The meaning of the area under the Receiver Operationg Characteristic (ROC) Curve. Radiology 1982, 143: 29–36.View ArticlePubMedGoogle Scholar
 Bradley AP: The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition 1997, 30: 1145–1159. 10.1016/S00313203(96)001422View ArticleGoogle Scholar
 Sierk ML, Pearson WR: Sensitivity and selectivity in protein structure comparison. Protein Science(2004) 2004, 13: 773–785. 10.1110/ps.03328504View ArticleGoogle Scholar
 Getz G, Vendruscolo M, Sachs D, Domany E: Automated Assignment of SCOP and CATH Protein Structure Classifications from FSSP. Proteins: Structure, Function and Genetics 2002, 46: 405–415. 10.1002/prot.1176View ArticleGoogle Scholar
 Hadley C, Jones D: A systematic comparison of protein structure classifications: SCOP, CATH and FSSP. Structures 1999, 7: 1099–1112. 10.1016/S09692126(99)801774View ArticleGoogle Scholar
 Day R, Beck D, Armen R, Daggett V: A consensus view of fold space: combining SCOP, CATH, and Dali Domain Dictionnary. Protein Science 2003, 12: 2150–2160. 10.1110/ps.0306803PubMed CentralView ArticlePubMedGoogle Scholar
 Gerstein M, Levitt M: Comprehensive assessment of automatic structural alignment against a manual standard, the SCOP classification of proteins. Protein Science 1998, 7: 445–456.PubMed CentralView ArticlePubMedGoogle Scholar
 Novotny M, Madsen D, Kleywegt GJ: Evaluation of protein fold comparison servers. PROTEINS: Structure, Function and Bioinformatics 2004, 54: 260–270. 10.1002/prot.10553View ArticleGoogle Scholar
 Brenner SE, Chothia C, Hubbard TJP, Murzin AG: Understanding protein structure: using SCOP for fold interpretation. Methods in Enzymology 1996, 266: 635–643.View ArticlePubMedGoogle Scholar
 Kajava A: What curves alphasolenoids ? Evidence for an alphahelical toroid structure of Rpn1 and Rpn2 proteins of the 26 S proteasome. The Journal of Biological Chemistry 2002, 277: 49791–49798. 10.1074/jbc.M204982200View ArticlePubMedGoogle Scholar
 Hou J, Sims GE, Zhang C, Kim SH: A global representation of the protein fold space. PNAS 2003, 100: 2386–2390. 10.1073/pnas.2628030100PubMed CentralView ArticlePubMedGoogle Scholar
 Hou J, Jun SR, Zhang C, Kim SH: Global mapping of protein structure space and application in structurebased inference of protein function. PNAS 2005, 102: 3651–3656. 10.1073/pnas.0409772102PubMed CentralView ArticlePubMedGoogle Scholar
 Krishna SS, Grishin NV: Structural drift: a possible path to protein fold change. Bioinformatics 2005, 21: 1308–1310. 10.1093/bioinformatics/bti227View ArticlePubMedGoogle Scholar
 Domingues FS, Koppensteiner WA, Sippl MJ: The role of protein structure in genomics. FEBS Letters 2000, 476: 98–102. 10.1016/S00145793(00)016781View ArticlePubMedGoogle Scholar
 Holm L, Sander C: Touring protein fold space with Dali/FSSP. Nucleic Acids Research 1998., 26:Google Scholar
 Efimov AV: Structural trees for protein superfamilies. PROTEINS: Structure, Function and Genetics 1997, 28: 241–260. Publisher Full Text 10.1002/(SICI)10970134(199706)28:2<241::AIDPROT12>3.0.CO;2IView ArticleGoogle Scholar
 MarchlerBauer A, Anderson JB, Cherukuri PF, DeWeeseScott C, Ly G, Gwadz M, He S, Hurwitz DI, Jackson JD, Ke Z, Lanczycki CJ, Liebert CA, Liu C, Lu F, Marchler GH, Mullokandov M, Shoemaker BA, Simonyan V, JS JSS, Thiessen PA, Yamashita RA, Yin JJ, Zhang D, Bryant SH: CDD: a Conserved Domain Database for protein classification. Nucleic Acids Research 2005, 33: D19–26. 10.1093/nar/gni020View ArticleGoogle Scholar
 VAST INRA server[http://wwwmig.jouy.inra.fr]
 SHEBA server[http://lmbbi.nci.nih.gov]
 MSCL server[http://abs.cit.nih.gov/strcomp]
 Chandonia JM, Hon G, Walker NS, Conte LL, Koehl P, Levitt M, Brenner SE: The ASTRAL compendium in 2004. Nucleic Acids Research 2004, 32: D189D192. 10.1093/nar/gkh034PubMed CentralView ArticlePubMedGoogle Scholar
 Biowulf cluster[http://biowulf.nih.gov]
 DeLano WL: The PyMOL Molecular Graphics System. (2002) DeLano Scientific, San Carlos, CA, USA
Copyright
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.