Skip to main content

A machine learning strategy to identify candidate binding sites in human protein-coding sequence



The splicing of RNA transcripts is thought to be partly promoted and regulated by sequences embedded within exons. Known sequences include binding sites for SR proteins, which are thought to mediate interactions between splicing factors bound to the 5' and 3' splice sites. It would be useful to identify further candidate sequences, however identifying them computationally is hard since exon sequences are also constrained by their functional role in coding for proteins.


This strategy identified a collection of motifs including several previously reported splice enhancer elements. Although only trained on coding exons, the model discriminates both coding and non-coding exons from intragenic sequence.


We have trained a computational model able to detect signals in coding exons which seem to be orthogonal to the sequences' primary function of coding for proteins. We believe that many of the motifs detected here represent binding sites for both previously unrecognized proteins which influence RNA splicing as well as other regulatory elements.


In eukaryotes, the majority of transcripts are processed by splicing to remove intron sequences and form a mature messenger RNA. There are well established conserved sequence motifs at the intron/exon and exon/intron boundaries that are known to be recognised by the splicing machinery. However, even for short intron sequences, it has been concluded that these signals do not contain sufficient information to accurately define splice sites [1] and that other splicing factors, with associated binding sites, must be involved.

There is evidence that splicing is partly promoted and regulated by sequences embedded within exons. A number of sequences have been found embedded in the exons of both viral and cellular genes which can promote or repress the utilization of alternative splice sites. These are usually purine-rich sequence located near an alternative splice donor, that bind splicing factors such as members of the SR family. SR proteins are highly conserved serine/arginine-rich RNA-binding proteins (For review, see [2]). They are essential splicing factors and have been shown to regulate the selection and use of alternative splice sites [310]. It is known that they function very early in the spliceosome assembly process, promoting the binding of U1 snRNP to the splice donor and of U2AF to the splice acceptor, apparently by interacting with U1 70 K and U2AF respectively. Observations have shown that SR proteins bound to exons recruit splicing factors to the adjacent splice sites. Nine human SR proteins are currently known: SF2/ASF [2, 4, 6, 7], SC35 [4, 68, 11, 12], SRp20 [6, 8], SRp40 [4], SRp55 [4], SRp75 [2], SRp30c [2], 9G8 [6, 9, 11] and the divergent SRp54 [2]. These proteins are closely related in sequence and structure and share the ability to activate splicing. Human SR related proteins of the Tra2 family are similarly known to be splicing regulators and sequence specific activators of pre-mRNA splicing [8].

Early research concentrated on how SR proteins function to regulate alternative splicing. However, the binding of SR proteins to constitutive exons, which are included in all splice variants of a gene, is also thought to play an important role in splicing. The exon definition model proposes that interactions between components bound to splice sites flanking an exon serve to highlight usually small exons against a background of much larger introns. It is conjectured that the majority of constitutively spliced exons are defined by this mechanism. To support the model, a number of SR protein binding sites have been identified in constitutive exons, and shown to function as constitutive splicing enhancers [6, 13].

Although these binding sites are believed to be common, studying their sequences is difficult because they are embedded in exons, most of which are also functional protein-coding sequences. When a particular motif is found to be over- or under-represented in coding exons, it is generally unclear whether it is a consequence of the underlying protein sequence, or an unrelated signal, such as a splice enhancer, embedded in the protein coding sequence. Here we describe a novel strategy for resolving this uncertainty. Starting with annotated coding exons, we generate a 'neutralized' exon set: sequences which are generated randomly, but which nevertheless preserve both the amino acid sequence and overall composition features of the original exons. We then apply machine learning software to compare the original and neutralized exons. Since the neutralized set codes for the same proteins, it is likely that any feature which can be used to discriminate between the original and neutralized sets is performing some function which is independent of the exons' primary, protein-coding, function.

Results and discussion

Neutralized exons

9091 internal coding exons with lengths ranging from 100 to 300 bases were extracted from the Vega database of annotated human genomic sequence [14]. Testing the neutralization process (see methods section) on a typical 300 base exon (figure 1) we see that the sequence identity between the original and neutralised sequence falls steadily for approximately 500 cycles, then stabilizes and only fluctuates slightly for the remainder of the cycles. Allowing some margin for exceptional sequences, this suggests that that 1000 cycles of neutralization is adequate to randomize any sequence with a length up to 300 bases. Running the neutralization algorithm on the complete set of exons, for 1000 cycles per exon, gave a neutralized set with an average of 78% sequence identity compared to the reference set. The average dinucleotide compositions of the exons before and after neutralization is shown in table 1. We can see that most dinucleotides show negligible change in composition during the neutralization procedure, and in the most extreme case (the tt dinucleotide), the proportion of the sequences composed of tt dinucleotides changes by less that 2%. Therefore, the neutralization algorithm seems able to preserve overall sequence composition while substantially changing the sequence itself.

