the advent of sequencing the human genome ( 1,2 ) has initiated a large number of genome - wide research efforts . transcriptomics aims at generating the catalog of all expression patterns of genes as function of environmental parameters like cell - type , metabolic state , cell life cycle state , etc . similarly , proteomics aims at this same catalog by directly measuring the proteins rather than indirectly via their expressed messenger rnas . metabolomics , glycomics , immunomics and pharmacogenomics , for example , aim at catalogs of all metabolites , all glycosylation sites and states , molecular functions associated with immune - related transcripts and a hosts genetic response to drugs , respectively . structomics is the novel research field that aims at solving all protein 3d structures , and table 1 shows a series of the better - known structural genomics efforts . as solving all 25 000 human structures is not yet possible , efforts are directed towards first solving the 3d structures of enough significantly different protein sequences to be able to model the entire human protein structure repertoire by homology . this means that a series of protein structures is being solved for which the function can not be estimated using a blast run against the databases of proteins with known function . table 1.a few of the many structural genomics effortsconsortiumwww - pageno . of deposited pdp filessgchttp://www.thesgc.com/500neschttp://www.nesg.org/500tbsgchttp://www.doe - mbi.ucla.edu / tb/500sgxrchttp://www.nysgrc.org/500bsgchttp://www.strgen.org/100cesghttp://www.uwstructuralgenomics.org/100jcsghttp://www.jcsg.org/600mcsghttp://www.mcsg.anl.gov/750ysghttp://genomics.eu.org / spip/25rsgihttp://www.rsgi.riken.go.jp/2000sgpphttp://www.sgpp.org/50secsghttp://www.secsg.org/75psfhttp://www.proteinstrukturfabrik.de/20spinehttp://www.spineurope.org/100the three columns give the name of the consortium , their www - page and their stated number of deposited pdb files , respectively . note that collaborations between centers in consortia may have caused double counting of pdb entries . a few of the many structural genomics efforts the three columns give the name of the consortium , their www - page and their stated number of deposited pdb files , respectively . note that collaborations between centers in consortia may have caused double counting of pdb entries . many algorithms have been designed to aid with the detection of very remote sequence similarities . examples are psi - blast , several threading methods , profile  profile - based methods , etc . structural genomics centers have deposited more than 1000 protein structures that have their function marked as  unknown , and the function of more than 500 of those could not be determined using any of standard sequence - based methods . at http://kb.psi-structuralgenomics.org/kb/a long list of such proteins it is commonly known that protein structure and the location of their functional sites are much more conserved than their sequences . long after evolutionary divergence has made sequence similarity detection impossible , the structures of remote homologs are still very comparable . we here present a server , based on this concept , which helps with the detection of otherwise undetectable homologies . the 3d - fun server takes as input the coordinates of a protein with known structure and unknown function , and compares it with all proteins with know structure available from the pdb . the output consists of a list of structurally similar proteins and with some vital superposition statistics . if the function of the database hits is known , it is listed to aid the user of the server with the prediction of the function of the query protein . the 3d - fun server is available at two sites : 3dfun.bioinfo.pl and 3dfun.cmbi.ru.nl , and a few more locations are planned . the 3d - fun server has been set - up to predict the ec - code of an enzyme but it can , in principle , be extended to any other description of protein function . this software superposes two structures at a time and determines a superposition score that is mainly based on the percentage residues that superpose within 3.0  ( more detailed description of the 3d - hit algorithm is presented below ) . an all - against - all structure comparison is performed and for each protein p with known function the superposition scores are determined for the most structurally similar protein q1 that has a function different from p , and the worst superposing structure q2 that superposes with a better score than q1 and has the same function as p. this way the false - positive cutoff , being the average of the superposition scores for q1 and q2 , can be determined for each protein in the database . this process is performed four times , once for each of the four functional levels of the ec - code . the final score for a comparison of an unknown protein with a protein in the database is determined relative to this false - positive cutoff value . when querying with the protein r with known structure and unknown function the 3d - hit program first compares r with a database of structures si that all have a known ec - code and can be characterized by four cutoff values . the ec - code of the protein si with the strongest structural similarity is assigned to the query if the superposition score is greater than all ( or any ) of the false - positive cutoff values . let us , as an example , consider a query protein r which has a 3d - hit score of 150 to protein si with ec - code 1.2.3.4 , which has the four false - positive cutoff values 100 , 120 , 180 and 200 . r will obtain an ec number assignment of 1.2... all structural similarity scores are used for annotation in the 3d - clust strategy ( 4 ) . the query structure and all sequentially nonredundant proteins are hierarchically clustered by structural similarity using a complete link algorithm ( 5,6 ) . the ec - code is completely ( or partially ) assigned to each group in each clustering iteration , if all of the enzymes in the group have the same function at all ( or any ) of the ec levels ; otherwise , the ec - code is assigned as unknown . let us , as an example , consider a cluster that contains four structures : the query protein and three enzymes with ec numbers 1.3.3.4 , 1.3.3.6 and 1.3.4.1 . this cluster will obtain an ec number assignment of 1.3... for the final prediction , the enzymatic function of the most detailed cluster that contains the query structure is used . contrary to the 3d - hit strategy , the 3d - clust algorithm takes into account the enzymatic function of all structures s that have a better superposition scores with r than with all other proteins of the whole set . the pd - split software splits the pdb database in n equal chunks , where n is the number of available cpus in the computer server that can be used by 3d - hit . this way 3d - fun can optimally use the power of coarse - grained parallel clusters . the user needs to input the coordinates of the unknown protein in the well - known pdb format . only the so - called atom records of the c- atoms are required because the 3d - hit ( 3 ) software used for the structural comparisons uses c- coordinates only . the server software sends the query structure to the n processors , waits for the results to come back , combines and sorts those results and presents them to the user . figure 1 shows a typical server output page in which all important aspects of the output are annotated . on the polish 48-node cluster a typical run takes 510 min . figure 1.a screenshot of the 3d - hit result list . in the top panel , the user selects the sort type and the maximum number of hits to be displayed . the backbone superposition of the query structure and the database hits selected by the user are displayed with jmol ( 13 ) . if the superposition score is above the false - positive cutoff score , then the corresponding ec number is listed in blue color . the user selects the sort type and the maximum number of hits to be displayed . the backbone superposition of the query structure and the database hits selected by the user are displayed with jmol ( 13 ) . if the superposition score is above the false - positive cutoff score , then the corresponding ec number is listed in blue color . the versions of 3d - hit , pd - split , that were optimized for the 3d - fun server , and all necessary scripts to build your own 3d - fun server are available from the cmbi site too . equivalents of blast words . for each structural  word , a set of template fragments is collected where ( i ) the residues in the centers are identical , where ( ii ) both distances between the first and the last c- atoms are within 3  and where ( iii ) the rmsd after optimal superposition is below 3  . the rotation matrix and the translation vectors calculated during the superposition are used to rotate a 99-residues long segment of the query protein centered in the middle of the fragments . after the rotation , 99  99 dynamic programming matrix with spatial pairs of atoms denoted with 1 or 0 is created . the aligned segments are superimposed and the calculated rotation matrix and translation vectors are used to compare fragments of 299 residues , in the same way as previously . the highest score obtained after the last alignment is used as a measure of similarity between the query and template proteins . the predictions generated by the 3d - fun server are as good as structural alignments produced by the 3d - hit program  the main core of the service . here , we show the benchmark comparing results obtained using the 3d - hit algorithm with results generated by the vast program a data set of structural alignments between 45 537 protein chains generated by the vast program was downloaded from the ncbi ftp server ( ftp.ncbi.nih.gov/mmdb/vastdata ) . a total of 21 785 of those chains have annotated enzyme function in the corresponding pdb files . protein sequences of these enzymes were clustered at the level of 90% amino acid identity using the cd - hit sequence alignment program ( 7 ) . only one sequence from each cluster was used in the set of 3153 nonredundant proteins with known ec numbers and calculated structural vast alignments . for each of those enzymes , we identified two proteins with the highest vast alignment score ; one of which has the same ec code and the other with a different one . the detection of the most structurally similar pairs of enzymes with the same and different function was then performed using the 3d - hit program . we determined which alignment score best separates proteins with the same enzyme function from those with different ec codes . figure 2 presents four roc curves ; each curve corresponds to one level of the enzyme classification . in this test , the 3d - hit algorithm scored slightly better than the vast program . both methods outperformed results obtained with random alignment scores . figure 2.roc curves for the 1st ec level ( upper left chart ) ; 1st and 2nd ec level ( upper right chart ) ; 1st , 2nd and 3rd ec level ( lower left chart ) and for all four ec levels ( lower right chart ) . note that the roc curves for the random case ( shown in black ) are not diagonal lines as is usual in roc plots . this is a consequence of the fact that prediction of enzyme function is a more difficult problem than bimodal classifications . clearly , the probability of assigning an incorrect ec number in the random test is much bigger than assigning a correct one . roc curves for the 1st ec level ( upper left chart ) ; 1st and 2nd ec level ( upper right chart ) ; 1st , 2nd and 3rd ec level ( lower left chart ) and for all four ec levels ( lower right chart ) . note that the roc curves for the random case ( shown in black ) are not diagonal lines as is usual in roc plots . this is a consequence of the fact that prediction of enzyme function is a more difficult problem than bimodal classifications . clearly , the probability of assigning an incorrect ec number in the random test is much bigger than assigning a correct one . the query protein structure is dissected into overlapping fragments of 13 residues  equivalents of blast words . for each structural  word , a set of template fragments is collected where ( i ) the residues in the centers are identical , where ( ii ) both distances between the first and the last c- atoms are within 3  and where ( iii ) the rmsd after optimal superposition is below 3  . the rotation matrix and the translation vectors calculated during the superposition are used to rotate a 99-residues long segment of the query protein centered in the middle of the fragments . after the rotation , 99  99 dynamic programming matrix with spatial pairs of atoms denoted with 1 or 0 is created . the aligned segments are superimposed and the calculated rotation matrix and translation vectors are used to compare fragments of 299 residues , in the same way as previously . the highest score obtained after the last alignment is used as a measure of similarity between the query and template proteins . the predictions generated by the 3d - fun server are as good as structural alignments produced by the 3d - hit program  the main core of the service . here , we show the benchmark comparing results obtained using the 3d - hit algorithm with results generated by the vast program  one of the best - known programs for structural comparison of proteins . a data set of structural alignments between 45 537 protein chains generated by the vast program was downloaded from the ncbi ftp server ( ftp.ncbi.nih.gov/mmdb/vastdata ) . a total of 21 785 of those chains have annotated enzyme function in the corresponding pdb files . protein sequences of these enzymes were clustered at the level of 90% amino acid identity using the cd - hit sequence alignment program ( 7 ) . only one sequence from each cluster was used in the set of 3153 nonredundant proteins with known ec numbers and calculated structural vast alignments . for each of those enzymes , we identified two proteins with the highest vast alignment score ; one of which has the same ec code and the other with a different one . the detection of the most structurally similar pairs of enzymes with the same and different function was then performed using the 3d - hit program . we determined which alignment score best separates proteins with the same enzyme function from those with different ec codes . figure 2 presents four roc curves ; each curve corresponds to one level of the enzyme classification . in this test , the 3d - hit algorithm scored slightly better than the vast program . both methods outperformed results obtained with random alignment scores . figure 2.roc curves for the 1st ec level ( upper left chart ) ; 1st and 2nd ec level ( upper right chart ) ; 1st , 2nd and 3rd ec level ( lower left chart ) and for all four ec levels ( lower right chart ) . note that the roc curves for the random case ( shown in black ) are not diagonal lines as is usual in roc plots . this is a consequence of the fact that prediction of enzyme function is a more difficult problem than bimodal classifications . clearly , the probability of assigning an incorrect ec number in the random test is much bigger than assigning a correct one . roc curves for the 1st ec level ( upper left chart ) ; 1st and 2nd ec level ( upper right chart ) ; 1st , 2nd and 3rd ec level ( lower left chart ) and for all four ec levels ( lower right chart ) . note that the roc curves for the random case ( shown in black ) are not diagonal lines as is usual in roc plots . this is a consequence of the fact that prediction of enzyme function is a more difficult problem than bimodal classifications . clearly , the probability of assigning an incorrect ec number in the random test is much bigger than assigning a correct one . all structural genomics consortia together have deposited ( 28 february 2008 ) 6292 protein structures of which 1925 are labeled with function unknown and another 2411 have no ec - code given ( provided numbers corresponds to sequentially redundant entries ) . not having an ec - code obviously does not always mean that the function is not known , as many proteins simply do not have an ec - code associated or are not enzymes at all . still , it was not difficult to make the short list of examples of proteins with know structure and unknown function that is shown in table 2 . in this table , we list five examples of proteins for which the 3d - fun server can predict the function with decreasing degrees of certainty . table 2.five examples of functional annotations made using 3d-funno.pdb accession codespredicted ec numberpredicted enzyme function1.2qmm , 2qwv2.1.1.methyltransferase2.1zee1.3.11.indoleamine 2,3-dioxygenase3.2g7z2.7.1.phosphotransferase with an alcohol group as acceptor4.3bbj3.1 . five examples of functional annotations made using 3d - fun the predictions 1 and 2 are explained in greater detail in the text . example number 1 shows the prediction for two unpublished protein structures deposited by the mcsg ( table 1 ) that come from archaeoglobus fulgidus and vibrio cholerae species and have the pdb accession code : 2qmm and 2qwv , respectively . these two proteins belong to the pfam ( 8) duf358 family , which is a member of the /-knot clan . the duf358 family contains a series of 200 amino acids long archaeal and bacterial proteins . the function of these proteins is still unknown ; however , they do contain several conserved histidine and aspartate residues that might form a metal - binding site . the 3d - fun server predicted that these two proteins have a methyltransferase function ( ec - code 2.1.1. ) . similar results were obtained in our previous studies , where we showed that four other hypothetical proteins ( with the pdb accession codes : 1vh0 , 1ns5 , 1o6d and 1to0 ) are probably also methyltransferase enzymes ( 4 ) . both predictions are supported by the fact that these six proteins share the same deep trefoil knot structure in the catalytic domain and have conserved a noncanonical adomet / adohcy - binding site ( 4 ) . example number 2 presents the functional annotation for 1zee of the hypothetical protein so4414 from shewanella oneidensis , which has been deposited by the nsgc ( table 1 ) . this protein is a member of the pfam duf1864 family , which still remains to be characterized . a 3d - hit structural search detected a strong similarity to a indoleamine 2,3-dioxygenase family , represented by the 2d0 t structure ( 9 ) . the 3d - clust program provided similar results by clustering the query model with three dioxygenase enzymes [ 2d0 t , 1yw0 and 2nox ( 10 ) ] into one well - superposing group . figure 3.superposition of a query structure 1zee and a protein structure of indoleamine 2,3-dioxygenase function with the 2d0 t pdb code . these two proteins share only 17% sequence identity but over 66% of their c- atoms are aligned and within 3  . the chains are colored from blue ( n - termini ) to red ( c - termini ) . superposition of a query structure 1zee and a protein structure of indoleamine 2,3-dioxygenase function with the 2d0 t pdb code . these two proteins share only 17% sequence identity but over 66% of their c- atoms are aligned and within 3  . the chains are colored from blue ( n - termini ) to red ( c - termini ) . indeed , the exprot project ( 11 ) showed that the function annotations in sequence databases are for the largest part obtained this way . the 3d - fun server is heavily based on the concept that structure is more conserved than function , and that similar structures must indicate an evolutionary divergent relation and thus also functional similarity . the tim - barrel motif , for example , has been associated with dozens of different functions ( 12 ) . however , this is not as large as a problem as it initially looks because if structural comparison hits are found to proteins with different functions we know we can not predict a function , and the server lists all hits with and concludes function unknown. things do go really wrong , however , when only one structure with known function is found in the database while multiple similar structures with very different functions are still waiting to be solved . even if 3d - fun predicts two different functions for a protein , the user is still helped because an experiment to validate a few function predictions is , of course , much simpler to perform than a totally ab initio experimental function determination . at present it is still relatively easy to perform an all - against - all structure superposition for all proteins in the pdb . if , 1 day , the speed by which the structural genomics consortia solve their structures outruns the speed of our computers , then we can speed up the process by leaving out pdb files without known function or pdb files that are structurally and functionally similar to other pdb files already in the 3d - fun database . additionally , we can also try using the grid rather than just one cluster computer . efforts to run 3d - fun on the dutch national bioscience grid are underway and results look promising .
the  omics revolution is causing a flurry of data that all needs to be annotated for it to become useful . 
 sequences of proteins of unknown function can be annotated with a putative function by comparing them with proteins of known function . 
 this form of annotation is typically performed with blast or similar software . 
 structural genomics is nowadays also bringing us three dimensional structures of proteins with unknown function . 
 we present here software that can be used when sequence comparisons fail to determine the function of a protein with known structure but unknown function . 
 the software , called 3d - fun , is implemented as a server that runs at several european institutes and is freely available for everybody at all these sites . 
 the 3d - fun servers accept protein coordinates in the standard pdb format and compare them with all known protein structures by 3d structural superposition using the 3d - hit software . 
 if structural hits are found with proteins with known function , these are listed together with their function and some vital comparison statistics . 
 this is conceptually very similar in 3d to what blast does in 1d . 
 additionally , the superposition results are displayed using interactive graphics facilities . 
 currently , the 3d - fun system only predicts enzyme function but an expanded version with gene ontology predictions will be available soon . 
 the server can be accessed at http://3dfun.bioinfo.pl/ or at http://3dfun.cmbi.ru.nl/.