protein interfaces are drawing much attention of the structural bioinformatics community as well as the rest of the biological world .
many articles have been published classifying complexes according to function , and analyzing the properties that characterize them .
several prediction engines have been developed in order to analyze interfaces , and predict their location for the various interaction types ( 15 ) .
this appears already at the level of how interfaces are defined ( change in accessible surface area or various cutoff distances either between heavy atoms or c atoms ) .
further it goes through the definition of successful prediction , which is measured at the level of proteins , amino acids or predefined surface patches ( 611 ) .
finally , it concerns basic issues such as the role of evolutionary conservation in binding that is still controversial ( 10,12,13 ) .
we contributed to this effort , through the development of promate ( 14 ) , a protein - binding sites prediction server .
thirteen different properties were examined in promate , and using a reduced brute - force optimization , a subset of nine of them was selected to be counted in the final prediction . at this point , having examined many different alternatives , the field of binding - site prediction has matured to be able to converge to common guiding definitions that are considered most suitable , and are needed in order to focus on the goal itself . a community - wide effort is required for this to be accomplished . moreover , as research evolves , new insights can improve the prediction . in some cases
, the original motivation might not be directly related to the prediction of protein - binding sites rather provide an independent measure related to proteins . in others , the information regarding binding sites location can amplify the significance of a new result . in any case , the value of having a simple tool for testing the relevance of new features to proteins binding potential is evident . to this aim , we leveraged promate into a generic protein - binding sites analysis web tool , promateus . here
, we present this tool and its utilization for three types of results that can be drawn from this type of analysis : improving promate 's prediction accuracy , extending promate for the prediction of protein dna binding sites , using a relevant training dataset , and for the comparison of a newly suggested definition of secondary structure compositions of proteins based on interaction networks to traditional secondary prediction methods for their binding site occupancy
. however , the real goal of promateus is to promote a new idea of open research with promateus providing an open web tool that facilitates the examination of features that are relevant for binding sites prediction .
currently , promateus allows analyzing new features over three databases : the set of unbound proteins involved in transient - hetero interactions ( originally used in promate ) , a bound database of monomeric proteins having a binding site for dna and a database of models produced for this bound database , to help discarding features that are artifacts of the bound case .
the user , suggesting a new feature that can potentially designate the interface location , should download the relevant database , and upload back the files with the relevant new information ( on the whole , or only part of the database ) .
promateus will execute a three - phase feature selection procedure to evaluate the contribution of this feature to the prediction success .
feature selection schemes operate in one of three modes : as filters , as wrappers or as an embedded optimization .
filters are statistical tests that are applied to the data independently of the prediction algorithm .
embedded algorithms are methods in which the feature selection and the prediction stages are inseparable . in the first phase , promateus uses a simple filtering scheme . a histogram is produced , presenting the distribution of the feature values at interfaces versus the rest of the surface . for categorical features ,
as an alternative , the log file also presents the p - value evaluated from the pearson 's correlation coefficient .
if the suggested feature passes this filter namely , the curves are significantly different ; promateus uses a logistic regression ( lr ) optimization in 5-fold cross - validation of the new feature together with promate 's original properties . to simplify the model ,
the weights assigned by the optimization are limited to the range , thus no complicated dependencies between features are allowed .
due to the equivalence of promate 's scoring scheme to lr ( explained in the methods section ) this would generally be classified as an embedded scheme .
however , note that the lr procedure differs from promate by the fact that it acts on the space of the surface dots ( see supplementary data for detailed description of methods ) , and not yet at the level of the proteins .
if the suggested feature was assigned a significant weight , in order to reduce noise , a second lr optimization is executed in which features with a weight smaller than one sd from zero ( over the 5-fold split ) are eliminated .
finally , these weights are used for the final prediction using promate , and the success is measured at the level of the proteins .
the role of the third phase of the optimization is to rule out new features that are overlapping to existing ones .
the lr procedure is not biased to prefer as few features as possible ; rather , in case of two equivalent features the weight will be divided between them .
this by itself can enhance the robustness of the server , since the noise of two different features containing the same information would be reduced .
therefore , the lr optimization is executed as is on all promate 's existing scores .
since the addition of new features to promate would involve additional work , this phase is used in promateus to rule out new features that do not contain new information . in summary , promateus returns one of three possible answers : the suggested feature might be irrelevant for interfaces , it might contain information about interfaces , but in a manner that overlaps the features that are already in use , and thus the final prediction is not improved , or it can add orthogonal information that improves the final prediction . in the latter case , the intention is to integrate such scores into promate .
the original feature optimization used in promate was a heavy , brute - force - like optimization procedure , that was limited to choosing features , but did not allow weighting them .
in addition to being computationally heavy , such a procedure , risks overfitting to the available database . using the lr optimization that is limited to a simple model , which is further simplified by limiting the weights to the range of   downgrades this problem .
the results of re - estimating the features used in promate shows some disagreement with its original feature selection .
also , the sequence distance that is the distance between residues along the peptide chain that tends for the longer distances at interfaces was found significant .
finally , the number of bound water molecules proved to be higher at interfaces already at the unbound structure .
all these features are described in detail elsewhere ( 14 ) . using these four scores with a weight of 1 , the prediction improves from 36 correct predictions out of 51 predictions produced , to 38 out of 55 .
were claimed to be significant for interface recognition ; among those are improved evaluation of evolutionary conservation ( such as whiscy ( 3 ) and consurf ( 4 ) ) , the distance of each atom from the center of mass in enzymes ( 15 ) , and high - frequency vibrating residues ( 16 ) .
specifically , whiscy was run through its web server , limited to the calculation of the evolutionary score alone , to avoid overlap with the aa propensities which already exist in promate .
consurf was run through its web server , with all the default values except homologs that are collected from uniprot .
the distance of each atom from the center of mass was calculated both at the level of atoms , and at the level of amino acids .
high - frequency vibrating residues were extracted from the ignm database ( http://ignm.ccbb.pitt.edu/filedownload.htm ) taking the residue mean - square fluctuations driven by the joint contribution of the highest 10 modes .
all these features failed before the last phase , namely , though they contain relevant information to interfaces , they do not improve the interface prediction within the suggested model .
this conclusion might be inaccurate for the feature of the distance of the atom from the center of mass since the authors claim it should only apply to enzymes , which are a small fraction of the database used .
the result of promate together with each of these features is presented in table 1 .
the bounds for this are optional parameters in promateus , allowing the user to experience with a full range of bounds , determining the sensitivity and specificity of the prediction . throughout our analysis ,
a prediction is defined successful if it is reliable , namely , if at least 50% of the predicted interface patch is truly so . the number of successful predictions achieved over the proteins is presented in figure 1 .
we found a hard core of 20 proteins that were predicted by all the different combinations , 13 proteins that were not predicted by any of the combinations and 24 proteins that were predicted correctly by only some combination .
excluding the distance from the proteins ' center of mass , one can see that the scores are overlapping , and the differences are within the noise .
the re - optimized promate has the highest coverage ( 0.96 ) but a success rate of only 0.69 ( resulting in 38 correct predictions ) , while promate + whiscy has a coverage of only 0.77 but with a success rate of 0.75 resulting in 33 correct predictions . which of the two choices is better depends whether one needs high coverage or a higher success rate . 

the pie chart shows the fraction of proteins where the binding site was predicted by all 4 methods ( 20 proteins ) , 3 methods ( 8) , 2 methods ( 12 ) , 1 method ( 4 ) or where all the predictors failed ( 13 proteins ) . 

table 1.success rate of promate with new featuresfeatures combinationnumber of predictionscoveragenumber of successful predictionssuccess ratepromate510.89360.71re - optimized promate550.96380.69promate + consurf ( 4)490.86350.71promate + whiscy ( 3)440.77330.75promate + cmdist ( 15)420.74260.62 an overview of the protein 
the pie chart shows the fraction of proteins where the binding site was predicted by all 4 methods ( 20 proteins ) , 3 methods ( 8) , 2 methods ( 12 ) , 1 method ( 4 ) or where all the predictors failed ( 13 proteins ) .
success rate of promate with new features protein  dna - binding sites present an additional class of important biochemical interactions . their interfaces are similar to protein  protein interfaces in the sense that both span over a large patch on the protein surface , and thus the same nature of analysis would be appropriate .
the strongest property that characterizes dna - binding proteins is their positive electrostatic potential used to attract the negatively charged dna .
studies also incorporated sequential properties such as evolutionary conservation and the frequency of favored residues like lysine and arginine , as well as structural properties of surface curvature and accessible surface area , together with the helix - turn - helix motif that is abundant in dna - binding proteins ( but is not limited to them ) ( 1720 ) . to demonstrate the great advantage in the simplicity of promateus
, we utilized the available features used in promate and applied them to a database of protein - dna interfaces .
this potential was constructed by simulating a negative charge at the center of every circle on the protein surface using the program pare ( 21 ) ( see methods section ) . since the available unbound database was limited to six proteins , we replaced it by a database of simple models constructed by the fast calculation option of modweb , the web server running modeller ( 22 ) .
modweb assigned each protein from the bound database a template from the pdb , based on sequence similarity .
then , a structure was constructed based on this template and a force - field optimization . as the number of water molecules and temperature factor distribution are biased in case of the bound structures , and unavailable for the models , both were excluded .
the selected features in decreasing importance according to the optimization on the bound database are the distribution of the atoms , the electrostatic potential , the secondary structure , the evolutionary conservation , distribution of aa pairs , single amino acid distribution and finally the chemical character of atoms .
a good agreement was observed between the bound and models databases with the main difference being that in the models the importance of the chemical character increased significantly while the weight of the electrostatic potential was low .
this is self explanatory by the fact that in order to accurately calculate the electrostatic potential , a high - resolution structure is required .
this , of course , would not be the situation in unbound structures , and thus , the models provide a somewhat strict test case , though still of a value by itself . in the prediction test ,
only one protein ( 1quma ) failed to yield any prediction ( table i in the supplementary data ) . for 30 of the remaining 47 proteins the sites
were predicted successfully , giving a success rate of 64% . for the models database ,
going down into the details , 3 proteins ( 1e7ka , 1ewna and 1feua ) were predicted successfully for the models , and failed on the bound database .
all three models used the original structure as a template for modeling , and the prediction on the bound structure was at the right place , but with a true positive rate lower than 0.5 ( 0.41 , 0.42 , and 0.25 , respectively ) .
three of them were modeled by other proteins with 100% sequence similarity and two of them with lower similarity .
for all the five , the binding site was found for the model with a true positive rate of at least 25% .
thus , the agreement between the predictions on the models and bound databases is high .
the robustness of promateus is exemplified through the fact that the success rate achieved is close to the ones reported , though no specific optimization to dna - binding proteins was done .
the consistency of the feature selection over the two databases validates the method being used .
the role of secondary structures at interfaces has been discussed previously , raising many contradicting conclusions .
( 24 ) used it in a neural network aiming to predict interfaces and found it had a low weight in the prediction .
protein interactions exhibit characteristics similar to internal strands rather than regular edge strands , and used this property for interface prediction . in the analysis of promate we found interfaces to be richer in -sheets and poorer in -helices , in cases where both these structures appear at the same protein .
thus , there is still an uncertainty about the significance that should be associated with the secondary structure in this context .
the classification to secondary structure is an example for a characteristic that could be misleading .
ascribing an amino acid to one of the classes is strongly dependent on its sequence neighbors , and indeed the most popular secondary structure prediction algorithms are based on sequential relations , e.g. hidden markov models .
therefore , we re - analyzed this property more carefully , at the protein level , using hierarchical bootstrapping .
in addition , the sampling at the level of the protein instead of the amino acid widens the confidence intervals , to an uncertainty level . as a counterexample
, one can consider the amino acid distribution that does not differ between the two ways of analysis ( data not shown ) . 

the amino acid secondary structure categories at the upper rows were extracted using promotif , with h representing helices , g310 helices ; e  strands ; s  bends ; t  turns ; b  beta bridges ; small letters stand for edges of the relevant structure .
the classification as described by the authors : 1 : sheet - like loops ; 2 : parallel sheets ; 3 : anti - parallel sheets ; 46 : loops ; 7 : short and flexible helices ; 8 : long helices .
the amino acid secondary structure categories at the upper rows were extracted using promotif , with h representing helices , g310 helices ; e  strands ; s  bends ; t  turns ; b  beta bridges ; small letters stand for edges of the relevant structure .
the classification as described by the authors : 1 : sheet - like loops ; 2 : parallel sheets ; 3 : anti - parallel sheets ; 46 : loops ; 7 : short and flexible helices ; 8 : long helices . in comparison to the traditional definition of secondary structures discussed above ,
we examine a new definition of secondary structures suggested recently ( 26 ) . while the common definition used in promotif ( 27 ) is based on predefined angels between consecutive amino acids , the definition suggested by raveh et al .
is based on spatial features extracted by clustering the proteins contact map defined by the backbone and hydrogen bonds . comparing the distributions based on the two definitions
class number 4 , which is associated with a subset of the loops , shows a significant preference for non - binding surfaces , while no class shows a significant difference with the traditional definition .
currently , promateus allows analyzing new features over three databases : the set of unbound proteins involved in transient - hetero interactions ( originally used in promate ) , a bound database of monomeric proteins having a binding site for dna and a database of models produced for this bound database , to help discarding features that are artifacts of the bound case .
the user , suggesting a new feature that can potentially designate the interface location , should download the relevant database , and upload back the files with the relevant new information ( on the whole , or only part of the database ) .
promateus will execute a three - phase feature selection procedure to evaluate the contribution of this feature to the prediction success .
feature selection schemes operate in one of three modes : as filters , as wrappers or as an embedded optimization .
filters are statistical tests that are applied to the data independently of the prediction algorithm .
embedded algorithms are methods in which the feature selection and the prediction stages are inseparable . in the first phase , promateus uses a simple filtering scheme . a histogram is produced , presenting the distribution of the feature values at interfaces versus the rest of the surface . for categorical features ,
as an alternative , the log file also presents the p - value evaluated from the pearson 's correlation coefficient .
if the suggested feature passes this filter namely , the curves are significantly different ; promateus uses a logistic regression ( lr ) optimization in 5-fold cross - validation of the new feature together with promate 's original properties . to simplify the model ,
the weights assigned by the optimization are limited to the range , thus no complicated dependencies between features are allowed .
due to the equivalence of promate 's scoring scheme to lr ( explained in the methods section ) this would generally be classified as an embedded scheme .
however , note that the lr procedure differs from promate by the fact that it acts on the space of the surface dots ( see supplementary data for detailed description of methods ) , and not yet at the level of the proteins .
if the suggested feature was assigned a significant weight , in order to reduce noise , a second lr optimization is executed in which features with a weight smaller than one sd from zero ( over the 5-fold split ) are eliminated .
finally , these weights are used for the final prediction using promate , and the success is measured at the level of the proteins .
the role of the third phase of the optimization is to rule out new features that are overlapping to existing ones .
the lr procedure is not biased to prefer as few features as possible ; rather , in case of two equivalent features the weight will be divided between them .
this by itself can enhance the robustness of the server , since the noise of two different features containing the same information would be reduced .
therefore , the lr optimization is executed as is on all promate 's existing scores .
since the addition of new features to promate would involve additional work , this phase is used in promateus to rule out new features that do not contain new information . in summary , promateus returns one of three possible answers : the suggested feature might be irrelevant for interfaces , it might contain information about interfaces , but in a manner that overlaps the features that are already in use , and thus the final prediction is not improved , or it can add orthogonal information that improves the final prediction . in the latter case , the intention is to integrate such scores into promate .
the original feature optimization used in promate was a heavy , brute - force - like optimization procedure , that was limited to choosing features , but did not allow weighting them .
in addition to being computationally heavy , such a procedure , risks overfitting to the available database . using the lr optimization that is limited to a simple model , which is further simplified by limiting the weights to the range of   downgrades this problem .
the results of re - estimating the features used in promate shows some disagreement with its original feature selection .
also , the sequence distance that is the distance between residues along the peptide chain that tends for the longer distances at interfaces was found significant .
finally , the number of bound water molecules proved to be higher at interfaces already at the unbound structure .
all these features are described in detail elsewhere ( 14 ) . using these four scores with a weight of 1 , the prediction improves from 36 correct predictions out of 51 predictions produced , to 38 out of 55 .
were claimed to be significant for interface recognition ; among those are improved evaluation of evolutionary conservation ( such as whiscy ( 3 ) and consurf ( 4 ) ) , the distance of each atom from the center of mass in enzymes ( 15 ) , and high - frequency vibrating residues ( 16 ) .
specifically , whiscy was run through its web server , limited to the calculation of the evolutionary score alone , to avoid overlap with the aa propensities which already exist in promate .
consurf was run through its web server , with all the default values except homologs that are collected from uniprot .
the distance of each atom from the center of mass was calculated both at the level of atoms , and at the level of amino acids .
high - frequency vibrating residues were extracted from the ignm database ( http://ignm.ccbb.pitt.edu/filedownload.htm ) taking the residue mean - square fluctuations driven by the joint contribution of the highest 10 modes .
all these features failed before the last phase , namely , though they contain relevant information to interfaces , they do not improve the interface prediction within the suggested model .
this conclusion might be inaccurate for the feature of the distance of the atom from the center of mass since the authors claim it should only apply to enzymes , which are a small fraction of the database used .
the result of promate together with each of these features is presented in table 1 .
the bounds for this are optional parameters in promateus , allowing the user to experience with a full range of bounds , determining the sensitivity and specificity of the prediction . throughout our analysis ,
a prediction is defined successful if it is reliable , namely , if at least 50% of the predicted interface patch is truly so .
we found a hard core of 20 proteins that were predicted by all the different combinations , 13 proteins that were not predicted by any of the combinations and 24 proteins that were predicted correctly by only some combination . excluding the distance from the proteins ' center of mass
, one can see that the scores are overlapping , and the differences are within the noise .
the re - optimized promate has the highest coverage ( 0.96 ) but a success rate of only 0.69 ( resulting in 38 correct predictions ) , while promate + whiscy has a coverage of only 0.77 but with a success rate of 0.75 resulting in 33 correct predictions . which of the two choices is better depends whether one needs high coverage or a higher success rate . 

the pie chart shows the fraction of proteins where the binding site was predicted by all 4 methods ( 20 proteins ) , 3 methods ( 8) , 2 methods ( 12 ) , 1 method ( 4 ) or where all the predictors failed ( 13 proteins ) . 

table 1.success rate of promate with new featuresfeatures combinationnumber of predictionscoveragenumber of successful predictionssuccess ratepromate510.89360.71re - optimized promate550.96380.69promate + consurf ( 4)490.86350.71promate + whiscy ( 3)440.77330.75promate + cmdist ( 15)420.74260.62 an overview of the protein 
the pie chart shows the fraction of proteins where the binding site was predicted by all 4 methods ( 20 proteins ) , 3 methods ( 8) , 2 methods ( 12 ) , 1 method ( 4 ) or where all the predictors failed ( 13 proteins ) .
their interfaces are similar to protein  protein interfaces in the sense that both span over a large patch on the protein surface , and thus the same nature of analysis would be appropriate .
therefore , we enhanced promateus to also apply to them . the strongest property that characterizes dna - binding proteins is their positive electrostatic potential used to attract the negatively charged dna .
studies also incorporated sequential properties such as evolutionary conservation and the frequency of favored residues like lysine and arginine , as well as structural properties of surface curvature and accessible surface area , together with the helix - turn - helix motif that is abundant in dna - binding proteins ( but is not limited to them ) ( 1720 ) . to demonstrate the great advantage in the simplicity of promateus
, we utilized the available features used in promate and applied them to a database of protein - dna interfaces . due to its importance , a simple electrostatic score was added .
this potential was constructed by simulating a negative charge at the center of every circle on the protein surface using the program pare ( 21 ) ( see methods section ) . since the available unbound database was limited to six proteins , we replaced it by a database of simple models constructed by the fast calculation option of modweb , the web server running modeller ( 22 ) .
modweb assigned each protein from the bound database a template from the pdb , based on sequence similarity .
then , a structure was constructed based on this template and a force - field optimization . as the number of water molecules and temperature factor distribution are biased in case of the bound structures , and unavailable for the models , both were excluded .
the selected features in decreasing importance according to the optimization on the bound database are the distribution of the atoms , the electrostatic potential , the secondary structure , the evolutionary conservation , distribution of aa pairs , single amino acid distribution and finally the chemical character of atoms .
a good agreement was observed between the bound and models databases with the main difference being that in the models the importance of the chemical character increased significantly while the weight of the electrostatic potential was low .
this is self explanatory by the fact that in order to accurately calculate the electrostatic potential , a high - resolution structure is required .
this , of course , would not be the situation in unbound structures , and thus , the models provide a somewhat strict test case , though still of a value by itself . in the prediction test ,
only one protein ( 1quma ) failed to yield any prediction ( table i in the supplementary data ) . for 30 of the remaining 47 proteins the sites
were predicted successfully , giving a success rate of 64% . for the models database ,
going down into the details , 3 proteins ( 1e7ka , 1ewna and 1feua ) were predicted successfully for the models , and failed on the bound database .
all three models used the original structure as a template for modeling , and the prediction on the bound structure was at the right place , but with a true positive rate lower than 0.5 ( 0.41 , 0.42 , and 0.25 , respectively ) .
three of them were modeled by other proteins with 100% sequence similarity and two of them with lower similarity .
for all the five , the binding site was found for the model with a true positive rate of at least 25% .
thus , the agreement between the predictions on the models and bound databases is high .
the robustness of promateus is exemplified through the fact that the success rate achieved is close to the ones reported , though no specific optimization to dna - binding proteins was done .
the consistency of the feature selection over the two databases validates the method being used .
the role of secondary structures at interfaces has been discussed previously , raising many contradicting conclusions .
( 24 ) used it in a neural network aiming to predict interfaces and found it had a low weight in the prediction .
protein interactions exhibit characteristics similar to internal strands rather than regular edge strands , and used this property for interface prediction . in the analysis of promate
we found interfaces to be richer in -sheets and poorer in -helices , in cases where both these structures appear at the same protein .
thus , there is still an uncertainty about the significance that should be associated with the secondary structure in this context .
the classification to secondary structure is an example for a characteristic that could be misleading .
ascribing an amino acid to one of the classes is strongly dependent on its sequence neighbors , and indeed the most popular secondary structure prediction algorithms are based on sequential relations , e.g. hidden markov models .
therefore , we re - analyzed this property more carefully , at the protein level , using hierarchical bootstrapping .
in addition , the sampling at the level of the protein instead of the amino acid widens the confidence intervals , to an uncertainty level . as a counterexample
, one can consider the amino acid distribution that does not differ between the two ways of analysis ( data not shown ) . 

the amino acid secondary structure categories at the upper rows were extracted using promotif , with h representing helices , g310 helices ; e  strands ; s  bends ; t  turns ; b  beta bridges ; small letters stand for edges of the relevant structure .
the classification as described by the authors : 1 : sheet - like loops ; 2 : parallel sheets ; 3 : anti - parallel sheets ; 46 : loops ; 7 : short and flexible helices ; 8 : long helices . comparison of secondary structure distribution at protein versus amino- acid level .
the amino acid secondary structure categories at the upper rows were extracted using promotif , with h representing helices , g310 helices ; e  strands ; s  bends ; t  turns ; b  beta bridges ; small letters stand for edges of the relevant structure .
the classification as described by the authors : 1 : sheet - like loops ; 2 : parallel sheets ; 3 : anti - parallel sheets ; 46 : loops ; 7 : short and flexible helices ; 8 : long helices . in comparison to the traditional definition of secondary structures discussed above ,
we examine a new definition of secondary structures suggested recently ( 26 ) . while the common definition used in promotif ( 27 ) is based on predefined angels between consecutive amino acids , the definition suggested by raveh et al .
is based on spatial features extracted by clustering the proteins contact map defined by the backbone and hydrogen bonds . comparing the distributions based on the two definitions
class number 4 , which is associated with a subset of the loops , shows a significant preference for non - binding surfaces , while no class shows a significant difference with the traditional definition .
the internet revolution dictates a communal way of research . the simplified communication in the  global village increases the creation of new knowledge and its utilization around the world .
many servers that provide various scientific services have been established , and are used as daily scientific tools .
the vision lying at the base of promateus suggests taking this community - research approach one step further .
the industrial community has already acknowledged the advantages of the open source model of system development , in which portions of source - codes are freely distributed by individuals and companies from around the world .
in addition to a fast development rate , such projects are considered superior in contribution to world standards , in improved project modularity and even from financial aspects .
the potential of such tools to advance specific areas of research is tremendous , and suggests a way of worldwide research communication that up until now was only available though important contest projects , such as casp and capri .
the open - research approach differs from the open source by one intrinsic complication that should be acknowledged . when testing many features over the same limited data , the probability of overfitting , i.e. that a random feature would be found significant by chance increases .
however , this should not prevent the development of such projects . employing careful filtering ( and cross validation ) and updating the available databases
taken to the extreme , consider all the structural bioinformatics labs working on one database  the pdb . applying a careful analysis
yet , one has to keep in mind the theoretical limitations of such a system , and consider the results carefully . in the context of binding - site prediction ,
new features gaining from the expertize of different labs can be easily checked and incorporated into the exiting framework .
one of the hardest problems in the field is the disagreement over the basic definitions , such as those of the binding site itself , and of a successful prediction . having future similar tools , the inherent natural selection of the web will enable the objective comparison of the various tools and definitions and the convergence to the most promising ones .
the goal of enhancing the understanding of protein recognition is by itself interesting , and important for applications that are not directly related to binding - site prediction .
this article is the first known to us that analyzes dna - binding site of protein models . due to lack of unbound structures , studies in the field
homology models are a neglected class , though these occupy most of the currently available structure space .
the goal of predicting the location of the binding site on modeled structures might be more complicated than unbound structures but is certainly worth pursuing .
the results in this article showed that the electrostatic potential , considered most important for dna - binding site identification , significantly loses its strength to a more general chemical character representation when only a model is available . a comparison to a model built on an unbound template
an important issue that is raised in this article is the alternative ways of analyzing the same property .
the analysis at the protein versus aa level exemplifies a problem that most probably rises in many similar studies .
the analysis at the protein level reduces the effect of intra - protein dependencies , but at the same time loses confidence due to smaller sample size . on the other hand , taking the mean over all the proteins removes the bias in favor of larger proteins , but will ascribe higher weight to outlier proteins . when analyzing a new property
, one should carefully examine both options , and choose the one which seems more appropriate for the specific case . to conclude , the main objective of this article is to export the idea of  open - research into a simple , user - friendly web - based server .
using this idea , the bioinformatics research can leverage above small independent projects and evolve towards fewer centralized worldwide cooperations that integrate different modules contributed by labs around the world .
we believe that due to its nature , biological research that often requires high expertize in a small - scale area of research would gain significantly from this approach .
 the development of bioinformatic tools by individual labs results in the abundance of parallel programs for the same task . for example , identification of binding site regions between interacting proteins is done using : promate , whiscy , ppi - pred , pinup and others . 
 all servers first identify unique properties of binding sites and then incorporate them into a predictor . 
 obviously , the resulting prediction would improve if the most suitable parameters from each of those predictors would be incorporated into one server . however , because of the variation in methods and databases , this is currently not feasible . here 
 , the protein - binding site prediction server is extended into a general protein - binding sites research tool , promateus . 
 this web tool , based on promate 's infrastructure enables the easy exploration and incorporation of new features and databases by the user , providing an evaluation of the benefit of individual features and their combination within a set framework . 
 this transforms the individual research into a community exercise , bringing out the best from all users for optimized predictions . 
 the analysis is demonstrated on a database of protein protein and protein - dna interactions . 
 this approach is basically different from that used in generating meta - servers . 
 the implications of the open - research approach are discussed . 
 promateus is available at http://bip.weizmann.ac.il/promate . 
INTRODUCTION
RESULTS
ProMateus
Reanalyzing hetero-transient interactions
ProteinDNA recognition
Secondary structure distributions at interfaces
DISCUSSION
SUPPLEMENTARY DATA