BACKGROUND
protein-rna interactions are involved in various regulatory and constitutional cellular functions.
role for rna in cellular defense and developmental regulation, which involves its interaction with proteins, has also been reported  <cit> .
most of these biological functions involve an accurate identification of specific recognition sites in proteins and rna.
yet, protein-rna interactions are far less understood than protein–dna and protein-protein interactions, partly because fewer structures are available and also likely because these interactions are more complex than the others.
in contrast to the intuitively similar protein-dna interactions, nucleic acid structures in protein-rna complexes are diverse, resulting in a wider range of mechanisms for protein-rna interactions  <cit>  and hence their prediction is more difficult.
several computational approaches have been developed to identify rna-binding proteins and rna-binding sites.
statistical potentials and docking scoring functions derived from databases of complex crystal structures effectively identified rna-binding sites in proteins  <cit> .
prediction of rna-protein interactions from sequences or structures using machine learning methods have also been successfully attempted  <cit> .
however, none of these methods addresses the crucial issue of specific interactions i.e.
the same protein interacts with some rna sequences and not others.
knowledge of exact interaction partners and the mechanism of recognition are essential for an understanding and ability to control rna-level regulatory processes.
hence, an extension of machine learning methods to address this problem is of crucial significance.
we recently addressed the issue of specific recognition of protein and nucleotide subsequences for protein-dna interactions by looking at the dinucleotide specific contact preferences of amino acids in proteins, using sequence and evolutionary contexts, and applied this information to predict specific contacts from sequence  <cit> .
as a natural extension of this approach to rna-binding proteins, and also because some rna-binding proteins are shown to bind regions largely characterized by enrichment in one dinucleotide  <cit> , we explored the possibility of predicting amino acid dinucleotide contacts.
we start with a statistical analysis of protein-rna contacts and identify patterns of contact preferences that contrast or resemble protein-dna contacts.
the prediction model takes a matrix of sequence- and evolutionary profile-derived features and simulates the rna-interacting state of every amino acid residue in a given sequence.
the resulting 16-dimensional multi-class output neural network was optimized by an early-stopping algorithm and five-fold-out cross-validation.
results indicate that specific rna-binding contacts can be predicted with accuracy levels similar to those achieved in dna-binding proteins.
we applied dinucleotide-specific contact predictions to identify full-length rna sequence targets of proteins, with promising success.
in summary, the proposed method can be used in two ways:  to improve the performance of rna-binding sites on proteins, as prediction scores will be modulated by the dinucleotide composition of target rna sequences and one can look for prediction scores that correspond to the dinucleotide enriched in a known target and  predicted binding sites in proteins can be converted to a 16-dimensional dinucleotide score, which works like a pseudo dinucleotide composition itself and candidate target rna sequences can thereby be scored by comparing observed dinucleotide compositions in candidate target sequences and thereby use them to predict targets of rna-binding proteins.
methods
data set
the dataset and annotations have been adopted from our previous work on predicting rna-binding proteins from their electric moments  <cit> .
the data preparation procedure is summarized here as follows.
all protein-rna complexes in the protein data bank   <cit> , which have an annotations in scor database were selected  <cit> .
we eliminated redundancy using blastclust  <cit>  by obtaining clusters at a 25% sequence identity and selecting the chain with the highest number of rna contacts from each of the  <dig> clusters obtained at this threshold.
a final list of  <dig> protein chains and their structural classes, was used to generate and evaluate the models, and is provided as a supplementary table s <dig> .
contact profiles
the contact profiles for the protein sequences were computed from protein-rna complex structures in the compiled data set.
we defined a contact when the distance between any atom in the protein and any atom of the rna dinucleotide is less than  <dig> Å. the contact class of all  <dig> dinucleotide sequence elements is written in alphabetically order viz.
aa, ac, ag, au, ca, cc, cg, cu, ga, gc, gg, gu, ua, uc, ug and uu.
contact statistics and random docking
the statistical significance of contact preferences was evaluated using a chi-squared test with one degree of freedom.
this requires a background contact frequency, which is computed using a random docking procedure, as has been previously used for dna-binding proteins  <cit> .
in this procedure, all observed contacts in each protein-rna complex were divided into unique amino acid-dinucleotide pairs  in accordance with the products of accessible surface area  of the residue and the dinucleotide in question and the expected number of contacts  is given by:
where i, and j refer to  <dig> unique residues and dinucleotides and asa refers to the absolute accessible surface area, computed by the naccess program  <cit> .
coordinates for each protein chain were isolated from the complex structure before computing the asas of amino acid residues.
rna-chains were isolated similarly for dinucleotide asas.
asa refers to the total accessible surface area of all residues of a giventype in a given data set and n is the total number of observed contacts of all residue-dinucleotide pairs.
both observed and expected numbers of contacts were computed for each complex and data were pooled to get the overall chi-squared values for each dinucleotide-amino acid pair as follows:
where i and j have the same meaning as in equation  i.e.
they take values from  <dig> to  <dig> and  <dig> to  <dig> respectively.
eij is computed as in  and oij is the corresponding number of contacts in all complexes  is for one complex but  refers to all complexes taken together).
chi-squared values from observed and expected number of contacts are converted to p-values using standard look-up tables.
chi-squared values computed above denote statistical significance of both positive and negative deviations from expected numbers of counts.
to indicate the exclusion or enrichment of a residue-dinucleotide pair in the interface, signed chi-squared values were obtained by multiplying these values by - <dig> if the observed number of contacts was less than the expected counts.
sequence features
two types of encoding schemes of single protein sequences are widely prevalent and have been adopted for this work.
a first scheme represented an amino acid residue and its neighbours by 21-bit-sparse-encoded binary vectors i.e.
by taking all the  <dig> components to be zero except for the one identifying a given residue, which is set as  <dig>  the first  <dig> components resemble the amino acid type and the last one is labelling terminal positions, without neighbours.
a second scheme represented each residue by its evolutionary profile.
as previously described by us and others  <cit> , the evolutionary profile of a residue, represented as position-specific scoring matrices , was computed by using the psi-blast program and against ncbi's nr database for each protein sequence.
pssms were generated by three iterations of psi-blast with default parameters of blastpgp.
prior to neural network training, a vector representing global amino acid composition  of each protein sequence was concatenated to the feature vector of each residue.
sliding windows of sizes ranging from  <dig> to  <dig> sequence neighbours were centred on each residue.
different combinations of feature matrices were tested and the best performing combination was retained.
artificial neural networks
three layered  fully connected neural networks trained by back propagation were simulated using the snns software package  <cit> .
the number of input nodes was equal to the number of training features and  <dig> output nodes represented all possible  <dig> rna dinucleotide contacts.
different network architectures were optimized for every feature matrix varying the number of nodes in the hidden layer.
optimum networks were chosen by a five-fold cross-validation scheme according to an early stopping criterion.
the data was divided into five sets of proteins and for each training cycle, three subsets were combined to form the training data.
out of the two subsets left out, one was used to determine the stopping point of training.
all the reported performance scores were computed on the third  sets.
shuffling the training and test data sets during five cycles of cross-validation ensured that each protein had been used for evaluating performance.
numerical values between  <dig> and  <dig> returned by the neural network were transformed into a binary state of binding or non-binding by varying cut-off values during receiver operating characteristic  analysis.
for the purpose of constructing a web server, a precision score  was computed for a prediction score at a given position used as a cut-off.
this score corresponds to the true positive probability of that contact class.
applicability to scanning interacting protein-rna fragments
from the protein-rna complexes in the prna <dig> dataset, pairs of protein and rna sequence fragments of fixed lengths were generated by using a sliding window on both.
subsequently, all combinations of protein-rna fragment pairs in a given complex were generated by matching each protein fragment to all rna fragments.
fragment pairs were assigned a binary class according to the contacting information from each complex structure .
a fragment pair was labelled as  <dig> if any of the atoms from the protein fragment was in contact with any of the atoms of the rna fragment at a threshold of  <dig> Å atom-atom distance; otherwise it was labeled as  <dig>  a second neural network model was built to identify the positive class  from the negative class .
the protein fragments were encoded in fragment feature vectors built by concatenation of the predicted  <dig> dinucleotide scores of each residue in a given fragment, while the rna sequence fragments were encoded using dinucleotide compositions.
the protein and rna feature vectors for each fragment pair in a given complex were concatenated forming a fragment-pair feature matrix per complex that was used to train a new neural network.
we used the same training algorithm described above but in this case the neural networks predict a one-dimensional binary vector encoding the “paired” or “non-paired” state of the protein-rna fragment pairs.
performance evaluation
neural networks are trained to return a vector of  <dig> dinucleotide-binding prediction scores for a protein residue between  <dig> and  <dig>  which are transformed to binary states of binding or non-binding by choosing a cut-off .
for each dinucletide type, the occurrence of a contact is considered positive  and negative  otherwise.
true  indicates that the states of predicted and observed contact are identical and false  otherwise.
the notation tp, tn, fp, fn combines these labels to return the number of data points  in that category.
these values correspond to a cut-off at which the neural network outputs are transformed into binary predictions.
the predicted binding scores are transformed into binary predictions by using different cut-offs yielding sensitivity and specificity over the entire score range.
roc graphs for "1-specificity"  values versus corresponding sensitivity  values are plotted.
this graph depicts the variations of the increment in false positive rate with an increase in the true positive rate.
throughout this work, the performance of the models was measured by the total auc for the roc.
RESULTS
dinucleotide contact statistics
a simple look at the number of contacts with rna revealed that on an average  <dig> % of the residues in the rna-binding proteins are in contact with a given dinucleotide in the complexes .
this result differs from our previous report on dna-binding proteins, which bind to dna with an average of 1% of the residues, reflecting a larger contact surface in protein-rna complexes.
in contrast to the protein-dna complexes, in which residues have remarkable preferences for particular dinucleotides such as ag/ct, ac/gt and at/at, the contacts in protein-rna complexes are more homogeneously distributed among all dinucleotides .
however, contacts with cg , ga , gg , cc  and ag  were slightly more abundant than dinucleotides ua , au  and uu .
this result illustrates the greater complexity of rna recognition in comparison to dna.
this is expected, because protein-rna interactions involve the matching of a variety of conformational arrangements rather than recognition of canonical helix configurations, as in the case of protein-dna complexes  <cit> .
the binding preferences of the  <dig> amino acids towards the  <dig> dinucleotides and their comparison with dna-binding proteins are shown in figure  <dig> .
similar to dna-binding proteins ), amino acids glu and asp are excluded from the interface as expected.
on the other hand positively charged residues i.e.
arg, lys and his are enriched for most dinucleotide contacts with few exceptions.
interestingly, phe and aromatic amino acids trp and tyr showed a significant enrichment for most dinucleotides.
with regard to the specificity, we observe clear preferences for several cases.
for example lys has high positive scores only for purine dinucleotides aa and ga and low or statistically insignificant preferences for other nucleotides.
on the other hand arg has high scores for most but not for gc and gg dinucleotides.
figure  <dig> reveals the similarity and differences between rbps and dbps.
as expected, most of the data are observed in the first and third quadrant, implying that the same residue-dinucleotide pairs are enriched in dbps and rbps.
however, there are some exceptions.
first, some pairs like arg-ag, arg-cg, and arg-ga are enriched in dbps but not in rbps.
on the other hand rbps employ a larger set of residues as many hydrophobic residues pair with dinucleotides  whereas their pairing with corresponding dna dinucleotides is much less significant.
thus, we conclude that a larger set of residues is employed for interactions in rbps compared to dbps and hydrophobic interactions are particularly important for conferring specificity in rbps.
this can be explained in view of the fact that nucleotide side chains  are more exposed in rbps due to single-stranded nature and hence more stacking interactions can occur than in dna, where most interaction must occur with the phosphate backbone and hence interactions are more electrostatic in nature.
the consistency of these preferences and the role of neighbours can also be revealed by estimating the prediction performance of models trained using this information.
prediction performance using sequence neighbours
sequence and evolutionary information was used to model the dinucleotide contacting states of all protein residues in the prna <dig> data.
neural networks were trained with different feature matrices combining 21-bit sparse-encoded binary vectors, pssm scores at differently sized neighbour windows and gac scores of the whole protein sequence.
neural networks yielded an optimum model with  <dig> hidden nodes trained with a feature matrix of  <dig> input vectors.
the combination of evolutionary information of the predicted residue and two neighbours with gac values of the whole sequence yielded the optimum feature matrix.
figure  <dig> depicts roc graphs of the “best” neural network with auc scores of ~67-79%.
the lowest accuracies <70% correspond to contacts with uu dinucleotides, whereas the contacts with aa, cu, ga and ug dinucleotides were predicted with the highest accuracies of about 80%.
notably, the optimum contribution of sequence neighbours to the dinucleotide-specific binding extends only up to  <dig> residues, representing a 5-residue fragment in the protein sequence.
no further improvement in performance could be obtained by increasing the window size beyond  <dig> residues, apparently because the distant neighbour information is too complex to be captured by the amount of data we have.
performance levels are generally lower than but remain comparable to the reported accuracies for general rna-binding site prediction from sequence, which are in the range of 80-85%  <cit> , highlighting the difficulties in the prediction of specific contacts in comparison to general rna-contact prediction.
yet, the results are encouraging as they are likely to improve in the future with more abundant data sets.
in particular, the proposed method is likely to enable us to identify binding sites more accurately when provided with known target rna-sequences.
ability of dinucleotide-contact prediction to fine-tune binding site prediction on rbps in reference to the dinucleotide sequence on the rna-target is demonstrated in figure  <dig>  using two publicly available web servers in  <cit> , we show that our proposed approach can enhance identification of interacting regions.
there are not many examples forming contacts with only one dinucleotide type, which makes the visual or statistical presentation of this result more difficult, but the illustrated example is quite informative.
the overall ability of the proposed model to identify specific contacts is obvious, as general binding site algorithms cannot distinguish between rna-targets at all and any progress in that direction is a clear advantage over the general approach.
what leads to the predictability of specific contacts from pssms?
pssms, as used in this work enumerate the residue substitution profiles during evolution at each alignment position for a given protein sequence.
the evolutionary patterns of amino acid substitutions at given positions of rbps represent constrains imposed by the requirement of specific interactions.
in our previous study on dinucleotide-specific dna binding-site prediction  <cit> , we also found that the amino acid substitution pattern of a residue and its neighbours  was well-defined during evolution and could be correlated to the ability of the residue to interact with particular dna dinucleotides.
our findings for protein-rna interactions suggest that, although more complex and varied than protein-dna interactions, the substitution patterns of the functional residues in rna-binding proteins are also significantly constrained during evolution.
predictability of specific contact across rna functional classes
besides playing a broad range of roles in the cell, rna molecules might also mediate unknown biological functions  <cit> .
two main rna recognition classes have been defined: groove binding, in which a protein secondary structure element is positioned into the groove of an rna helix; and beta-sheet binding, in which beta-sheet surfaces create pockets to bind unpaired rna bases  <cit> .
the diversity of rna-binding patterns has been previously discussed in the context of functional groups in which rna binds different protein secondary elements  <cit> .
however, it is not straightforward to separate groove-binding proteins from beta-sheet binding ones, as the two modes of binding often occur together in complexes.
it is much more convenient to classify rna-binding proteins in terms of the target rna function.
specifically, we evaluated the performance of the optimum neural network according to the functional class of the complexes.
we considered four functional classes of rna: viral rna, mrna , trna  and rrna  representing about  <dig> %,  <dig> %,  <dig> %,  <dig> % of all contacts in the dataset, respectively.
figure  <dig> depicts the prediction performance of our model for proteins binding to different rna classes.
we find that the optimum neural network performed quite homogeneously for all rna functional classes except the viral complexes  which resulted in low accuracies in the auc range of 62-77% in comparison to the accuracies for mrna, trna and rrna complexes, which range between 68-84%, 64-80% and 66-81%, respectively.
these results suggest that viral rna-protein interaction patterns are different from the rest of the complexes.
in fact, besides having the most polar and least well packed rna binding sites among all rna-binding proteins  <cit> , viral protein-rna complexes have been also reported to be the least sequence-specific  <cit> , which could explain their poor performance on specificity prediction.
in order to improve the model performance for the different rna functional classes, we implemented functional class-wise predictors of dinucleotide-specific rna binding sites in proteins.
in this case, neural networks were trained independently with complexes from a single functional class.
after trying all combinations of sequence and evolutionary features for each rna class, the prediction performance only partially improved for proteins binding to viral rna.
interestingly in this case, the optimum neural network was trained with evolutionary information of the interacting residue and gac of the whole protein sequence without considering any contribution from neighbouring residues.
despite the low accuracy  yielded for au dinucleotide , the auc values for the rest of the dinucleotides ranged from 63-88%.
it is noteworthy that cu, ga, and ug dinucleotides exhibited improved accuracies of about 85%, 81% and 88%.
the data shortage on viral protein-rna crystal structures is likely another cause of the underperformance observed for this rna functional class, which could be overcome when more crystal structures of viral rna complexes become available.
application to the prediction of binding protein-rna fragment pairs
a second neural network model was implemented to evaluate the ability of the dinucleotide specific rna-binding scores to discriminate between “binding” and “non-binding” protein-rna fragments in a given complex.
by shifting one residue at a time, protein and rna sequences were scanned to obtain all protein and rna fragments of a given length per complex.
all possible combinations of protein-rna fragment pairs were generated for a given complex.
fragment pairs were labeled as “binding” if the fragment pair contains binding sites and “non-binding” otherwise.
neural networks were trained with fragment pair features obtained by concatenation of the predicted  <dig> dinucleotide-binding scores of each residue in a protein fragment and the dinucleotide composition of the corresponding rna fragment of the pair.
figure  <dig> shows roc plots and auc values for the optimum models to predict protein and rna fragments binding at different lengths.
the accuracy to recognize binding fragment pairs varied with the fragment lengths.
interestingly, binding fragment pairs of five residues, which represent the same window size of the optimum dinucleotide specific rna-binding model, were recognized with the highest accuracy of about 70%.
according to the recognition accuracy of rna fragments binding to specific protein sequence fragments, our methodology seems very promising for the discovery of putative rna functional elements on a genomic scale.
src pred web server
a web server which takes fasta-formatted sequences as input and predicts 16-dimensional vectors representing all possible dinucleotides for each residue position has been implemented and made available at http://tardis.nibio.go.jp/netasa/srcpred.
one of the problems in working with this type of web servers is to interpret prediction scores.
in this regard, we developed a strategy by using the raw prediction score at each position as a cutoff and determined the corresponding precision in the benchmarking data sets.
precision scores at this cutoff represents the probability that the position being in the positive class i.e.
binding residue-dinucleotide pair.
the web server automatically returns these probability scores for all residue positions and provides a graphical prediction highlighted according to the range of these scores.
CONCLUSIONS
the paper shows that single amino-acid sequences and evolutionary profiles can predict rna dinucleotide-specific contacts with accuracy somewhat lower than the prediction of general rna-binding sites.
specific contacts in different rna functional classes can be successfully predicted from a single comprehensive model but viral rna complexes performance was slightly poorer.
the best prediction accuracies, measured by the area under the roc graphs, were ~80% for the general model.
in addition, we showed that the calculated residue-wise prediction scores, used in combination with dinucleotide compositions correctly identified about 70% of protein-rna fragment pairs at complex interfaces.
this study will provide us with a better understanding and more accurate predictions of the specific base-amino acid interactions in protein-rna complexes.
authors' contributions
sa conceived of and designed the study.
mf implemented it in consultation with ds, yk, as and km.
sa developed the web server.
manuscript was prepared by sa and mf on which as, km, dms, and yk gave useful suggestions and improved it.
all authors read and approved of the manuscript.
competing interests
the authors declare that they have no competing interests.
supplementary material
additional file 1
various rna-binding proteins.
zipped file, which contains lists of various rna-binding proteins in text format .
click here for file
additional file 2
expected and observed contacts and chi- squared statistics.
detailed values of expected and observed of contacts and chi- squared statistics .
click here for file
additional file 3
roc plots of prediction performance per each dinucleotide class.
roc plots of prediction performance per each dinucleotide class .
click here for file
acknowledgements
the work was partially supported by a fusion grant for interdisciplinary research by ifrec to yk, ds, sa and mf and by a grants-in-aid  award from the jsps, japan to sa.
this article has been published as part of bmc bioinformatics volume  <dig> supplement  <dig>  2011: tenth international conference on bioinformatics – first iscb asia joint conference  <dig> : bioinformatics.
the full contents of the supplement are available online at http://www.biomedcentral.com/1471-2105/12?issue=s <dig>

 protein-rna interactions are involved in various regulatory and constitutional cellular functions. role for rna in cellular defense and developmental regulation, which involves its interaction with proteins, has also been reported. most of these biological functions involve an accurate identification of specific recognition sites in proteins and rna. yet, protein-rna interactions are far less understood than protein–dna and protein-protein interactions, partly because fewer structures are available and also likely because these interactions are more complex than the others. in contrast to the intuitively similar protein-dna interactions, nucleic acid structures in protein-rna complexes are diverse, resulting in a wider range of mechanisms for protein-rna interactions and hence their prediction is more difficult. several computational approaches have been developed to identify rna-binding proteins and rna-binding sites. statistical potentials and docking scoring functions derived from databases of complex crystal structures effectively identified rna-binding sites in proteins. prediction of rna-protein interactions from sequences or structures using machine learning methods have also been successfully attempted. however, none of these methods addresses the crucial issue of specific interactions i.e. the same protein interacts with some rna sequences and not others. knowledge of exact interaction partners and the mechanism of recognition are essential for an understanding and ability to control rna-level regulatory processes. hence, an extension of machine learning methods to address this problem is of crucial significance. we recently addressed the issue of specific recognition of protein and nucleotide subsequences for protein-dna interactions by looking at the dinucleotide specific contact preferences of amino acids in proteins, using sequence and evolutionary contexts, and applied this information to predict specific contacts from sequence. as a natural extension of this approach to rna-binding proteins, and also because some rna-binding proteins are shown to bind regions largely characterized by enrichment in one dinucleotide, we explored the possibility of predicting amino acid dinucleotide contacts. we start with a statistical analysis of protein-rna contacts and identify patterns of contact preferences that contrast or resemble protein-dna contacts. the prediction model takes a matrix of sequence- and evolutionary profile-derived features and simulates the rna-interacting state of every amino acid residue in a given sequence. the resulting 16-dimensional multi-class output neural network was optimized by an early-stopping algorithm and five-fold-out cross-validation. results indicate that specific rna-binding contacts can be predicted with accuracy levels similar to those achieved in dna-binding proteins. we applied dinucleotide-specific contact predictions to identify full-length rna sequence targets of proteins, with promising success. in summary, the proposed method can be used in two ways: to improve the performance of rna-binding sites on proteins, as prediction scores will be modulated by the dinucleotide composition of target rna sequences and one can look for prediction scores that correspond to the dinucleotide enriched in a known target and predicted binding sites in proteins can be converted to a 16-dimensional dinucleotide score, which works like a pseudo dinucleotide composition itself and candidate target rna sequences can thereby be scored by comparing observed dinucleotide compositions in candidate target sequences and thereby use them to predict targets of rna-binding proteins. methods data set the dataset and annotations have been adopted from our previous work on predicting rna-binding proteins from their electric moments. the data preparation procedure is summarized here as follows. all protein-rna complexes in the protein data bank, which have an annotations in scor database were selected. we eliminated redundancy using blastclust by obtaining clusters at a 25% sequence identity and selecting the chain with the highest number of rna contacts from each of the clusters obtained at this threshold. a final list of protein chains and their structural classes, was used to generate and evaluate the models, and is provided as a supplementary table s. contact profiles the contact profiles for the protein sequences were computed from protein-rna complex structures in the compiled data set. we defined a contact when the distance between any atom in the protein and any atom of the rna dinucleotide is less than Å. the contact class of all dinucleotide sequence elements is written in alphabetically order viz. aa, ac, ag, au, ca, cc, cg, cu, ga, gc, gg, gu, ua, uc, ug and uu. contact statistics and random docking the statistical significance of contact preferences was evaluated using a chi-squared test with one degree of freedom. this requires a background contact frequency, which is computed using a random docking procedure, as has been previously used for dna-binding proteins. in this procedure, all observed contacts in each protein-rna complex were divided into unique amino acid-dinucleotide pairs in accordance with the products of accessible surface area of the residue and the dinucleotide in question and the expected number of contacts is given by: where i, and j refer to unique residues and dinucleotides and asa refers to the absolute accessible surface area, computed by the naccess program. coordinates for each protein chain were isolated from the complex structure before computing the asas of amino acid residues. rna-chains were isolated similarly for dinucleotide asas. asa refers to the total accessible surface area of all residues of a giventype in a given data set and n is the total number of observed contacts of all residue-dinucleotide pairs. both observed and expected numbers of contacts were computed for each complex and data were pooled to get the overall chi-squared values for each dinucleotide-amino acid pair as follows: where i and j have the same meaning as in equation i.e. they take values from to and to respectively. eij is computed as in and oij is the corresponding number of contacts in all complexes is for one complex but refers to all complexes taken together). chi-squared values from observed and expected number of contacts are converted to p-values using standard look-up tables. chi-squared values computed above denote statistical significance of both positive and negative deviations from expected numbers of counts. to indicate the exclusion or enrichment of a residue-dinucleotide pair in the interface, signed chi-squared values were obtained by multiplying these values by - if the observed number of contacts was less than the expected counts. sequence features two types of encoding schemes of single protein sequences are widely prevalent and have been adopted for this work. a first scheme represented an amino acid residue and its neighbours by 21-bit-sparse-encoded binary vectors i.e. by taking all the components to be zero except for the one identifying a given residue, which is set as the first components resemble the amino acid type and the last one is labelling terminal positions, without neighbours. a second scheme represented each residue by its evolutionary profile. as previously described by us and others, the evolutionary profile of a residue, represented as position-specific scoring matrices, was computed by using the psi-blast program and against ncbi's nr database for each protein sequence. pssms were generated by three iterations of psi-blast with default parameters of blastpgp. prior to neural network training, a vector representing global amino acid composition of each protein sequence was concatenated to the feature vector of each residue. sliding windows of sizes ranging from to sequence neighbours were centred on each residue. different combinations of feature matrices were tested and the best performing combination was retained. artificial neural networks three layered fully connected neural networks trained by back propagation were simulated using the snns software package. the number of input nodes was equal to the number of training features and output nodes represented all possible rna dinucleotide contacts. different network architectures were optimized for every feature matrix varying the number of nodes in the hidden layer. optimum networks were chosen by a five-fold cross-validation scheme according to an early stopping criterion. the data was divided into five sets of proteins and for each training cycle, three subsets were combined to form the training data. out of the two subsets left out, one was used to determine the stopping point of training. all the reported performance scores were computed on the third sets. shuffling the training and test data sets during five cycles of cross-validation ensured that each protein had been used for evaluating performance. numerical values between and returned by the neural network were transformed into a binary state of binding or non-binding by varying cut-off values during receiver operating characteristic analysis. for the purpose of constructing a web server, a precision score was computed for a prediction score at a given position used as a cut-off. this score corresponds to the true positive probability of that contact class. applicability to scanning interacting protein-rna fragments from the protein-rna complexes in the prna dataset, pairs of protein and rna sequence fragments of fixed lengths were generated by using a sliding window on both. subsequently, all combinations of protein-rna fragment pairs in a given complex were generated by matching each protein fragment to all rna fragments. fragment pairs were assigned a binary class according to the contacting information from each complex structure. a fragment pair was labelled as if any of the atoms from the protein fragment was in contact with any of the atoms of the rna fragment at a threshold of Å atom-atom distance; otherwise it was labeled as a second neural network model was built to identify the positive class from the negative class. the protein fragments were encoded in fragment feature vectors built by concatenation of the predicted dinucleotide scores of each residue in a given fragment, while the rna sequence fragments were encoded using dinucleotide compositions. the protein and rna feature vectors for each fragment pair in a given complex were concatenated forming a fragment-pair feature matrix per complex that was used to train a new neural network. we used the same training algorithm described above but in this case the neural networks predict a one-dimensional binary vector encoding the “paired” or “non-paired” state of the protein-rna fragment pairs. performance evaluation neural networks are trained to return a vector of dinucleotide-binding prediction scores for a protein residue between and which are transformed to binary states of binding or non-binding by choosing a cut-off. for each dinucletide type, the occurrence of a contact is considered positive and negative otherwise. true indicates that the states of predicted and observed contact are identical and false otherwise. the notation tp, tn, fp, fn combines these labels to return the number of data points in that category. these values correspond to a cut-off at which the neural network outputs are transformed into binary predictions. the predicted binding scores are transformed into binary predictions by using different cut-offs yielding sensitivity and specificity over the entire score range. roc graphs for "1-specificity" values versus corresponding sensitivity values are plotted. this graph depicts the variations of the increment in false positive rate with an increase in the true positive rate. throughout this work, the performance of the models was measured by the total auc for the roc.  dinucleotide contact statistics a simple look at the number of contacts with rna revealed that on an average % of the residues in the rna-binding proteins are in contact with a given dinucleotide in the complexes. this result differs from our previous report on dna-binding proteins, which bind to dna with an average of 1% of the residues, reflecting a larger contact surface in protein-rna complexes. in contrast to the protein-dna complexes, in which residues have remarkable preferences for particular dinucleotides such as ag/ct, ac/gt and at/at, the contacts in protein-rna complexes are more homogeneously distributed among all dinucleotides. however, contacts with cg, ga, gg, cc and ag were slightly more abundant than dinucleotides ua, au and uu. this result illustrates the greater complexity of rna recognition in comparison to dna. this is expected, because protein-rna interactions involve the matching of a variety of conformational arrangements rather than recognition of canonical helix configurations, as in the case of protein-dna complexes. the binding preferences of the amino acids towards the dinucleotides and their comparison with dna-binding proteins are shown in figure. similar to dna-binding proteins ), amino acids glu and asp are excluded from the interface as expected. on the other hand positively charged residues i.e. arg, lys and his are enriched for most dinucleotide contacts with few exceptions. interestingly, phe and aromatic amino acids trp and tyr showed a significant enrichment for most dinucleotides. with regard to the specificity, we observe clear preferences for several cases. for example lys has high positive scores only for purine dinucleotides aa and ga and low or statistically insignificant preferences for other nucleotides. on the other hand arg has high scores for most but not for gc and gg dinucleotides. figure reveals the similarity and differences between rbps and dbps. as expected, most of the data are observed in the first and third quadrant, implying that the same residue-dinucleotide pairs are enriched in dbps and rbps. however, there are some exceptions. first, some pairs like arg-ag, arg-cg, and arg-ga are enriched in dbps but not in rbps. on the other hand rbps employ a larger set of residues as many hydrophobic residues pair with dinucleotides whereas their pairing with corresponding dna dinucleotides is much less significant. thus, we conclude that a larger set of residues is employed for interactions in rbps compared to dbps and hydrophobic interactions are particularly important for conferring specificity in rbps. this can be explained in view of the fact that nucleotide side chains are more exposed in rbps due to single-stranded nature and hence more stacking interactions can occur than in dna, where most interaction must occur with the phosphate backbone and hence interactions are more electrostatic in nature. the consistency of these preferences and the role of neighbours can also be revealed by estimating the prediction performance of models trained using this information. prediction performance using sequence neighbours sequence and evolutionary information was used to model the dinucleotide contacting states of all protein residues in the prna data. neural networks were trained with different feature matrices combining 21-bit sparse-encoded binary vectors, pssm scores at differently sized neighbour windows and gac scores of the whole protein sequence. neural networks yielded an optimum model with hidden nodes trained with a feature matrix of input vectors. the combination of evolutionary information of the predicted residue and two neighbours with gac values of the whole sequence yielded the optimum feature matrix. figure depicts roc graphs of the “best” neural network with auc scores of ~67-79%. the lowest accuracies <70% correspond to contacts with uu dinucleotides, whereas the contacts with aa, cu, ga and ug dinucleotides were predicted with the highest accuracies of about 80%. notably, the optimum contribution of sequence neighbours to the dinucleotide-specific binding extends only up to residues, representing a 5-residue fragment in the protein sequence. no further improvement in performance could be obtained by increasing the window size beyond residues, apparently because the distant neighbour information is too complex to be captured by the amount of data we have. performance levels are generally lower than but remain comparable to the reported accuracies for general rna-binding site prediction from sequence, which are in the range of 80-85%, highlighting the difficulties in the prediction of specific contacts in comparison to general rna-contact prediction. yet, the results are encouraging as they are likely to improve in the future with more abundant data sets. in particular, the proposed method is likely to enable us to identify binding sites more accurately when provided with known target rna-sequences. ability of dinucleotide-contact prediction to fine-tune binding site prediction on rbps in reference to the dinucleotide sequence on the rna-target is demonstrated in figure using two publicly available web servers in, we show that our proposed approach can enhance identification of interacting regions. there are not many examples forming contacts with only one dinucleotide type, which makes the visual or statistical presentation of this result more difficult, but the illustrated example is quite informative. the overall ability of the proposed model to identify specific contacts is obvious, as general binding site algorithms cannot distinguish between rna-targets at all and any progress in that direction is a clear advantage over the general approach. what leads to the predictability of specific contacts from pssms? pssms, as used in this work enumerate the residue substitution profiles during evolution at each alignment position for a given protein sequence. the evolutionary patterns of amino acid substitutions at given positions of rbps represent constrains imposed by the requirement of specific interactions. in our previous study on dinucleotide-specific dna binding-site prediction, we also found that the amino acid substitution pattern of a residue and its neighbours was well-defined during evolution and could be correlated to the ability of the residue to interact with particular dna dinucleotides. our findings for protein-rna interactions suggest that, although more complex and varied than protein-dna interactions, the substitution patterns of the functional residues in rna-binding proteins are also significantly constrained during evolution. predictability of specific contact across rna functional classes besides playing a broad range of roles in the cell, rna molecules might also mediate unknown biological functions. two main rna recognition classes have been defined: groove binding, in which a protein secondary structure element is positioned into the groove of an rna helix; and beta-sheet binding, in which beta-sheet surfaces create pockets to bind unpaired rna bases. the diversity of rna-binding patterns has been previously discussed in the context of functional groups in which rna binds different protein secondary elements. however, it is not straightforward to separate groove-binding proteins from beta-sheet binding ones, as the two modes of binding often occur together in complexes. it is much more convenient to classify rna-binding proteins in terms of the target rna function. specifically, we evaluated the performance of the optimum neural network according to the functional class of the complexes. we considered four functional classes of rna: viral rna, mrna, trna and rrna representing about %, %, %, % of all contacts in the dataset, respectively. figure depicts the prediction performance of our model for proteins binding to different rna classes. we find that the optimum neural network performed quite homogeneously for all rna functional classes except the viral complexes which resulted in low accuracies in the auc range of 62-77% in comparison to the accuracies for mrna, trna and rrna complexes, which range between 68-84%, 64-80% and 66-81%, respectively. these results suggest that viral rna-protein interaction patterns are different from the rest of the complexes. in fact, besides having the most polar and least well packed rna binding sites among all rna-binding proteins, viral protein-rna complexes have been also reported to be the least sequence-specific, which could explain their poor performance on specificity prediction. in order to improve the model performance for the different rna functional classes, we implemented functional class-wise predictors of dinucleotide-specific rna binding sites in proteins. in this case, neural networks were trained independently with complexes from a single functional class. after trying all combinations of sequence and evolutionary features for each rna class, the prediction performance only partially improved for proteins binding to viral rna. interestingly in this case, the optimum neural network was trained with evolutionary information of the interacting residue and gac of the whole protein sequence without considering any contribution from neighbouring residues. despite the low accuracy yielded for au dinucleotide, the auc values for the rest of the dinucleotides ranged from 63-88%. it is noteworthy that cu, ga, and ug dinucleotides exhibited improved accuracies of about 85%, 81% and 88%. the data shortage on viral protein-rna crystal structures is likely another cause of the underperformance observed for this rna functional class, which could be overcome when more crystal structures of viral rna complexes become available. application to the prediction of binding protein-rna fragment pairs a second neural network model was implemented to evaluate the ability of the dinucleotide specific rna-binding scores to discriminate between “binding” and “non-binding” protein-rna fragments in a given complex. by shifting one residue at a time, protein and rna sequences were scanned to obtain all protein and rna fragments of a given length per complex. all possible combinations of protein-rna fragment pairs were generated for a given complex. fragment pairs were labeled as “binding” if the fragment pair contains binding sites and “non-binding” otherwise. neural networks were trained with fragment pair features obtained by concatenation of the predicted dinucleotide-binding scores of each residue in a protein fragment and the dinucleotide composition of the corresponding rna fragment of the pair. figure shows roc plots and auc values for the optimum models to predict protein and rna fragments binding at different lengths. the accuracy to recognize binding fragment pairs varied with the fragment lengths. interestingly, binding fragment pairs of five residues, which represent the same window size of the optimum dinucleotide specific rna-binding model, were recognized with the highest accuracy of about 70%. according to the recognition accuracy of rna fragments binding to specific protein sequence fragments, our methodology seems very promising for the discovery of putative rna functional elements on a genomic scale. src pred web server a web server which takes fasta-formatted sequences as input and predicts 16-dimensional vectors representing all possible dinucleotides for each residue position has been implemented and made available at http://tardis.nibio.go.jp/netasa/srcpred. one of the problems in working with this type of web servers is to interpret prediction scores. in this regard, we developed a strategy by using the raw prediction score at each position as a cutoff and determined the corresponding precision in the benchmarking data sets. precision scores at this cutoff represents the probability that the position being in the positive class i.e. binding residue-dinucleotide pair. the web server automatically returns these probability scores for all residue positions and provides a graphical prediction highlighted according to the range of these scores.  the paper shows that single amino-acid sequences and evolutionary profiles can predict rna dinucleotide-specific contacts with accuracy somewhat lower than the prediction of general rna-binding sites. specific contacts in different rna functional classes can be successfully predicted from a single comprehensive model but viral rna complexes performance was slightly poorer. the best prediction accuracies, measured by the area under the roc graphs, were ~80% for the general model. in addition, we showed that the calculated residue-wise prediction scores, used in combination with dinucleotide compositions correctly identified about 70% of protein-rna fragment pairs at complex interfaces. this study will provide us with a better understanding and more accurate predictions of the specific base-amino acid interactions in protein-rna complexes. authors' contributions sa conceived of and designed the study. mf implemented it in consultation with ds, yk, as and km. sa developed the web server. manuscript was prepared by sa and mf on which as, km, dms, and yk gave useful suggestions and improved it. all authors read and approved of the manuscript. competing interests the authors declare that they have no competing interests. supplementary material additional file 1 various rna-binding proteins. zipped file, which contains lists of various rna-binding proteins in text format. click here for file additional file 2 expected and observed contacts and chi- squared statistics. detailed values of expected and observed of contacts and chi- squared statistics. click here for file additional file 3 roc plots of prediction performance per each dinucleotide class. roc plots of prediction performance per each dinucleotide class. click here for file acknowledgements the work was partially supported by a fusion grant for interdisciplinary research by ifrec to yk, ds, sa and mf and by a grants-in-aid award from the jsps, japan to sa. this article has been published as part of bmc bioinformatics volume supplement 2011: tenth international conference on bioinformatics – first iscb asia joint conference: bioinformatics. the full contents of the supplement are available online at http://www.biomedcentral.com/1471-2105/12?issue=s 
 november- december asia pacific bioinformatics network tenth international conference on bioinformatics – first iscb asia joint conference kuala lumpur, malaysia using a standard approach to represent protein subsequences by their evolutionary profile, we trained neural networks to predict multiclass target vectors corresponding to possible contacting dinucleotide subsequences. we analyzed basic statistics of amino acid-dinucleotide contacts in protein-rna complexes and found their pairing preferences could be identified. a web server predicting the 16-dimensional contact probability matrix directly from a user-defined protein sequence was implemented and made available at: http://tardis.nibio.go.jp/netasa/srcpred. dinucleotide-specific contact predictions have also been extended to the prediction of interacting protein and rna fragment pairs, which shows the applicability of this method to predict targets of rna-binding proteins. interaction preferences of protein subsequences and dinucleotides can be inferred from protein-rna complex structures, enabling a training-based prediction approach.
 regulation of gene expression, protein synthesis, replication and assembly of many viruses involve rna–protein interactions. although some successful computational tools have been reported to recognize rna binding sites in proteins, the problem of specificity remains poorly investigated. after the nucleotide base composition, the dinucleotide is the smallest unit of rna sequence information and many rna-binding proteins simply bind to regions enriched in one dinucleotide. interaction preferences of protein subsequences and dinucleotides can be inferred from protein-rna complex structures, enabling a training-based prediction approach.  we analyzed basic statistics of amino acid-dinucleotide contacts in protein-rna complexes and found their pairing preferences could be identified. using a standard approach to represent protein subsequences by their evolutionary profile, we trained neural networks to predict multiclass target vectors corresponding to possible contacting dinucleotide subsequences. in the cross-validation experiments, the accuracies of the optimum network, measured as areas under the curve of the receiver operating characteristic graphs, were in the range of 65-80%.  dinucleotide-specific contact predictions have also been extended to the prediction of interacting protein and rna fragment pairs, which shows the applicability of this method to predict targets of rna-binding proteins. a web server predicting the 16-dimensional contact probability matrix directly from a user-defined protein sequence was implemented and made available at: http://tardis.nibio.go.jp/netasa/srcpred. november- december asia pacific bioinformatics network tenth international conference on bioinformatics – first iscb asia joint conference kuala lumpur, malaysia 