the protein data bank ( http://www.pdb.org/pdb/home/home.do ) ( pdb ) currently has more than 3000 protein structures classified as uncharacterized or as proteins of unknown function .
the pfam database was recently reported to contain over 2200 gene families with unknown function .
it has been argued that there are even more local regions on the protein structures that are not completely characterized , and whose functions are not known .
therefore , with the increasing rate at which protein structures are being generated , the problem of protein function annotation has become a major challenge in the postgenomic era [ 35 ] .
the function of a given protein is largely determined by its three - dimensional structure .
the specific shape and orientation of a protein in 3d space are key elements that determine how the protein interacts with its environment , and hence the function of the protein .
although related proteins often have similar functions , it is well known that sequence similarity between proteins does not always lead to functional similarity [ 7 , 8 ] .
conversely , sequences have been observed with low sequence similarity , but highly structural and functional similarity .
the trypsin - like catalytic triad   is one example of proteins with different folds , but similar functions .
a similar argument can be made between sequence and surface , and between surface and fold .
while residues on the protein surface typically make up a small percentage of the total residues in a protein , they often represent the most conserved functional elements of the protein .
therefore , analyzing protein structures using information about their 3d surfaces is essential in the quest for protein function annotation , especially in the study of functional similarities between nonhomologous proteins .   at the core of most activities in the analysis of protein structures and protein function
such measurements must deal with different levels of structural similarity , arbitrary mutations , deletions , and insertion of residues , local surface similarities , and so forth .
when the problem is similarity measurement between protein surfaces , a major issue becomes how the protein surface is represented , and how the representation can be used for the required similarity measurement .
structure alignment , the basis for most approaches to protein 3d structure analysis is known to be np - hard .
a major difficulty in comparing protein surfaces locally is the problem of matching 3d structures , since structures need to undergo an exhaustive amount of rotation and translation in order to obtain an adequate structural alignment and to perform an accurate matching . clearly , a method that avoids the step of local structural alignments can have a significant advantage , especially in screening of similar surfaces over a large database .   in this paper
we then use this characterization to study the problem of classifying proteins into their functional families based primarily on their surface characteristics .
this is a challenging problem , but one that is important in the quest for functional annotation of proteins , using information from potentially nonhomologous proteins .
we also show how we can use such a descriptor in various related analysis activities , such as in effective retrieval of similar protein surfaces from very large databases , such as the protein data bank ( pdb ) .
although proteins could vary significantly in their functions and 3d shapes , they also share a general common structure .
the order in which these amino acids are connected is called the protein sequence , or the primary structure of the protein .
all proteins are composed of four common structural types : primary structure , secondary structure , tertiary structure , and quaternary structure .
the secondary structure is formed by patterns of intermolecular bonding of hydrogen and is determined primarily by the location and the directions of these patterns [ 14 , 15 ] .
this is often described in terms of secondary structural elements ( sses ) , such as -helixes , -sheets , and turns .
the overall 3d shape of the secondary structures determines the tertiary structure of the protein .
when two or more chains combine to form a larger molecule , the whole structure is called the quaternary structure .  
figure 1 shows an example of some of the common protein structural types ( the sequence is not included ) .  
a common method for protein function prediction is by annotation transfer from known homologous proteins .
functions of novel proteins can be determined by sequence comparisons , for instance using sequence alignment .
when proteins evolve , the protein structure remains more highly conserved when compared to the sequence .
protein sequences change more easily during evolution due to residue mutations , for instance by substitution , insertion , or deletion .
hence , proteins that belong to the same family ( homologous proteins ) may not be identified using sequences alone .
reported that proteins related to the same family could share fewer than 15% identical residues .
in general , the degree of structural or sequence similarity varies substantially between protein families .
this so - called structural plasticity   has a considerable impact on the functionality of some proteins , or members of a protein family .
a consideration of the protein structure and its variability becomes important in such situations for further analysis of functional similarity between proteins .
a classical approach for deriving the protein function is by first determining its 3d structure , which can then provide some ideas about its function .
protein 3d structures provide information about the binding sites , active sites , and how proteins interact with each other , and thus could provide an insight into the function of the protein .
how proteins interact with each other and with other molecules ( e.g. , ligands ) is determined primarily by the amino acids on the protein surface .
therefore , knowledge of the protein surface residues could help in a better understanding of what molecules are binding together , and in some cases , why they bind .
the protein surface could also provide significant information about protein functions which can not be easily detected , even in the presence of sequence or fold similarity .
therefore , the analysis of protein surfaces is important in the study of intermolecular interactions .
clearly , advances in our understanding of protein surfaces could have important implications in various biomedical fields , such as personalized medicine , drug discovery , drug design , and so forth .
given the foregoing , it is not surprising that different methods have been proposed to characterize the protein surface .  
popular examples include those based on surface shape distributions , gauss integral , fourier transform , spherical harmonics [ 22 , 23 ] , alpha - shapes [ 2 , 24 ] , and zernike polynomials .
contact maps between protein surfaces were studied in   , while similarity networks between surface patches from protein binding sites were studied in [ 26 , 27 ] .  
protein surface similarity using varying resolutions of structural data have also been studied , for instance , using medium - resolution cryo - em maps in   and low resolution protein structure data in .  
sharp   provides a mechanism to predict protein - protein interaction by analyzing overlapping protein 3d surface regions .
surface   is a database of protein surface regions that can be useful for annotation .
much earlier , jones and thornton   analyzed protein - protein interaction by using surface patches , where patches are defined based on the c atoms that have a predetermined accessible surface area , and adhere to defined constraints on the solvent vectors .
each patch is then described using six parameters , namely , solvation potential , residue interface propensity , hydrophobicity , planarity , protrusion , and accessible surface area .
each residue on the protein surface is represented using a vector joining its c atom and the centroid of its side chain atoms .
surface patches are then compared for similarity by comparing the residue vectors for all possible pairs of residues from the query and target surface patch .
matches are determined based on the root mean square distance , and the residue similarity as determined using a standard substitution matrix .
the results of using this method on a nonredundant list of protein chains as recorded in the surface database , a collection of protein surface regions that can be useful for annotation .
distance distributionsdistances , geometry , and topology have for long been used in the analysis of general protein 3d structures .
residue distances have been used in standard texture - based analysis of 2d textures ( distance matrices ) formed by the distances between residues in a protein structure .  
the use of topological invariants , as captured using gaus integrals for the automated analysis and representation of general protein 3d structures was described in .
much earlier , connolly   proposed the analysis of protein surfaces using the notion of surface shape distributions .
binkowski and joachimiak   proposed the use of surface shape signatures ( ssss ) as a method to describe protein surfaces by exploiting global shape and geometrical properties of the surfaces .
shape signatures are computed based on the distances measured between each unique atom pairs on the surface .
distances are then sorted based on which their distributions are generated . with the distributions , the problem of matching between two surfaces
comparison between two distributions is performed using the kolmogorov - smirnov ( ks ) test .
the use of the shape distribution is fast and relatively resilient to scale , rotation , and mirroring .
however , the discrimination ability is still a problem , as the sss tends to lose important surface details . 
 
distances , geometry , and topology have for long been used in the analysis of general protein 3d structures .
residue distances have been used in standard texture - based analysis of 2d textures ( distance matrices ) formed by the distances between residues in a protein structure .  
the use of topological invariants , as captured using gaus integrals for the automated analysis and representation of general protein 3d structures was described in .
much earlier , connolly   proposed the analysis of protein surfaces using the notion of surface shape distributions . essentially , surface shapes correspond to different geometric configurations defined on the protein surface .
binkowski and joachimiak   proposed the use of surface shape signatures ( ssss ) as a method to describe protein surfaces by exploiting global shape and geometrical properties of the surfaces .
shape signatures are computed based on the distances measured between each unique atom pairs on the surface .
distances are then sorted based on which their distributions are generated . with the distributions , the problem of matching between two surfaces
comparison between two distributions is performed using the kolmogorov - smirnov ( ks ) test .
the use of the shape distribution is fast and relatively resilient to scale , rotation , and mirroring .
however , the discrimination ability is still a problem , as the sss tends to lose important surface details . 

zernike polynomialsfollowing earlier work by canterakis   on the use of 3d zernikes for the analysis of general 3d objects , sael et al
, the protein 3d structure is represented as a series expansion of 3d zernike functions .
the triangulated connolly surface of the protein is computed , and subsequently the protein is placed into a 3d cubic grid and voxelized .
each voxel has a value of 1 or 0 , depending on whether the voxel is on the protein surface or in the interior .
the 3d zernike function is then applied to the voxelized 3d protein shape to obtain the 3d zernike descriptors .
therefore , the problem of comparison of 3d surfaces is reduced to that of comparing two vectors representing the 3d zernike descriptors for each protein surface .
several distance measures were tried , such as the euclidean distance , manhattan distance , and a correlation - based distance defined as the complement of the correlation coefficient between two zernike descriptors .
studied the use of both spherical harmonics and 3d zernike descriptors in the retrieval of functionally similar proteins . in a more recent
work , sael and kihara   used the zernike descriptor to study protein surfaces in low resolution data .
computation of the required zernike polynomials is , however , known to be a major computational huddle .
thus , the required preprocessing before matching is performed may be a problem for indexing and real - time search of large - scale datasets . 
  following earlier work by canterakis   on the use of 3d zernikes for the analysis of general 3d objects , sael et al
, the protein 3d structure is represented as a series expansion of 3d zernike functions .
the triangulated connolly surface of the protein is computed , and subsequently the protein is placed into a 3d cubic grid and voxelized .
each voxel has a value of 1 or 0 , depending on whether the voxel is on the protein surface or in the interior .
the 3d zernike function is then applied to the voxelized 3d protein shape to obtain the 3d zernike descriptors .
therefore , the problem of comparison of 3d surfaces is reduced to that of comparing two vectors representing the 3d zernike descriptors for each protein surface .
several distance measures were tried , such as the euclidean distance , manhattan distance , and a correlation - based distance defined as the complement of the correlation coefficient between two zernike descriptors .
venkatraman et al .   studied the use of both spherical harmonics and 3d zernike descriptors in the retrieval of functionally similar proteins . in a more recent work , sael and kihara   used the zernike descriptor to study protein surfaces in low resolution data .
computation of the required zernike polynomials is , however , known to be a major computational huddle .
thus , the required preprocessing before matching is performed may be a problem for indexing and real - time search of large - scale datasets . 

fingerprintsa recent work   used the idea of extracting invariant fingerprints from patches on the protein surface .
patches are obtained by generating the dot surface of the protein and constructing a graph to approximate the protein surface .  
afterwards , circular patches are generated as a contiguous surface area from a center point , where the radius of the patch is within a predetermined cutoff .
patches are created for each single point on the surface , after which a fingerprint representation of the patch is computed as a geodesic distance - dependent distribution of directional curvature .
comparisons between fingerprints were performed using the average fingerprint similarity score ( afss ) and the direct fingerprint similarity score ( dfss ) .
clearly , computational complexity will be a major problem here , especially given the computation of the patch representation for each vertex on the surface graph ( number of vertices is much more than the number of surface residues ) .
the need for a later stage of alignment for the final computation of matching scores only compounds the computational burden ( see , for example ) . 
  a recent work   used the idea of extracting invariant fingerprints from patches on the protein surface .
patches are obtained by generating the dot surface of the protein and constructing a graph to approximate the protein surface .  
afterwards , circular patches are generated as a contiguous surface area from a center point , where the radius of the patch is within a predetermined cutoff .
patches are created for each single point on the surface , after which a fingerprint representation of the patch is computed as a geodesic distance - dependent distribution of directional curvature .
comparisons between fingerprints were performed using the average fingerprint similarity score ( afss ) and the direct fingerprint similarity score ( dfss ) .
clearly , computational complexity will be a major problem here , especially given the computation of the patch representation for each vertex on the surface graph ( number of vertices is much more than the number of surface residues ) .
the need for a later stage of alignment for the final computation of matching scores only compounds the computational burden ( see , for example ) .
the key difference in our method is the use of the local patch descriptors as defined by the distribution of distances between c atoms within each surface patch , conditioned on the specific residue at the center of the patch , and the particular residues found within the patch .
our method computes the residue - specific distance distributions , and residue - distance cooccurrences for the protein surface patches using only the c atoms on the protein surface .
we avoid the time complexity of generating a graph representation of the surface before the surface can be scanned to generate the patches and then compute the distance distribution .
further , ours does not depend on the time - consuming process of initial surface alignment .
we present an invariant descriptor for characterizing protein surfaces . we start with a local descriptor of selected circular patches on the protein surface . for a given surface patch ,
the local descriptor is computed based on the residue distances from the center of the patch .
the descriptor records the distance distribution between the central residue and the residues within the patch , keeping track of the number of particular pairwise residue cooccurrences in the patch . a global descriptor for the entire protein surface
is then constructed from the local descriptors by combining information from local descriptors with similar central residues .
using a fixed patch size , we obtain a descriptor for the protein surface , independent of the size of the protein structure .
thus , the descriptor can facilitate the rapid matching of protein chains , and will eliminate the need for the exhaustive alignment of the protein 3d structures . for a given protein structure or protein chain from a database , such as the pdb , the proposed method can be summarize in the following steps : generate the connolly surface   for the protein chain ; generate the surface patches and compute the local invariant descriptor for each patch on the surface ; compute the global invariant surface descriptor for the protein chain , by combining information from the local patch descriptors ;   perform surface matching and comparison using the descriptors ;   classify the protein into its potential functional family , or perform protein surface retrieval using the invariant descriptors . 

the method has been applied on three protein families : uracil - dna glycosylase , estrogen receptor , and cell division protein kinase 2 .
we also tested on epidermal growth factor ( egf ) and cyclooxygenase-2   ( cox-2 ) , two protein families that are known to play a role in cancer .
below , we provide more details on the steps enumerated above . for a given protein
, we first generate its connolly surface   at a given atomic radii , using the msms program , based on which the dot surface is generated .
next , matlab bioinformatics toolbox ( mathworks inc , natick , mass , usa ) was used to extract the protein chains and to generate the residue coordinates in each chain . in this step ,
the chains are extracted while preserving the coordinates of the c atoms and their respective residue types by extracting the information from the pdb and the vertex files . to capture protein structure similarity and to avoid the computational complexity and the time - consuming problem of aligning 3d protein structures , we propose the use of a global rotational - invariant descriptor to represent overlapping patches on the protein surface .
a patch is defined as a circular region with a specified radius , centered on the c position of a surface residue .  
for each residue on the surface ( the central residue ) , we construct a surface patch by recording its residue type , and consider all residues within a certain distance threshold ( p ) as part of the patch ( see figure 2 ) .
thus , the proposed surface descriptor is composed of 20 distinct descriptions , one for each protein residue type .
for the local descriptor , this is constructed from only information from the patch . for the global descriptor ,
the local invariant descriptor for the patch is created by calculating the distribution of distances between the central residue and all other surface residues within the patch .
additionally , the residue cooccurrences within the patch are also recorded as a part of the local descriptor .
each local descriptor is represented in a matrix da of size ( 20 + 1)(b + 1 ) , where the rows correspond to the 20 distinct protein residue types , plus an extra row to describe the summary distance distribution within the patch .
the columns represent the individual bins used to capture the distance distributions ( total of b bins ) , plus an extra column to represent the summary of the residue cooccurrences . to reduce the computational time and space requirement , unlike in  
we define patches only for surface residue positions , rather than for each vertex on the dot surface ( the number of vertexes is much more than the number of residues ) .
therefore , for a given chain , the number of local invariant descriptors will be equal to the number of surface residues .
yet , this number can vary from tens to hundreds and sometimes to thousands of surface residues .   using a huge number of local invariant descriptors for one chain to perform matching
to further reduce the computational requirements , for a given chain , we compute a global rotational - invariant descriptor by combining the 20 distinct residue - specific descriptors . for a given residue type , the global descriptor is constructed by taking the average of all patch descriptors with a given residue type as the central residue ( see figure 2 ) .
we consider three ways to represent and use the global surface descriptor , as explained below .  
the basic idea of using the distance distribution is that similar functional proteins should have a similar distribution of distances between the residues on their surfaces .
the first form is a detailed distance distribution between the central residue in the surface patch and each of the other residues on the patch . to achieve this ,
a uniform distribution of the distances is assumed and the total number of bins b is used to estimate the probability distribution of finding a pair of residues at one of the b ranges .
we estimate the probability of observing any given residue within a patch in a particular distance range from the central residue . in this paper
, we study the use of the global distance distribution in identifying similar protein surfaces , and possibly proteins with similar functions .
consequently , the question to be answered is , given a central residue of a specific type , what is the distance distribution for the residues around this central residue ?
that is , we seek pr{d | rc } , the probability of observing distance d between a central residue of type rc and any other residue .
we expect that the distance distribution should be similar for surface patches from functionally similar proteins .
given that surface structures are more conserved than sequence over evolution [ 15 , 17 ] , we expect that functionally similar proteins are likely to have similar surface residues , even though the order of such residues may have changed .
using the distance distribution globally provides an idea of how the distances from the central residue are distributed in the protein surface patch . however , there is no constraint on , or indication of , which residues are involved in the formation of these distributions .
the co - occurrence of a given residue with the central residue is calculated as the number of times the residue occurs on a patch with the same central residue .
thus , the main problem would be to find the probability of observing residue say , ri , given a central residue , say rc .
again , we expect the probability pr{ri | rc } , to be similar for protein surfaces from functionally similar proteins .
we note that the surface co - occurrence does not depend on the specific distance between the residues involved , as far as ri is within the patch .  
the drc combines the general distance distribution ( represented as a row vector , sum  c in matrix da ) and the residue cooccurrences ( represented as a column vector , sum  r in matrix da ) in describing the protein surface ( see figure 2 ) .
the residue - distance co - occurrence vector is defined as follows : drc = ( sum  csum  r ) , where  is the concatenation operator and x stands for the transpose of x. drc is used to compute the conditional probability   pr{d | rc , ri } , that is , the probability of observing the distance d between residues rc and ri given that rc is the central residue in the patch .
we expect that the residue co - occurrence ( sum  r , or rc ) should carry more distinctive functionally relevant information than the general distance distribution ( sum  c , or dd2 ) , since surface residue cooccurrences are likely to be more conserved over evolution . by combining both vectors , we can account for both the geometry of the protein surface and the distribution of specific residues within specific distances on the surface . using both vectors brings in some biological relevance in the analysis and is likely to lead to improved results in the identification of functionally similar protein surfaces .
given two proteins , say protein 1 and protein 2 we characterize them using their global descriptors , say dg1 and dg2 respectively . in this work
, the global descriptor could be the distance distribution ( dd2 ) , residue cooccurrences ( rcs ) , or the distance - residue cooccurrences ( drcs ) . 

distance distributionfor matching using the distance distribution we create a vector dg1d that is composed of the 20 global distance distributions represented by all sum  c vectors from each descriptor .
dg1d is defined as dg1d = ( dd1  dd2dd20 ) , where dd1 , dd2 ,  , dd20 are the distance distributions from each residue type on the surface of protein 1 .
then we perform matching using the simple euclidean distance : d12=i=1n[dg1d(i)-dg2d(i)]2  . 
  for matching using the distance distribution
we create a vector dg1d that is composed of the 20 global distance distributions represented by all sum  c vectors from each descriptor .
dg1d is defined as dg1d = ( dd1  dd2dd20 ) , where dd1 , dd2 ,  , dd20 are the distance distributions from each residue type on the surface of protein 1 .
residue cooccurrencesfor protein 1 we create a vector dg1c that combines the 20 residues co - occurrence vectors ( denoted sum  r ) , defined as dg1c = ( dc1  dc2dc20 ) , where dc1 , dc2  ,  , dc20 represents sum  r1 , sum  r2 , and sum  r20 . similarly , we compute dg2c .
matching is performed using the euclidean distance between dg1c and dg2c . 
  for protein 1
we create a vector dg1c that combines the 20 residues co - occurrence vectors ( denoted sum  r ) , defined as dg1c = ( dc1  dc2dc20 ) , where dc1 , dc2  ,  , dc20 represents sum  r1 , sum  r2 , and sum  r20 . similarly , we compute dg2c .
distance - residue cooccurrenceshere , we create a vector drc that is comprised of all of the distance distributions as well as the residue cooccurrences . for protein 1
similarly we obtain drc2 for protein 2 . again for simplicity , matching is performed using the euclidean distance .
, we create a vector drc that is comprised of all of the distance distributions as well as the residue cooccurrences . for protein 1
similarly we obtain drc2 for protein 2 . again for simplicity , matching is performed using the euclidean distance .
classificationhaving computed the surface descriptors and the distance between protein surfaces using the descriptors , one may be interested in determining whether a given unknown protein belongs to some known protein family . using some training data , we can compute surface descriptors for the known family , and based on these perform the required classification .
classification is performed using weka [ 38 , 39 ] , an open - source software for machine leaning that provides a suite of classification algorithms . 
 
having computed the surface descriptors and the distance between protein surfaces using the descriptors , one may be interested in determining whether a given unknown protein belongs to some known protein family .
using some training data , we can compute surface descriptors for the known family , and based on these perform the required classification .
classification is performed using weka [ 38 , 39 ] , an open - source software for machine leaning that provides a suite of classification algorithms .
we performed experiments to test the performance of the proposed protein surface descriptor in two protein structure analysis tasks , namely , classifying proteins into their most likely functional groups , and ranking and retrieval of protein surfaces .
dataset - a contained information from three protein families : uracil - dna glycosylase , cell division protein kinase 2 , and estrogen receptor .
this was created by scanning the pdb and selecting the protein structures with protein chains belonging to one of the three families .
we were able to extract 416 chains that belong to 243 proteins in the pdb .
the dataset is distributed as follows : 91 chains from 46 distinct proteins for uracil - dna glycosylase ( group1 ) , 186 chains from 95 distinct proteins for estrogen receptor family ( group2 ) , and 139 chains from 102 distinct proteins from cell division protein kinase 2 ( group3 ) .
we used dataset - a basically to train the system , and perform initial testing .  
dataset - b contained protein structures from two families , namely cyclooxygenase-2   ( cox-2 ) ( 51 proteins , 95 chains ) and epidermal growth factor   ( egf ) ( 67 proteins , 71 chains ) .
we then extracted protein structures from the pdb that have 10 or less chains and ignored the rest .
we used dataset - b for a more comprehensive scan of the pdb , in the quest for potentially novel structures that may be related to the two families .
experiments were performed using a sony vaio personal computer , with intel core 2 duo processor t8100 , running at 2.10  ghz , with 2  gb of main memory .
programs were written using matlab ( mathworks inc , natick , mass , usa ) with the bioinformatics toolbox .
we set probe radius = 1.4   and patch distance threshold p = 10   . for distance distributions
classification was performed based on algorithms implemented in weka [ 38 , 39 ] version 3 - 6 - 4 .
we divide dataset - a into training and testing sets and apply different classifiers on the different descriptors proposed . in all our experiments ,
the training sets were kept very separate from the testing sets , with no overlap between the two .
classification performance is measured in terms of classification rate based on the three protein families in the dataset .
we tested the method using various classifiers implemented in weka , such as nave bayes , logistic regression , and simple logistic classifier .
first , we explore the impact of the size of the testing set and of the training set on the classification performance using the proposed approach .
we varied the size of the training set ( from 50 to 300 ) , while keeping the size of the testing set fixed .
we then checked the performance using fixed testing sets of size 100 , 200 , and 300 .  
the figure shows that applying the distance distribution ( dd2 ) alone resulted in the lowest performance accuracy as compared to using the residue cooccurrences ( rcs ) or distance - residue cooccurrences ( drcs ) . yet
, our definition of the distance distribution shows encouraging results . a steady improvement in performance with increasing training set size
can be observed when using dd2 alone , peaking at about 87%   with a training size of 200 and testing size of 100 .
the distinctiveness of our approach is the use of residue cooccurrences on the protein surface .
this approach assumes that functionally similar surface proteins have similar residue cooccurrences within a small local surface region .  
figure 3 ( middle plot ) shows that classification using residue cooccurrences ( rcs ) provided a significant improvement in the classification rate .  
a similar improvement was observed using other classifiers , such as nave bayes . using the rc descriptor
, we can achieve an accuracy rate of 94% using a small training set ( 50 samples ) and six times larger testing set ( 300 chains ) .
this shows the robustness of the residue cooccurrences , even when using a few training samples .
we observe that the performance using dd2 was not as robust ( about 81% using small training set , peaking at about 87% using 200 training samples ) .  
the use of distance - residue co - occurrence presents a steadier improvement in the classification rate . using the drc raised the accuracy rate to 99% using the simple logistic classifier on a training set of 150 and testing set of 100 ( data not shown ) .  
we can observe the significant difference between the results of dd2 ( which did not use information on residue cooccurrences ) and rc and/or drc ( both of which used residue cooccurrences ) .  
figure 4 shows a corresponding performance measurement with varying size of the testing set , while keeping the training set size fixed .
as expected , there is a general slight decrease in performance with increasing size of the test set .
the case of drc using a training set size of 100 seemed to increase slightly with increasing testing set size .
overall trends are similar to figure 3 , with rc and drc performing much better than dd2 .  
the overall classification performance is summarized in figure 5 , which shows the results of the three proposed schemes using n - fold cross validation , for different values of n.   in this section , we explore the effectiveness of our approach on the problem of search and retrieval of protein surfaces .
given a query protein , we study whether our approach has the robustness to place most of the functionally similar proteins in the top hits of the retrieved surfaces .   here
, a query protein from each of the three groups is used to screen the entire dataset - a ( 416 samples ) and provide a ranking based on the similarity .
thus , each protein structure is ranked against the query , ( from 1 to 416 ) , where a lower rank ( smaller distance ) implies more similarity to the query . after that , we search over the retrieved proteins to find which ranks the functionally similar proteins ( i.e. , proteins in the same functional group ) have attained .   table 1 shows the ranking produced using the proposed descriptor , for three query samples , one for each group .
rc produced a slightly better ranking ( especially for uracil - dna glycosylase family ( group 1 ) ) , while dd2 was worse than both rc and drc ) .
overall , for group 2 and group 3 , the top 30 ranked proteins belonged to the corresponding family , while group 1 was more difficult .  
the enrichment plot essentially measures how well a given ranking or retrieval system performs , when compared with a random selection of the data samples . at a given percentage of database screening ,
the enrichment factor is computed as the ratio nobs / nexp , where nobs = number of functionally similar proteins observed or retrieved by the system , and nexp = number of functionally similar proteins expected by random selection . for an effective system
, we expect that most of the functionally similar proteins should be observed after a small percentage of screening .
that is , the top hits should contain mainly functionally similar proteins , and hence the enrichment factor should be high after a small percentage probe of the database , and gradually decrease towards 1 ( which corresponds to random selection ) .  
figure 6(a ) shows a plot of the average enrichment factor using 5 queries from group 3 .
the enrichment plot shows that our proposed method provides better results as we screen a small percentage of the dataset . in most of the cases , our method retrieved about three times better than the expected random retrieval in the first 10% of screened proteins .
as we increase the percent of screening , the retrieval degrades , since we are more likely to have retrieved most , if not all of the similar proteins after a small percentage of the screening .
encouraged by the results in classification and ranking using the proposed descriptors , we now performed a larger scale experiment , by screening the entire protein structures in pdb , using the protein chains in dataset - b , with members of the cox-2 and egf families as the query .
the main objective was to see how the proposed descriptors will perform on a large scale , and to see if the methods could predict potentially novel functional linkages between any of the families and other proteins in pdb .
for this task , we used only pdb files with 10 or less chains , and ignored the rest .
table 2(a ) shows the ranking results produced by screening the pdb files based on the proposed descriptors , using a member of the egf family as a query .  
we can notice that some of the unknown proteins ( annotated as  uncharacterized  ) were placed in the top-50 rankings , implying a possible relationship with the respective families .  
the use of distance distributions for protein surface analysis was studied by binkowski et al . .
as earlier discussed , they did not consider the specific residues in constructing the distributions .
their distance distribution ( labeled as dd1 in this work ) is obtained by removing the reference to the specific residue at the center of the patch ( see figure 2 ) .  
our use of surface residue cooccurrences and combining these with the residue - specific distance distributions are novel methods introduced in this paper . tables 3(a ) and 3(b ) compare the overall classification performance using dd1 with those obtained with the proposed descriptors .   