Figure 1
figure 1

A plot of the time-course vs percentage of sequence identity for neutralizing a typical 300 base sequence. A plot of the time-course vs percentage of sequence identity for neutralizing a typical 300 base sequence. The level of sequence identity falls in a steady rate for about 500 cycles and then comes to a minimum at about 1000 cycles. From 1000 cycles onwards, there are only slight fluctuations which implies that 1000 cycles of neutralization is the optimum value to randomize any sequence with a length up to 300 bases.

Table 1 Comparison of dinulceotide frequencies in original and neutralized exons

Motif-based models can effectively distinguish between original and neutralized exons

From both the original and neutralized sets, we removed 300 randomly selected sequences for use as test data. The remainder were used to train a Convolved Eponine Windowed Sequence (C-EWS) model (see methods section and [15]). These models are based on scaffolds of one of more sequence motifs (in this case, limited to a maximum of three per scaffold). The motifs are represented as DNA weight matrices [16]. When a scaffold includes more than one motif, probability distributions associated with each motif indicate the preferred relative positions of those motifs. Each scaffold has an associated weight, which is used to combine scaffold scores in a relevance vector machine.

Training resulted in a complex model consisting of 216 scaffolds, split evenly between positively-weighted scaffolds – signals which are likely to be over-represented in the original exons – and negatively weighted scaffolds. The complete set of scaffolds can be seen in figures 2 and 3.

Figure 2
figure 2

Positively weighted scaffolds in the Eponine-Exons model. Positively weighted scaffolds in the Eponine-Exons model. Motifs that together form a scaffold are linked by lines. Scaffolds are generally composed of 1, 2 or 3 motifs. The black filled areas show the relative position distributions (histograms) of the motifs within a scaffold, while the sequences represent the most likely base at each position in the weight matrix of the motif.

Figure 3
figure 3

Negatively weighted scaffolds in the Eponine-Exons model. Negatively weighted scaffolds in the Eponine-Exons model. The interpretation of the whole figure is similar to figure.

We tested the resulting model's classification ability using the unseen test data. Specificity (proportion of predictions that are correct) and sensitivity (proportion of original exons detected) are shown for a range of classifier score thresholds in figure 4. From the sensitivity-specificity curve, we see that the Eponine-Exons model is effective in distinguishing between original and neutralized exons.

Figure 4
figure 4

Specificity vs sensitivity plot for the Eponine-Exons model. A plot of specificity vs. sensitivity showing the ability of the eponine model to discriminate between unseen original and neutralized exons. Plots are shown for the whole test set and two sets split between low and high GC content.

Since the human genome is a mosaic of isochores of high and low GC content and neutralization generates sequences with average properties, it was possible that the classifier's performance was an artifact resulting from differences in GC distribution between original and neutralized sequences. To check this was not the case, the original set of sequences was split into subsets of high and low GC content. For each subset an associated neutralized set was generated, based on the average properties of that subset. Separate models were then trained and tested (see figure 4). We find that for both high and low GC subsets the classifier is still able to distinguish original and neutralized sequences.

The Eponine Exons model can also distinguish non-coding exons from randomized sequences

Since the negative training set is not composed of natural sequences, an obvious concern is that the features we have detected are artifacts of the neutralization procedure, and are of no use when analysing real sequence data. To validate the Eponine-Exons model, we tested it on additional sequences from four classes: protein coding exons not in the original training set, non-coding (UTR) exons, introns, and intergenic regions, all from annotation of finished human chromosomes obtained from chromosomes 9 and 10 in the Vega database [14]. For exons, introns and intergenic regions, we extracted sets of 1000 sequences, each of 200 bases long (one set each for exons and introns, four independent sets for intergenic regions). We were unable to obtain sufficient 200 base non-coding exonic sequences, so instead we used 100 base sequences.

For each data set, we produced a corresponding set of negative sequences with matching mono- and di-nucleotide composition using the randomizing procedure detailed in the methods section. We then used the Eponine-Exons model as a classifier, and tested its ability to separate each of the positive sequence sets from its corresponding negative sequence set. Sensitivity-specificity curves are shown in figure 5.

Figure 5
figure 5

Sensitivity-specificity curves for Eponine-Exons model on independent sets of sequences. Specificity vs. sensitivity for the Eponine-Exons model on independent sets of intergenic, intron, and UTR exon sequences compared with random sequences of matching mono- and di-nucleotide composition. All curves are based on sets of 1000 sequences. In the case of intergenic sequences, standard-deviation error bars were calculated based on results from four independent sets of sequences.

