 Research article
 Open Access
 Published:
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated proteins
BMC Bioinformatics volume 11, Article number: 14 (2010)
Abstract
Background
Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing methods for estimating the probability of motif recurrence may be biased by the size and composition of the search dataset, such that p value estimates from different datasets, or from motifs containing different numbers of nonwildcard positions, are not strictly comparable. Here, we develop more exact methods and explore the potential biases of computationally efficient approximations.
Results
A widely used heuristic for the calculation of motif overrepresentation approximates motif probability by assuming that all proteins have the same length and composition. We introduce p_{ v }, which calculates the probability exactly. Secondly, the recently introduced SLiMFinder statistic Sig, accounts for multiple testing (across all possible motifs) in motif discovery. However, it approximates the probability of all other possible motifs, occurring with a score of p or less, as being equal to p. Here, we show that the exhaustive calculation of the probability of all possible motif occurrences that are as rare or rarer than the motif of interest, Sig', may be carried out efficiently by grouping motifs of a common probability (i.e. those which have permuted orders of the same residues). Sig'_{ v }, which corrects both approximations, is shown to be uniformly distributed in a random dataset when searching for nonambiguous motifs, indicating that it is a robust significance measure.
Conclusions
A method is presented to compute exactly the true probability of a nonambiguous short protein sequence motif, and the utility of an approximate approach for novel motif discovery across a large number of datasets is demonstrated.
Background
Short Linear Motifs (SLiMs) are abundant and ubiquitous recurring protein subsequences that function largely independently of the tertiary structure of the containing protein. SLiMs mediate tasks such as cell signalling, act as recognition sites for protein modification and target proteins for subcellular localisation [1, 2]. SLiMs are short (typically between three and ten amino acids in length) and degenerate (positions are often flexible in terms of possible amino acids) making motif context important for specificity due to the limited number of residues in the interaction interface [3]. This simplicity gives them an evolutionary plasticity that is unavailable to globular protein domains, enabling de novo motifs to evolve convergently through point mutations, thereby adding new functions to proteins [4]. SLiMs preferentially occur in natively disordered regions of proteins [5] challenging the long standing dogma that structure equals function [6]. With 25%  30% of the human proteome natively disordered and large portions of the interactome unexplained by known domaindomain interactions [7] there is vast potential for novel SLiM discovery [8].
Increased knowledge of SLiM attributes, through the study of known functional motifs, has enabled advancements in computational methods for SLiM discovery. This culminated in the discovery of a Translinbinding motif, the first novel functional motif to be discovered by computational methods [9]. These methods can be split into two distinct classes; rediscovery of known SLiMs and prediction of novel SLiMs. SLiM rediscovery, which was pioneered by PROSITE [10], uses regular expression or profile matching to search for novel instances of previously known SLIMs. Tools such as the ELM [1] and MnM [11] servers use context information such as globularity, conservation or residue accessibility to improve confidence in returned motifs. Motif rediscovery techniques have also been used to search for enrichment of known SLiMs in proteins that are associated with particular protein functions, using statistical enrichment to define motifs important for these functions. These methods have been used to discover novel instance of both KEN box and EH1 transcriptional repressor motifs [12, 13].
Several methods have also been suggested for the discovery of novel SLiMs. The most successful of these methods seek to find motifs that are overrepresented in evolutionarily unrelated proteins sharing a common attribute (such as interacting with a common proteinbinding domain [14], those which have a common posttranslational modification [15] or which localise to the same subcellular location [16]). Dilimot [17] and SLiMDisc [18] use this technique, to build upon the scoring schemes of ASSET [19] and PRATT [20] respectively, to successfully discover new, and rediscover known, functional motifs. However, these first generation methods have two important deficiencies: (a) their scores are biased on motif length and dataset size, making them incomparable across multiple datasets and between motifs of different lengths; and (b) they do not offer an indication of the likelihood that any motif could reach such a score by chance.
In previous work, we introduced SLiMFinder [21], a probabilistic method for SLiM discovery that heuristically accounts for these shortcomings with a twostep scoring scheme. Both steps of this scoring scheme use simplifying assumptions that are known to be violated in real data. Given that motif probability calculations are relatively approximate (it is difficult to model exactly the amino acid or word count background distributions in a set of proteins or protein regions under study) these approximations seem at first glance to be satisfactory. However, in practise we noted in studies searching for motifs across many datasets that consistent biases were emerging, that related to the complexity of the motif, and to the size of the dataset searched. Since computational motif discovery is most usually struggling to identify a weak signal against a background of noise, we were motivated to try and eliminate these biases by improving the statistical calculations.
The first step of the SLiMFinder scoring scheme applies the binomial probability mass function to mean success probabilities across all proteins, denoted here as p_{ μ }, to calculate the probability of a given motif occurring by chance in the number of proteins it occurs in, or greater. Therefore, this assumes that the proteins in a search dataset all have the same length and composition. Here, we introduce a more accurate calculation, p_{ v }which incorporates unique success probabilities for each protein, allowing for its length and composition. The advantage of correcting for this effect is that the pvalue cutoffs from datasets that have varying sizes of proteins become more comparable, as well as being more realistic.
The second step of the SLiMFinder scoring scheme computes an approximate significance, Sig. This is a datasetbased score, which accounts for the multiple testing inherent in motif discovery, by calculating the probability that any motif in the dataset will be returned with that pvalue or less by chance. However, Sig approximates the probability of all other possible motifs occurring with a score of p or less as p. Here, we introduce the true calculation, Sig', that replaces this approximation, and present an efficient algorithm for its calculation. The advantage of correcting for this effect is that motifs of different length, or containing amino acids of very different frequency, are treated equally, so that there is not a bias towards any class of motif.
We investigate the impact of replacing both approximations with the more exact calculations on the overall accuracy of the scoring scheme. Each step is independent allowing them to be implemented and tested separately, four significance scoring schemes are discussed (Table 1), investigating the tradeoff between accuracy and efficiency. We discuss the optimal approaches for largescale studies of multiple datasets.
Methods
Motif discovery statistics can be defined by 3 basic probabilities; p_{1+}, the probability that there are 1 or more occurrences of a motif in a protein; p, the probability in a dataset of N proteins that a given motif would occur by chance with its observed support or higher; and Sig, the probability that any motif would reach p or less by chance. In this section, each probability will be introduced and discussed, focussing on the speed and accuracy of the statistics, and an efficient and accurate method of calculating Sig is described.
Exact probability of a given motif support considering unique success probabilities
Previous work: Mean Success Probability Heuristic
The probability, p_{1+}, that there are one or more occurrences of a motif in a protein is calculated differently by SLiMFinder and Dilimot. The former calculates p_{1+} based on amino acid frequencies, whereas the later calculates p_{1+} based on word counts. The merits of each method have been discussed previously [21]. Here, the calculation of p_{1+}, is based on amino acid frequencies and allows ambiguous/degenerate positions to be evaluated.
where
Equation 1. p(1 or more instances of a given motif in a given protein)
where the success probability, p_{ motif }, is the probability that the motif will occur at any position in the protein, n is the number of positions in the protein that the motif can occur, m is the motif, l is the number of nonwildcard positions in the motif, m_{ i }is position i in motif m, x is the number of degenerate/ambiguous possibilities at position i, m_{ ik }is the k^{th}ambiguous possibility at position i, f(m_{ ik }) is the background frequency of the amino acid m_{ ik }and B is the binomial function. The calculation is independent of alphabet and allows the use of terminal characters "^" and "$" denoting N and C termini respectively, which is taken into account in calculating motif significance.
Equation 1 considers both amino acid composition and the length of the protein to calculate the probability. By considering the length (the variable n accounts for the number of positions in a protein at which a motif can occur) the calculations allow short proteins/peptides (for example peptides returned by phage display screens) to be scored without bias. The amino acid composition allows for any background amino acid frequency to be incorporated, including the distribution from within a protein, adding flexibility to the scoring scheme.
Generally, each protein (or cluster of proteins whenever several homologous proteins are grouped or weighted to correct dependencies introduced by divergent evolution [22]) will have a unique success probability, p_{1+}. Previously, the mean success probability for the motif to occur in any given protein in the dataset, p_{1+μ}, was approximated as the mean of the p_{1+} values.
Equation 2. Approximate p (1 or more instances of a given motif in any given protein)
The probability of k or more proteins in a dataset containing a given motif one or more times, p_{ μ }, may be estimated using I, the incomplete beta function, the cumulative distribution function of the binomial probability mass function.
Equation 3. Approximate p(k or more proteins with 1 or more occurrences of a given motif)
where k is the support of the motif (i.e. the number of proteins containing it), N is the number of proteins in the dataset and p_{1+μ}is the mean success probability of a motif occurring in any protein in the dataset.
More exact calculation
The binomial function calculation in Equation 3, assumes all success probabilities are equal to p_{1+μ}(Equation 2). The binomial equation can be expanded to allow unique success probabilities for each protein, p_{ v }, by summing the product of success and failure probabilities for each possible combination of k successes, t, and Nk failure probabilities, f. This computation increases the number of calculations necessary ^{N}C_{ k }fold.
Equation 4. Set of all possible combinations of k successes from N trials
where
Equation 5. Exact p(k or more proteins with 1 or more occurrences of a given motif)
Example
The error associated with p_{ μ }is most easily explained in terms of occasions where p_{1+} for a protein is 0, a frequent occurrence when masking techniques are used to improve motif discovery (e.g., a protein entirely lacking W has zero probability of having the motif WxxS). Consider a set of 6 proteins, with success probabilities for a motif p_{1+} of {0.1, 0.1, 0.1, 0.0, 0.0, 0.0}. 3 proteins contain an occurrence of the motif. The mean success probability p_{1+} is 0.05 and the motif has a p_{ μ }of 1.64^{e3}. When unique success probabilities are used a p_{ v }of 7.29^{e4} is calculated. In this case, the motif occurring k times or more is roughly twice as unlikely to occur as approximated by p_{ μ }. The bias introduced by p_{ μ }can therefore be considered conservative estimate.
Exact probability that any motif will be returned with a given pvalue or less
Previous work: Motif Binomial pvalue Significance Heuristic
SLiMFinder introduced Sig, the probability of any motif, with the same number of nonwildcard positions, occurring with that probability p or less by chance.
Equation 6. Approximate probability (any motif will occur with a binomial pvalue of p or less)
where R is calculated as 20^{l}(x+1)^{l1}, l is the number of nonwildcard positions in the motif and x is the maximum length of a wildcard region allowed. Effectively, this score assumes that all other possible motifs are equally likely to give rise to a score equal to, or lower than, the motif of interest. However, this is not always true. For example, more likely motifs may have, for all supports, a pvalue greater than the observed motif's pvalue, hence such motifs may never actually occur with a probability as low as p. Sig will always score a given p as being as likely or more likely than it is, making Sig a conservative approximation.
More Accurate Significance
To calculate Sig', the true probability of 1 or more fixed position motifs (i.e. with the same number of nonwildcard positions) in a dataset occurring with the observed p or lower, it is necessary to calculate, for each possible motif p', the probability that the motif will occur with a score of p or less. An efficient algorithm for the calculation of Sig' is available in the Appendix.
where
Equation 7. probability (any given motif will occur with a pvalue less than or equal to the p of the observed motif)
Equation 8. probability (any motif will occur with a pvalue of p or less)
Example
Consider a search for dimers in a dataset with an alphabet, A = {L, W}, of size a = 2 and proteins of length 5. For the purposes of simplicity, the example uses global amino acid frequencies for p_{1+} calculations, whereas the typical case described earlier in the manuscript has individual p_{1+} probabilities for each protein. The dataset contains 4 proteins (N = 4) with sequences (LLLLL, LLLLL, LWWLL, LLLLL) giving global amino acid frequencies of f_{ L }= 0.9 and f_{ W }= 0.1. The probability that any of the 4 possible dimer motifs in the motif space, M, (M = {LL, WW, LW, WL}, S = 4) will occur at any position in a protein are p_{ LL }= 0.81, p_{ WW }= 0.01 p_{ WL }= p_{ LW }= 0.09 (see Equation 1, p_{ motif }). The probability that a protein will contain one or more occurrences of a motif is p_{1+} (LL) = 0.9987, p_{1+} (WW) = 0.0394, p_{1+} (WL) = p_{1+} (LW) = 0.3143 (see Equation 1). Using the binomial and cumulative binomial we can calculate, using p_{1+} as the mean success probability (all protein sequences are the same length and use the same global amino acid frequencies so the success probabilities for each protein for a given motif will be the same), the probability that each motif will occur k times (Binomial in Table 2) and the probability that each motif will occur k or more times (p_{ μ }in Table 2).
Searching the dataset for overrepresented motifs, the support k for the motifs are LL = 4, WW = 1, WL = 1 and LW = 1. p_{ μ }of each motif in the motif space is p_{ μ LL }= 0.9948, p_{ μ WW }= 0.1485, p_{ μ LW }= p_{ μ WL }= 0.7789 (Equation 3), making WW the top ranking motif occurring in 1 protein with a probability, p, of 0.1485. From Equation 6, the significance, Sig, of p_{ μ WW }is 0.474. For the example in Table 2, the set of support values (S_{ motif }) are shown in bold. This gives the values of k for which I(k, N, p_{ m }) < = p, as being S_{ LL }= {}, S_{ WW }= {1,2,3,4} and S_{ WL }= S_{ LW }= {3,4}, therefore p'_{ LL }= 0, p'_{ WW }= 0.1485 and p'_{ WL }= p'_{ LW }= 0.0949 (see Equation 7). As expected, the p' values are all less than or equal to p, illustrating the conservative nature of the Sig score. Calculating Sig', once the individual p' values are known, is straightforward. The Sig' for WW is 1  (1  0)(10.0949)(10.0949)(10.1485) = 0.302 (Equation 8).
Randomised test datasets
To test each of the 4 significance scoring schemes, 3 sets of 100 datasets containing 10, 30 and 60 proteins were picked at random from the UNIPROT database [22]. These datasets model random interaction networks that are likely to have little or no enrichment for any functional motifs. To allow for the calculation of Sig'_{ v }, a process that is currently computationally intractable using the calculations described here, a similar set of proteins was created to artificially force p_{1+} values to be equal for each protein thereby testing the scoring schemes accuracy when no bias is present. A human protein was chosen at random from the UNIPROT database and the residues where shuffled to create datasets of 10, 30 and 60 proteins, therefore each protein is same length and has the same amino acid frequency and hence, for any given motif, has the same p_{1+} for each protein.
Datasets were analysed using SLiMFinder with default settings with the exception of statistical calculations that were completed as described in this paper. The statistics described in this paper are implemented in freely downloadable software, as a modification to version 4.0 of the previously described SLiMFinder software [21], with additional command line switches introduced for the two calculations (sigprime = T/F and sigv = T/F).
The programme is available at http://bioinformatics.ucd.ie/shields/software/slimfinder. The version of the SLiMSuite software package available at time of submission is also included as supplemental information with this paper (Additional File 1).
Results and Discussion
Comparing the four statistical scoring schemes to expectation
When tested on randomly created datasets, significance scores for fixed motifs should ideally be uniformly distributed [23] (i.e. if 100 datasets are analysed we would expect to see 1 motif with a significance of 0.01 or less, and 50% of the datasets should have a significance of 0.5 or greater). Using datasets of proteins randomly selected from UniProt, we tested to what extent each of the 4 scoring schemes rejected the null hypothesis, that the top ranking significance scores from these random datasets are uniformly distributed.
For all motif lengths and dataset sizes tested, Sig'_{ v }did not reject the null hypothesis, consistent with it being a true significance measure (Fig. 1a, top panel). The other three statistics all reject the null hypothesis to differing degrees, with Sig' showing less departure from expectation compared to Sig and Sig_{ v }. Sig rejects the null hypothesis for all the datasets. The statistics showed similar effects when considering the divergence of the observed pvalues (root mean squared error) from the uniform distribution (Fig. 1a, side panel). The degree of rejection of the null hypothesis varies considerably according to the dataset size and the motif length (Fig 1a, main panel). A heatmap illustrates these effects (Fig 1b), showing that the degree of rejection of the null hypothesis for each of the three approximate statistics depends on both the dataset size, and on the length of the motif under consideration. Overall, the greatest improvement over the Sig statistic is provided by considering the exact probability that any motif may have a pvalue of the observed significance or less (implemented in Sig' and in Sig'_{ v }); while the correction for varying protein lengths and composition in a dataset has a lesser effect when calculating the pvalue of the observed motif (implemented in Sig_{ v }and in Sig'_{ v }).
How comparable are significance values of motifs of differing length, or motifs discovered in different sized datasets?
One of the major biases with using a binomial pvalue, p_{ μ }, which SLiMFinder attempted to improve upon, was the incomparability of pvalues for motifs of different lengths. p_{ μ }is strikingly different for random datasets, depending on whether it is the value for a 3mer or a 5mer (SF2 in Additional File 2). We were interested to discover to what extent a given motif significance score might be comparable for different discovered motifs, and to what extent the score is biased, depending on dataset size and motif length. For each scoring scheme, we compared the returned significance scores obtained with each motif size in each dataset size.
No biases are evident with the Sig'_{ v }scoring scheme where the hypothesis that the significance scores were sampled from the same distribution was only rejected (p < 0.05) for one of the 36 comparisons (Fig. 2b), consistent with expectations. The Sig statistic showed some biases, but somewhat surprisingly, the Sig_{ v }statistic appeared more biased than the Sig statistic (Fig. 2b): in particular, the larger datasets seemed to be biased in a way that the smaller datasets are not (Fig 2a). However, It can be seen that the majority of Sig correlation between datasets relates to pvalues in the range of 0.8 to 1.0 (Fig 2a) and is a related to the schemes conservative bias. The boxplots in Fig 2a indicate that Sig' is reasonably similarly distributed for all motif lengths and dataset sizes, but it is noticeable that the mean pvalue varies more across datasets and motif sizes than Sig'_{ v }does. What is not clear from these random datasets is the extent to which these two statistics are biased for motifs that are significantly overenriched (i.e. in ranking true positives, at the other end of the pvalue scale).
Ambiguity
SLiMFinder considers subsets of predefined residue groupings to allow ambiguity in motif positions; this further adds to the complications of significance calculations and the probability calculations have not been extended to consider these. In general, the true significance calculations described in this paper, when used to calculate the significance of an ambiguous motif, will overestimate the significance of the motif. In SF3 in Additional File 2, this is illustrated. For these examples, ambiguous motifs were defined as those with one or more ambiguous position or with at least one variable length spacer, using the default set of ambiguous groupings (KRH, DE, ILMV, FYWH, AGS, ST). Sig'_{ v }overestimates the significance, ignoring the greatly increased search space of potential ambiguous motifs, in addition to the search space of fixedposition motifs (SF3 in Additional File 2). We note that under the conditions tested, the Sig calculation is also conservative in all of the datasets considered here, even in the presence of ambiguity. Thus, for ambiguous motifs the Sig statistic may provide a more robust heuristic for very roughly approximating absolute significance. However, it must be noted that in general ambiguous motifs will still have a relatively higher Sig score than nonambiguous motifs, so that a single model for ranking of ambiguous and nonambiguous motifs is not ideal. Accordingly, search results within a dataset or across many datasets for ambiguous and nonambiguous motifs should be considered as two separate rankings, given the current available models.
Calculation redundancy
The level of redundancy in the brute force calculation of Sig' compared to the use of nonredundant motif groupings (Appendix, Equations 913) is provide in Table 3. For 5mer motifs there is a 75fold decrease in the number of calculations necessary for the calculation of the same value. Since the level of redundancy increases as the length of the motif increases, true Sig' calculations are possible for motifs which would been computationally infeasible using brute force calculations.
Computational efficiency
For each motif length considered, the number of calculations necessary to calculate Sig', with the algorithmic speedup described (Appendix, Equations 913), increases the number of calculations ^{a+l1}C_{l} fold, compared to the Sig calculation, where a is the alphabet size and l is the motif length (without the speedup the increase is a^{l}fold; see ST2 in Additional File 2). While Sig' is in these examples 350 times more computationally expensive than Sig, its calculation is tractable, increasing approximately linearly as dataset size increases (ST2 in Additional File 2). For very large datasets, the computational costs seem to be much less. Sig_{ v }increases the number of calculations ∑^{n}C_{ j }fold, for all values of j between k and n, where n is the number of clusters in the dataset and k is the support of the motif. The rapid increase of Sig_{ v }calculation runtime as the dataset size increases makes it impractical for larger datasets (ST2 in Additional File 2). Sig'_{ v }performs poorly compared to Sig, it increases the number of calculations ^{a+l1}C_{ l }*∑^{n}C_{ j }fold, for all values of j between k and n, for each motif length considered. The computational cost of Sig'_{ v }calculation is unsuitable for high throughput analysis in spite of its superior accuracy; it took over a day on a standard workstation for datasets with more than 10 proteins.
Comparison of the four scoring schemes with the ELM benchmarking dataset
The ELM benchmarking dataset is a widely used standard by which motif discovery methods can be tested, compared and trained. Although the dataset is biologically unrealistic for most discovery situations (each of the proteins in each dataset is guaranteed to contain one or more instances of the functional motif), the data allows direct comparison of the attributes of scoring schemes. Table 4 compares the Sig' and Sig scoring schemes on the 16 ELM benchmarking datasets (version  8 April 2009). Residues with an IUPRED [24] score of less then 0.2 were masked, as were underconserved residues by relative local conservation masking using metazoan orthologues alignments retrieved by GOPHER [24].
Sig' scored the true positive motif as more significant than the Sig scoring scheme in all datasets with the exception of the highly significant TRG_ER_KDEL motif which was scored as more significant by Sig. For one of these, LIG_CYCLIN_1, this resulted in the returned motifs becoming significant (cutoff of 0.01). Two false positives (LIG_1433_3 and LIG_NRBOX) were also returned as significant by Sig' which were not returned by Sig, however in both cases these motifs were off target motifs, true functional motifs involved in the regulation of the proteins in the datasets (See ST1 in Additional File 2). One other example of an off target motifs was significantly over represented by both scoring schemes, two motifs with strong nuclear localisation, LIG_RB and LIG_PCNA, returned arginine/lysine rich nuclear localisation motifs.
Conclusions
We have shown how more exact calculations of short nonambiguous protein motif probabilities may be calculated efficiently, and the computational cost associated with these calculations. We propose the use of Sig' calculations as the scoring scheme for motif discovery with current typical computational resources, as it offers the best trade off between speed and accuracy. Although not as accurate, the Sig score will, in circumstances where a motif is obviously enriched, return a close approximation of the true score. Thus, a useful technique for highthroughput analyses is to recover datasets of interest using the quicker Sig statistical framework at low stringency (it is a conservative score) before rerunning the data using the more accurate statistics. However, for more general use the Sig' statistical framework is both efficient and accurate enough to suffice.
Improving these statistical measures has a strong bearing on how to efficiently rank potential novel motifs discovered in searches of many datasets derived from across the interactome. Future work will need to focus on developing better statistical measures for ambiguous motifs (ambiguous in terms of both alternative amino acids at certain positions, and in terms of variable length spacers). The problem is nontrivial as the combinatorial explosion introduced by ambiguity and the complex protein groupings that allow a motif to reach a given support makes a true ambiguous motif significance computationally intractable. Advances in methodology [21], dataset design [25] and motif enrichment [26], in association with the statistical framework described here, have put computational SLiM discovery in a position where it can complement experimental methods for the discovery of novel functional SLiMs. As our knowledge of proteinprotein interaction, cellular localisation and keyword classification of proteins improves, these methods should aid in the discovery of the vast number of SLiMs remaining to be discovered by pinpointing particular residues of strong biological interest within a robust statistical framework.
Appendix
Improving the computational efficiency of the Sig' calculation
The major bottleneck in the calculation of Sig' for a motif pvalue, p_{ μ }, is the calculation of p' of all motifs with a cumulative pvalue equal to or less than p. For longer motifs the complexity can make search times unfeasable, since the number of possible motifs grows exponentially with motif length. However, methods can take advantage of the inherent redundancy in the motif space due to the commutative nature of the motif occurrence probability calculations, p_{ motif }(Equation 1). Motifs which contain the same number of each residue from the alphabet A (where each residue can have between 0 and l occurrences in the motif) will have the same p_{ motif }. This means that the order of the residues in the motif has no effect on a motif's occurrence probability (e.g. RGG, GRG, GGR all have the same p_{ motif }). Exploiting the redundancy by calculating motif groupings with the same value p_{ motif }yields large increases in the speed of calculations. The value p' will be the same for each motif in a grouping and therefore it is necessary to only calculate this value once for each group, p'_{ group }, rather than for each motif.
Equation 9. Sig' calculation for nonredundant motif groupings
A nonredundant Sig' can be calculated using Equation 9. G is the set of all distinct unordered groupings of residues for each partition in P. A partition describes the number of unique residues occurring in a grouping. For example, there are 3 possible partitions for motifs of length 3, q = {(3),(1,2),(1,1,1)} meaning a 3mer can have 3 residues which are the same, two residues which are the same and another different residue or 3 residues which are different respectively. The set q corresponds to the set P = {(0,0,1),(1,1,0),(3,0,0)}. For example, RGG, GRG, GGR can be considered as a grouping RGG, which has a partition P = (1,1,0) and q = (1,2). RGD, RDG, GRD, GDR, DGR and DRG can be considered as a grouping RGD, which has a partition P = (3,0,0) and q = (1,1,1) and RRR, can be considered as a grouping RRR, which has a partition P = (0,0,1) and q = (3).
Equation 10. Set of all possible partitions for a motif of length l
The number of possible partitions for a given motif length can be described as the cardinality of set P and follows the series {1,2,3,5,7,11,15,22} as l goes from 1 to 8. Each partition has Cg_{ i }distinct unordered groupings of residues and each of these groupings has Cm_{ i }possible ordered motif combinations. For example, a grouping with P = (0,0,1), 3 of the same amino acids eg. RRR, can only be chosen 1 way while P = (3,0,0), 3 different amino acids, can be chosen 6 ways.
Equation 11. Number of distinct ordered groupings for a partition
where
Equation 12 Number of ordered motif combinations in a grouping
To calculate the p'_{ group }value for each nonredundant motif group, it is first necessary to define all such groupings. This can be achieved efficiently using the recursive algorithm described in the pseudocode found in SF1 in Additional File 2. The total number of distinct nonredundant motifs of length l and an alphabet of size a, R_{ nr }, is calculated as:
Equation 13. Number of nonredundant motifs of length l
Abbreviations
 SLiM:

Short Linear Motif
 Sig:

Significance.
References
 1.
Puntervoll P, Linding R, Gemund C, ChabanisDavidson S, Mattingsdal M, Cameron S, Martin DM, Ausiello G, Brannetti B, Costantini A, et al.: ELM server: A new resource for investigating short functional sites in modular eukaryotic proteins. Nucleic Acids Res 2003, 31(13):3625–3630. 10.1093/nar/gkg545
 2.
Diella F, Haslam N, Chica C, Budd A, Michael S, Brown NP, Trave G, Gibson TJ: Understanding eukaryotic linear motifs and their role in cell signaling and regulation. Front Biosci 2008, 13: 6580–6603. 10.2741/3175
 3.
Stein A, Aloy P: Contextual specificity in peptidemediated protein interactions. PLoS ONE 2008, 3(7):e2524. 10.1371/journal.pone.0002524
 4.
Neduva V, Russell RB: Linear motifs: evolutionary interaction switches. FEBS Lett 2005, 579(15):3342–3345. 10.1016/j.febslet.2005.04.005
 5.
Fuxreiter M, Tompa P, Simon I: Local structural disorder imparts plasticity on linear motifs. Bioinformatics 2007, 23(8):950–956. 10.1093/bioinformatics/btm035
 6.
Wright PE, Dyson HJ: Intrinsically unstructured proteins: reassessing the protein structurefunction paradigm. J Mol Biol 1999, 293(2):321–331. 10.1006/jmbi.1999.3110
 7.
SchusterBockler B, Bateman A: Reuse of structural domaindomain interactions in protein networks. BMC Bioinformatics 2007, 8: 259. 10.1186/147121058259
 8.
Russell RB, Gibson TJ: A careful disorderliness in the proteome: sites for interaction and targets for future therapies. FEBS Lett 2008, 582(8):1271–1275. 10.1016/j.febslet.2008.02.027
 9.
Neduva V, Linding R, SuAngrand I, Stark A, Masi FD, Gibson TJ, Lewis J, Serrano L, Russell RB: Systematic Discovery of New Recognition Peptides Mediating Protein Interaction Networks. PLoS Biol 2005, 3(12):e405. 10.1371/journal.pbio.0030405
 10.
Hulo N, Sigrist CJ, Le Saux V, LangendijkGenevaux PS, Bordoli L, Gattiker A, De Castro E, Bucher P, Bairoch A: Recent improvements to the PROSITE database. Nucleic Acids Res 2004, (32 Database):D134–137. 10.1093/nar/gkh044
 11.
Balla S, Thapar V, Verma S, Luong T, Faghri T, Huang CH, Rajasekaran S, del Campo JJ, Shinn JH, Mohler WA, et al.: Minimotif Miner: a tool for investigating protein function. Nat Methods 2006, 3(3):175–177. 10.1038/nmeth856
 12.
Michael S, Trave G, Ramu C, Chica C, Gibson TJ: Discovery of candidate KENbox motifs using cell cycle keyword enrichment combined with native disorder prediction and motif conservation. Bioinformatics 2008, 24(4):453–457. 10.1093/bioinformatics/btm624
 13.
Copley RR: The EH1 motif in metazoan transcription factors. BMC Genomics 2005, 6: 169. 10.1186/147121646169
 14.
Mishra GR, Suresh M, Kumaran K, Kannabiran N, Suresh S, Bala P, Shivakumar K, Anuradha N, Reddy R, Raghavan TM, et al.: Human protein reference database2006 update. Nucleic Acids Res 2006, (34 Database):D411–414. 10.1093/nar/gkj141
 15.
Diella F, Gould CM, Chica C, Via A, Gibson TJ: Phospho.ELM: a database of phosphorylation sitesupdate 2008. Nucleic Acids Res 2008, (36 Database):D240–244.
 16.
Sprenger J, Lynn Fink J, Karunaratne S, Hanson K, Hamilton NA, Teasdale RD: LOCATE: a mammalian protein subcellular localization database. Nucleic Acids Res 2008, (36 Database):D230–233.
 17.
Neduva V, Russell RB: DILIMOT: discovery of linear motifs in proteins. Nucleic Acids Res 2006, (34 Web Server):W350–355. 10.1093/nar/gkl159
 18.
Parthasarathi L, Devocelle M, Sondergaard C, Baran I, O'Dushlaine CT, Davey NE, Edwards RJ, Moran N, Kenny D, Shields DC: Absolute net charge and the biological activity of oligopeptides. J Chem Inf Model 2006, 46(5):2183–2190. 10.1021/ci0600760
 19.
Neuwald AF, Green P: Detecting patterns in protein sequences. J Mol Biol 1994, 239(5):698–712. 10.1006/jmbi.1994.1407
 20.
Jonassen I, Collins JF, Higgins DG: Finding flexible patterns in unaligned protein sequences. Protein Sci 1995, 4(8):1587–1595. 10.1002/pro.5560040817
 21.
Edwards RJ, Davey NE, Shields DC: SLiMFinder: A Probabilistic Method for Identifying OverRepresented, Convergently Evolved, Short Linear Motifs in Proteins. PLoS ONE 2007, 2(10):e967. 10.1371/journal.pone.0000967
 22.
Bairoch A, Apweiler R, Wu CH, Barker WC, Boeckmann B, Ferro S, Gasteiger E, Huang H, Lopez R, Magrane M, et al.: The Universal Protein Resource (UniProt). Nucleic Acids Res 2005, (33 Database):D154–159.
 23.
Storey JD, Tibshirani R: Statistical significance for genomewide studies. Proc Natl Acad Sci USA 2003, 100(16):9440–9445. 10.1073/pnas.1530509100
 24.
Dosztányi Z, Csizmok V, Tompa P, Simon I: IUPred: web server for the prediction of intrinsically unstructured regions of proteins based on estimated energy content. Bioinformatics 2005, 21(16):3433–3434. 10.1093/bioinformatics/bti541
 25.
Aragues R, Sali A, Bonet J, MartiRenom MA, Oliva B: Characterization of protein hubs by inferring interacting motifs from protein interactions. PLoS Comput Biol 2007, 3(9):1761–1771. 10.1371/journal.pcbi.0030178
 26.
Davey NE, Shields DC, Edwards RJ: Masking residues using contextspecific evolutionary conservation significantly improves short linear motif discovery. Bioinformatics 2009, 25(4):443–4. 10.1093/bioinformatics/btn664
Acknowledgements
This work was supported by Science Foundation Ireland and an EMBL Interdisciplinary Postdoc (EIPOD) fellowship from EMBL
Author information
Additional information
Authors' contributions
ND formulated, developed, refined and tested the methods, and wrote the manuscript. DS was involved in initial discussions of the problem and in the writing of the manuscript. RE was involved in the initial formulation, and in the writing of the manuscript. All authors read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Davey, N.E., Edwards, R.J. & Shields, D.C. Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated proteins. BMC Bioinformatics 11, 14 (2010). https://doi.org/10.1186/147121051114
Received:
Accepted:
Published:
Keywords
 Success Probability
 Motif Discovery
 Functional Motif
 Dataset Size
 Amino Acid Frequency