figure 6 also shows the comparative performance using both the enrichment plots , and precision and recall .
we define precision and recall at a given distance threshold as follows : precision = ( number of correct retrievals at the threshold)/(number of total retrievals at the threshold ) .
recall = ( number of correct retrievals at the threshold)/(number of total true matches expected at the threshold ) .   here , using the ranked results , for a given query and a given rank , the number of expected true matches will be min{rank , query group size}. this is similar to the definition used in .
we performed queries on dataset - a using query proteins from each of the three groups and computed the average precision and recall for each descriptor .
we then computed the area under the curve ( auc ) for the average precision - recall plots .
the results were as follows :   dd1 ( 0.501052 ) , dd2 ( 0.649412 ) , rc ( 0.668303 ) , and drc ( 0.66759 ) .
although the databases used are different , these results compare well with the results reported by sael and kihara , where they evaluated the retrieval performance of four surface characterization methods , based on the zernike representation .
the maximum auc reported using standard resolution surfaces was 0.608 ( without length filtering ) and 0.628 ( with length filtering ) .
their method constructs an initial patch on every vertex on the dot surface , and requires computation of geodesic distances on the surface , two very time - consuming processes .
our method neither requires surface alignment , nor expensive computations on the surface , beyond the surface generation process .
patches are generated only on positions of the surface residues , rather than over all the vertices on the generated protein surface .
the most time consuming part was for preprocessing , as needed to construct the protein surfaces and extract the protein chains .
the construction of the protein surface from the original pdb files required about 4.065 seconds , running on cygwin ( a version of linux for microsoft windows ) .
extraction of the protein chains and the c atoms was performed using matlab bioinformatics toolbox ( mathworks inc . , natick , mass , usa ) , and required 32 seconds per pdb file .
construction of the descriptors after the above steps took an average of 0.7 seconds per pdb file . querying dataset - b ( 15,386 chains , 6,261 unique pdb files ) using
the drc descriptor required an average time of 0.28 seconds for each query pdb file .
the proposed approach captures the surface structure of the protein by utilizing local patches defined only on the positions of surface residues , rather than over all surface vertices , or over all the surface atoms .
we make residue cooccurrences on the surface a central part of the descriptor . the novelty of this approach can be observed by the ease of handling both local and global variation on the surface ( using local and global descriptors ) .
moving from local to global not only reduces the computational problem of matching 3d structures , but also facilitates direct comparison between protein structures of different sizes . by avoiding the construction of the complete 3d surface and retaining only the surface c to do the analysis , the need for surface alignment of the 3d structure
further , we do not need to perform any geometrical transformation to insure reliable matching .
this is very important for rapid analysis over a large database , such as the pdb .  
we showed results on the performance of the proposed methods in functional classification of proteins into their putative families , based on the surface information .
we further compared the results using enrichment plots , and the standard measures of precision and recall .
for the three protein families used , we obtained an area under the curve for precision and recall of 0.6494 ( dd2 ) , 0.6683 ( rc ) , and 0.6676 ( drc ) .
a screening of the pdb using cox-2 and egf family members showed that the proposed methods ranked related family members in the top-20 hits , with a number of uncharacterized proteins also retrieved .
it will be interesting to perform further biological lab experiments to verify if any of the retrieved uncharacterized proteins are truly related to the respective families to which they share similar surfaces ( as determined by our surface descriptors ) .
 
 aim . to develop a new invariant descriptor for the characterization of protein surfaces , suitable for various analysis tasks , such as protein functional classification , and search and retrieval of protein surfaces over a large database 
 . methods . 
 we start with a local descriptor of selected circular patches on the protein surface . 
 the descriptor records the distance distribution between the central residue and the residues within the patch , keeping track of the number of particular pairwise residue cooccurrences in the patch . a global descriptor for the entire protein surface 
 is then constructed by combining information from the local descriptors . 
 our method is novel in its focus on residue - specific distance distributions , and the use of residue - distance co - occurrences as the basis for the proposed protein surface descriptors 
 . results . 
 results are presented for protein classification and for retrieval for three protein families . 
 for the three families , we obtained an area under the curve for precision and recall ranging from 0.6494 ( without residue co - occurrences ) to 0.6683 ( with residue co - occurrences ) . 
 large - scale screening using two other protein families placed related family members at the top of the rank , with a number of uncharacterized proteins also retrieved . 
 comparative results with other proposed methods are included . 
1. Introduction
2. Background and Related Work
3. Methods
4. Results and Discussion
5. Conclusion