In the case of the intergenic sequences, there is no significant discrimination between real and shuffled sequences. The coding sequences, however, could be discriminated, as might be expected from a classifier trained on protein-coding sequences. Moreover, the model was also able to distinguish many non-coding exons from their shuffled counterparts. This result is highly significant because it indicates that at least some of the signals discovered in coding exons are general to both coding and non-coding exons. This is consistent with the idea that they are involved in exon definition and splicing. Finally, there is a far weaker, but still possibility significant, discrimination between real and shuffled intron sequences. One explanation for this is that the introns were contaminated with a small number of exons which were missed during the annotation process. However, a second possibility is that, in addition to an exon-specific signal, the Eponine Exons model is also detecting some (weak) signal – perhaps an anti-termination signal – which is found throughout transcribed regions of the genome. We note that the discrimination between exons and shuffled sequences is not as effective as discrimination between exons and neutralized sequences, which implies that some degree of overfitting may have occurred in the training process. Nevertheless these results suggest that a significant amount of relevant information has been captured.

Based on these results, we hoped that the model would be able to successfully discriminate between exons and other biologically authentic sequences. However, in initial tests exons did not generally score higher than intronic or intergenic sequences (data not shown). When we inspected the sequences, we found that the exons had a significantly different composition from other sequences: in particular, they tended to have a higher GC content. We suspected that the classifier output was somewhat sensitive to the GC content of the input sequence. When we compensated for this effect by randomly sampling a subset of intronic sequences with GC contents matching that found in the exonic test sequences (both coding and non-coding), the eponine-exons model was able to discriminate between the sets (see figure 6).

Figure 6
figure 6

Sensitivity-specificity curves for Eponine-Exons model to distinguish non-coding exonic sequences and intronic sequences. Specificity vs. sensitivity for the Eponine-Exons model to distinguish exonic sequences (both coding and non-coding) and intronic sequences with matching GC content.

Comparing introns with similar GC content to the exons, the discrimination between non-coding exons and introns is relatively poor – although still substantially better than random. This points to a limitation in the training approach of exons vs neutralized exons: splicing signals in a background of non-coding exonic sequence are not captured well by our classifier. In addition, [17] conclude the most exons require sequences in the flanks for efficient splicing, and these will clearly not be learned by our method, which focusses on the body of the exon.

The neutralization process we use has some similarities to the dicodon shuffling algorithm proposed by [18], which swaps pairs of synonymous codons under a constraint that the dinucleotide composition of the sequence must be preserved. We implemented this algorithm to compare its performance and properties with our own neutralization strategy. On the same sequences, the dicodon shuffling algorithm gives a set of sequences with an average sequence identity of 90% to the reference set. This is much higher than the 78% sequence identity observed after applying our neutralization procedure. This is unsurprising because the constraints under dicodon shuffling are stronger, requiring the dinucleotide composition to be maintained on a per-sequence basis, whereas neutralization only requires this across the complete set of sequences. To test whether this makes a significant difference when searching for functional motifs, we carried out identical training using C-EWS and obtained a model of similar complexity. However we found it had a much lower classification ability using unseen test data (c.f. figure 4) and was unable to distinguish between shuffled and reference sequences better than random for either coding, non-coding or intronic sequence (c.f. figure 5, data not shown). We conclude that our approach of neutralization destroys information more readily than dicodon shuffling and that this is necessary to reveal a strong enough signal for motifs to be recognised.

Comparison of learned motifs with known splice-enhancer sites

If the motifs learned in the Eponine Exons model are meaningful, a subset of them might be expected to match the set of motifs that have already been show to influence splicing. We therefore compared the weight matrices in the positively weighted scaffolds of our exon model with known splice enhancer sites [212].

Direct comparisons of weight matrices with sequence motifs – with or without ambiguity symbols – is complicated, since different positions in a weight matrix may convey different amounts of information. Furthermore, it is not certain that either the learned weight matrices or the published motifs correspond to the full length of the biologically functional sequence. It is therefore important to consider a range of possible alignments of motifs to weight matrices.

We extracted all weight matrices from the Eponine Exons model which were associated with a positive scaffold and which were at least four bases long. For each known motif, we calculated the log-odds score against all weight matrices from scaffolds with weights greater than 1.0, considering all possible alignments with up to one base of overlap, and took the maximum score. We summed the maxima to give an aggregate score for the degree of match between that motif and the full Eponine model.

We then constructed 1000 random weight matrix sets, each with matched information profiles to the Eponine Exons matrix set. Again, we calculated the aggregate score for each known motif. Finally, we counted the fraction of random matrix sets which scored higher than the Eponine Exons matrices. This can be considered as an empirical p-value, with low values providing strong support for the hypothesis that there is some correspondance between motifs in the Eponine Exons model and the known motif being tested. Presumably, in each case there is some subset of Eponine Exons motifs which actually correspond with the known motifs, but identifying these in a statistically rigorous manner is harder: since the Eponine Exons model is relatively large, a corresponding multiple testing correction would be needed. We therefore limit ourselves to considering aggregate scores here, even though we believe it to be a rather conservative strategy.

Tables 2 and 3 list the p-values for known motifs from exons and introns respectively. We see significant associations for 4/12 exonic motifs and 2/9 intronic motifs. Interestingly, one of the two matched intronic motifs is a substring of the other, and they are believed to be binding sites for the same protein – Tra2beta – so arguably they should be merged, in which case 1/8 intronic motifs are matched. Such a preference for exonic over intronic motifs may not be surprising, since the model was training only on exonic sequences. Several other computational methods for finding splice enhancer signals have been proposed [1922]. One method, RESCUE-ESE [19] compares the sequences around weak consensus splice sites with those around strong consensus sites, with the expectation that splice enhancer motifs are more likely to be found in the vicinity of weak splice sites. This strategy relies information orthogonal to that used by our method, thus it is interesting to compare the results. We compared the RESCUE-ESE derived motifs with the eponine model using the same approach as used for the experimentally determined motifs (see above). The results in table 4 shown that our model finds one of the motifs detected by the RESCUE-ESE method. We are not surprised that our method did not find all the RESCUE-ESE motifs since RESCUE-ESE is designed to detect both exon and intron localized motifs.

Table 2 Comparison of known ESE motifs which are located inside the internal exons.
Table 3 Comparison of known ESE motifs which are located at the splice acceptor site of the exon-intron boundaries
Table 4 Comparison of known ESE motifs with RESCUE-ESE method

Finally, we performed an analogous experiment to discover what proportion of our discovered motifs matched previously known motifs. In this case, 41% of motifs from the Eponine-Exons model had a good match to at least one motif from the exonic splice enhancer and RESCUE-ESE sets described above (log-odds score at least 0.2 above the expected score based on a set of 1000 shuffled motifs), suggesting that around 59% of discovered motifs may be novel.


We have shown that a motif-based machine learning strategy can extract signals which discriminate effectively between original and neutralized sets of protein-coding exons. The resulting model included recognizable consensus sequences for many of the previously reported splice-enhancer binding sites.

Although the model was trained only on coding exon sequences, it gives high scores for both coding and non-coding exons, but not introns or intergenic regions. We therefore believe that the neutralization strategy is a powerful and effective method for learning functional non-coding elements embedded in protein coding sequence.

One interesting feature of the model learned here is its complexity: 216 scaffolds, split evenly between positively and negatively-weighted scaffolds. This is a large number, both in absolute terms, and also in comparison with EWS and C-EWS models trained for other purposes, such as promoter prediction [23]. This suggests that a large number of functional elements could play widespread roles in exon definition. The motifs learned here which cannot be assigned to any currently known splice-regulating protein are strong candidates for investigation with a view to discovering novel splice regulators.

We hope that changes in the machine learning strategy will improve the classification accuracy of this method. Possible candidates for investigation include the use of scaffolds comprising more than 3 motifs, and the replacement of simple weight matrices with more complex models which serve as better representations of protein binding sites. We do not, however, necessarily expect that it will be possible to classify original and neutralized exons with 100% accuracy: most proteins can accept many mutations with little or no change to structure and function, so it is inevitable that some of the information which the cell uses to define exons will be encoded in the choice of amino acids, rather that just the choice of nucleotides used in redundant positions.

In the future, we hope to apply the results of this technique to the problem of ab initio prediction of genes. Current gene-prediction techniques rely on a combination of splice-site models and 'coding bias' – the observation that coding sequence looks very different from intronic and intergenic sequence when considering properties such as hexamer frequencies. While such methods work reasonably well for protein-coding genes, they seldom make good predictions of untranslated regions, and do not detect the non-coding RNA genes which are now known to be important in many aspects of cellular function. Scanning bulk genomic DNA using our model makes many predictions outside known exons (i.e. a high apparent false positive rate). This suggests that while the motifs discovered here may be necessary for efficient splicing, they are not sufficient to fully define exons. We hope that building knowledge of candidate binding sites into gene prediction methods, together with other features such as splice junction consensus sequence, will improve the prediction of all spliced transcripts, whether coding or non-coding.


Genome sequence and annotation

Curated annotation of gene structures on chromosomes 6, 13, 14, 20, and 22 were obtained from the Vertebrate Genome Annotation (Vega) database [14]. We extracted a total of 27954 internal protein-coding exons of different intron phases for our positive training set. Based on the definition [24], an intron contained within CDS is said to have a phase of zero if the intron demarcates a codon boundary, a phase of one if it divides the codon between the first and second nucleotides, and a phase of two if the intron divides a codon between the second and third nucleotides. The position of an exon with respect to the codon positions can be defined by the phases of upstream and downstream flanking introns and when an exon is flanked by introns of the same phase, it will be a multiple of three nucleotides in length. The phase definition is important for the neutralization scheme described in section.

Vega data, which is stored in an Ensembl style database [25] was extracted directly from the database using the BioJava toolkit with biojava-ensembl extensions [26].

Constructing a non-redundant set of sequences

To eliminate similar sequences from the datasets, we performed an all-against-all comparison of the sequences using NCBI blastn [27] using default options (word size 11, match reward +1, mismatch penalty-3) and recorded all pairs with a bit score ≥ 35. We then performed single-linkage clustering, and from each cluster we picked one member at random to represent that cluster in the final data set.

Neutralization of coding sequences

Exon neutralization is a process which randomizes the sequence of a set of protein-coding exons while maintaining three key constraints:

  • The neutralized exons code for the same protein sequence as the real exon

  • The frequency of a particular codon being used to represent a particular amino acid is maintained

  • The overall dinucleotide composition of the set is maintained

Thus, by comparing neutralized exons against the corresponding set of original exons, it should be possible to detect sequence features which are preferentially over- or under-represented in the original exon set due to the amino acid codons used. Features that occur purely as artifacts of the underlying protein sequence will occur with equal frequency in the original and neutralized sets. Because the differences in codon usage are subtle, a large data set is required to construct a representative model. However, the curated human gene set is sufficiently large for this purpose.

The neutralization process used here is a Monte-Carlo method, whereby small (single-codon) changes to the sequence are proposed, then accepted or rejected on the basis of a probabilistic model which captures the features listed above. In this case, the model is encapsulated as a set of conditional codon usage tables. Consider a codon C which encodes amino acid A, and is flanked by nucleotides p and q to form the pentanucleotide pCq. Our model records the probability of the codon being used in this context:

P(C|A, p, q)     (1)

The model is initialized for a given set of exons by simply counting all in-frame codons in the exon set. For each exon in the set, a number of neutralization cycles are performed. In each cycle, one in-frame codon position within the exon is chosen at random. Let C equal the current codon at this position. If it encodes an amino acid which has only a single codon in the universal genetic code, it is always left unchanged. Otherwise, a synonymous codon, C', is proposed by sampling from a uniform random distribution over all synonyms, Q(C'|C). Next, the appropriate conditional codon usage table is consulted, given the two bases either side of C. We accept or reject the proposed change on the basis of the Metropolis-Hastings criterion [28]:

z = P ( C ) P ( C ) Q ( C | C ) Q ( C | C ) ( 2 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWG6bGEcqGH9aqpdaWcaaqaaiabdcfaqjabcIcaOiqbdoeadzaafaGaeiykaKcabaGaemiuaaLaeiikaGIaem4qamKaeiykaKcaamaalaaabaGaemyuaeLaeiikaGIafm4qamKbauaacqGG8baFcqWGdbWqcqGGPaqkaeaacqWGrbqucqGGOaakcqWGdbWqcqGG8baFcuWGdbWqgaqbaiabcMcaPaaacaWLjaGaaCzcamaabmGabaGaeGOmaidacaGLOaGaayzkaaaaaa@47FE@

When z ≥ 1, the codon substitution is always accepted, when z < 1 the substitution is accepted with probability z. In this case, at any given position, the proposal distribution Q is always uniform, the second term of this expression can be ignored: it is simply the fit of the proposed new codon to the model represented by the conditional codon usage tables which is important.

Generating random sequences with matching mono- and di-nucleotide composition

In order to randomize a set of sequences while maintaining mono- and di-nucleotide compostion, the sequence set is first analysed and its initial dinucleotide composition recorded. Then a large number (typically 500) of iterations are performed. For each iteration two points within the sequence are selected at random, breaking it into three segments, ABC. A rearrangement to give the sequence BAC is then proposed. This rearrangement destroys two dinucleotide pairings and creates two new pairings. The probabilities of the sequences ABC and BAC are calculated from the dinucleotide frequency table, and the rearrangement is accepted or rejected based on the Metropolis-Hastings criterion described above.

Generating sequences with matching GC content

For a further test in using the eponine-exons model in distinguishing non-coding exons and introns, we took our set of non-coding exons (trimmed to 100 bases long) and calculated the histogram of GC content. Then we shredded a large set of introns into 100 base fragments and randomly sampled fragments with a matched histogram of GC content like the exons. The Eponine-Exons model can successfully discriminate between exons and this GC matched set of intronic sequences. We have also done the same for the set of coding exons and a corresponding set of intronic sequences with similar GC content distribution.

The Convolved Eponine Windowed Sequence model

Sequence classification models were trained using a Relevence Vector Machine (RVM) [29]. The RVM is a method for learning sparse classification or regression models by optimizing the weights applied to an arbitrary set of basis functions. The final model output for some piece of data is the weighted sum of basis function outputs. The RVM's sparsity property means that it will generally select only a subset (often a small subset) of the basis functions provided for the final model, with all others given zero weights and thus making no contribution. Sparsity is generally considered a desirable feature in a machine learning system [30]. This is consistent with the intuition that a simple model is more likely to make useful generalizations which can be applied to unseen data, rather than solving the problem 'trivially' by memorizing the training data. Sparse training methods also offer a partial solution to the question of feature selection. The RVM is named by analogy to the better-known Support Vector Machine method, which is also a kind of sparse trainer, and indeed the RVM was initially presented as an alternative and direct competitor to the SVM. However, while the SVM can only build models that can be expressed using a suitable kernel function, the RVM can build any model that can be expressed as a sum of basis function outputs: we therefore consider it a more flexible method. In this case, we use the RVM as an engine to drive the construction of a motif-oriented sequence model.

The Convolved Eponine Windowed Sequence (C-EWS) model is a classification model for small regions (windows) of sequence data. In this case, each basis function defines a scaffold consisting of one or more DNA Position-Weight Matrices (PWMs), each with an associated position distribution relative to a scaffold anchor point. In principle obvious choices for smooth position distributions, such as the discretized Gaussian, extend to infinity, but in practice it is reasonable to apply some cut-off: for instance, only considering the portion of the distribution which includes 99% of the total probability mass. The probabilities of all points outside this region are assumed to be infinitesimal and ignored. Now that the distributions have finite size, for a given scaffold there is a pair of integers, n and m, such that when the scaffold anchor is placed in the interval [n : m], the non-infinitesimal parts of all the position distributions fall entirely within the length of a particular target sequence. In this model, we take motifs into account regardless of where they fall on the sequence, so we sum scores from along the length of the sequence. The basis functions for the RVM therefore take the form:

φ ( S ) = Z i = n m ( k = 1 K ( j = P k ( j ) W k ( S i + j i + j + | W k | ) ) ) ( 3 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaaiiGacqWFgpGzcqGGOaakcqWGtbWucqGGPaqkcqGH9aqpcqWGAbGwdaaeWbqaamaabmGabaWaaebCaeaacqGGOaakdaaeWbqaaiabdcfaqnaaBaaaleaacqWGRbWAaeqaaOGaeiikaGIaemOAaOMaeiykaKIaem4vaC1aaSbaaSqaaiabdUgaRbqabaGccqGGOaakcqWGtbWudaqhaaWcbaGaemyAaKMaey4kaSIaemOAaOgabaGaemyAaKMaey4kaSIaemOAaOMaey4kaSIaeiiFaWNaem4vaC1aaSbaaWqaaiabdUgaRbqabaWccqGG8baFaaGccqGGPaqkcqGGPaqkaSqaaiabdQgaQjabg2da9iabgkHiTiabg6HiLcqaaiabg6HiLcqdcqGHris5aaWcbaGaem4AaSMaeyypa0JaeGymaedabaGaem4saSeaniabg+GivdaakiaawIcacaGLPaaaaSqaaiabdMgaPjabg2da9iabd6gaUbqaaiabd2gaTbqdcqGHris5aOGaaCzcaiaaxMaadaqadiqaaiabiodaZaGaayjkaiaawMcaaaaa@6ABD@

where S i j MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGtbWudaqhaaWcbaGaemyAaKgabaGaemOAaOgaaaaa@30C0@ denotes a subsequence from i to j, P k is the k'th position distribution and W k is the k'th weight matrix in the scaffold. Z is the normalizing constant:

Z = 4 k = 1 K | W k | m n + 1 ( 4 ) MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacH8akY=wiFfYdH8Gipec8Eeeu0xXdbba9frFj0=OqFfea0dXdd9vqai=hGuQ8kuc9pgc9s8qqaq=dirpe0xb9q8qiLsFr0=vr0=vr0dc8meaabaqaciaacaGaaeqabaqabeGadaaakeaacqWGAbGwcqGH9aqpdaWcaaqaaiabisda0maaCaaaleqabaWaaabmaeaacqGG8baFcqWGxbWvdaWgaaadbaGaem4AaSgabeaaliabcYha8badbaGaem4AaSMaeyypa0JaeGymaedabaGaem4saSeaoiabggHiLdaaaaGcbaGaemyBa0MaeyOeI0IaemOBa4Maey4kaSIaeGymaedaaiaaxMaacaWLjaWaaeWaceaacqaI0aanaiaawIcacaGLPaaaaaa@45BE@

with |W| denoting the length of weight matrix W. For the special case of scaffolds only containing a single motif, this formulation is equivalent to the Eponine Windowed Sequence model described in [15]. However, placing the motifs in scaffolds opens the possibility of learning some longer-range structural information. Groups of motifs that are regularly found together might suggest RNA-binding factors – each recognising its own short target motif – binding cooperatively.

To train C-EWS models, the RVM is first initialized with a set of single-motif scaffolds, each having a preference for some randomly picked 5 base motif. The RVM training process is then started and scaffolds which are not helpful for the classification problem are discarded. Periodically during training, the RVM working set is topped up with additional scaffolds obtained by applying one of the following sampling strategies to a scaffold (or, in some case, pair of scaffolds) randomly selected from the current working set:

  • Generate a new weight matrix in which each column is a sample from a Dirichlet distribution with its mode equal to the weights in the corresponding column of the parent weight matrix.

  • Generate a new weight matrix one column shorter than the parent by removing either the first of the last column.

  • Generate a new weight matrix with an extra column at either the start or the end, biased in favour of a random base.

  • Combine the sets of motifs from two scaffolds, with randomly chosen offsets between the two (up to some maximum number of weight matrices per scaffold, in this case 3).

  • Take a scaffold with two or more PWMs and return the scaffold with one of those PWMs (picked at random) removed

  • Alter the position or width of one of the relative position distributions in a scaffold.

When an operation that acts on one motif is applied to a multi-motif scaffold, one target motif from the parent scaffold is picked at random. By applying these operations repeatedly, the method is able to explore the space of scaffolds.


  1. Lim LP, Burge CB: A computational analysis of sequence features involved in recognition of short introns. Proc Natl Acad Sci USA 2001, 98(20):11193–11198.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  2. Graveley BR: Sorting out the complexities of SR protein functions. RNA 2000, 6: 1197.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  3. Bourgeois CF, Popielarz M, Hildwein G, Stevenin J: Identification of a bidirectional splicing enhancer: differential involvement of SR proteins in 5' or 3' splice site activation. Mol Cell Biol 1999, 19: 7347–7356.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  4. Liu HX, Zhang M, Krainer AR: Identification of functional exonic splicing enhancers motifs recognized by individual SR proteins. Genes Dev 1998, 12: 1998–2012.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  5. Lynch KW, Maniatis T: Assembly of specific SR protein complexes on distinct regulatory elements of the Drosophila doublesex splicing enhancer. Genes Dev 1996, 10: 2089–2101.

    Article  CAS  PubMed  Google Scholar 

  6. Schaal TD, Maniatis T: Selection and characterization of pre-mRNA splicing enhancers: identification of novel SR protein-specific enhancers sequences. Mol Cell Biol 1999, 19: 1705–1719.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  7. Tacke R, Manley JL: The human splicing factors ASF/SF2 and SC35 possess distinct functionally significant RNA binding specificities. EMBO J 1995, 14: 3540–3551.

    PubMed Central  CAS  PubMed  Google Scholar 

  8. Tacke R, Tohyama M, Ogawa S, Manley JL: Human Tra2 proteins are sequence specific activators of pre-mRNA splicing. Cell 1999, 93: 139–148.

    Article  Google Scholar 

  9. Tian H, Kole R: Strong RNA splicing enhancers identified by a modified method of cycled selection interact with SR protein. J Biol Chem 2001, 276: 33833–33839.

    Article  CAS  PubMed  Google Scholar 

  10. Zheng ZM, Huynen M, Baker CC: A pyrimidine-rich exonic splicing suppressor binds multiple RNA splicing factors and inhibits spliceosome assembly. Proc Natl Acad Sci USA 1998, 95: 14088–93.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  11. Cavaloc Y, Bourgeois CF, Kister L, Stevenin J: The splicing factors 9G8 and SRp20 transactivate splicing through different and specific enhancers. RNA 1999, 5: 468–483.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  12. Liu HX, Cartegni L, Zhang M, Krainer A: Exonic Splicing enhancer motif recognized by SC35 under splicing conditions. Mol Cell Bio 2000, 20(3):1063–1071.

    Article  CAS  Google Scholar 

  13. Lam BJ, Hertel KJ: A general role for splicing enhancers in exon definition. RNA 2002, 8: 1233–1241.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  14. Ashurst JL, Chen C, Gilbert J, Jekosch K, Keenan S, Meidl P, Searle S, Stalker J, Storey R, Trevanion S, Wilming L, Hubbard T: The Vertebrate Genome Annotation Database. Nucleic Acids Res 2005, 33: D459–465.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  15. Down TA, Hubbard TJP: What can we learn from noncoding regions of similarity between genomes. BMC Bioinformatics 2002, 5: 144.

    Google Scholar 

  16. Bucher P: Weight matrix descriptions of four eukaryotic RNA polymerase II promoter elements derived from 502 unrelated promoter sequences. Journal of Molecular Biology 1990, 212: 563–578.

    Article  CAS  PubMed  Google Scholar 

  17. Zhang XHF, Leslie CS, Chasin LA: Dichotomous Splicing Signals in Exon Flanks. Genome Res 2005, 15(6):768–79.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  18. Katz L, Burge CB: Widespread Selection for Local RNA Secondary Structure in Coding Regions of Bacterial Genes. Genome Res 2003, 13: 2042–2051.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  19. Fairbrother WG, Yen RF, Sharp PA, Burge CB: Predictive Identification of Exonic Splicing Enhancers in human genes. Science 2002, 297: 1007–1013.

    Article  CAS  PubMed  Google Scholar 

  20. Zhang HF, Heller KA, I H, Leslie CS, Chasin LA: Sequence Information for the Splicing of Human Pre-mRNA Identified by Support Vector Machine Classification. Genome Res 2003, 13(12):2637–2650.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  21. Blanchette M: A comparative analysis method for detecting binding sites in coding regions. In Proceedings of the seventh annual international conference on Research in computational molecular biology. Edited by: M V, S I, P P, M W. 2003, 57–66.

    Google Scholar 

  22. Dror G, Sorek R, Shamir R: Accurate identification of alternatively spliced exons using support vector machine. Bioinformatics 2005, 21(7):897.

    Article  CAS  PubMed  Google Scholar 

  23. Down TA: Computational Localization of Promoters and Transcription Start Sites in Mammalian Genomes. PhD thesis. University of Cambridge; 2003.

    Google Scholar 

  24. Clark F, Thanaraj TA: Categorization and characterization of transcript-confirmed constitutively and alternatively spliced introns and exons from human. Human Molecular Genetics 2002, 11: 451–464.

    Article  CAS  PubMed  Google Scholar 

  25. Birney E, et al.: An Overview of Ensembl. Genome Res 2004, 14: 925–928.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  26. The Biojava Project[]

  27. Altschul SF, Madden T, Schaffer A, Zhang J, Zhang Z, Miller W, Lipman D: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res 1997, 25: 3389–3402.

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  28. Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E: Equation of state calculations by fast computing machines. J Chemical Physics 1953, 21: 1087–1092.

    Article  CAS  Google Scholar 

  29. Tipping ME: Sparse Bayesian learning and the relevance vector machine. Journal of Machine Learning Research 2000, 1: 211–244.

    Google Scholar 

  30. Graepel T, Herbrich R, Shawe-Taylor J: Generalisation Error Bounds for Sparse Linear Classifiers. Proceedings of the Thirteenth Annual Conference on Computational Learning Theory 2000, 298–303.

    Google Scholar 

Download references


We thank HAVANA, the Chromosome 22 annotation group and Ensembl for genome sequence and annotation data. BL also thanks Adrian Krainer and Michael Zhang for helpful discussions. BL is supported by the International Fellowship from the Agency of Science, Technology and Research (A-STAR), Singapore. TD thanks the Wellcome Trust for support.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Bernard Leong.

Additional information

Authors' contributions

TD, BL and TH conceived and designed this study, and analysed results. TD implemented the Eponine machine learning system and BL extended the system to study the exons. BL drafted the manuscript. All authors read and approved the final manuscript.

Authors’ original submitted files for images

Rights and permissions

Open Access This article is published under license to BioMed Central Ltd. This is an Open Access article is distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Down, T., Leong, B. & Hubbard, T.J. A machine learning strategy to identify candidate binding sites in human protein-coding sequence. BMC Bioinformatics 7, 419 (2006).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: