False occurrences of functional motifs in protein sequences highlight evolutionary constraints
© Via et al; licensee BioMed Central Ltd. 2007
Received: 23 October 2006
Accepted: 01 March 2007
Published: 01 March 2007
False occurrences of functional motifs in protein sequences can be considered as random events due solely to the sequence composition of a proteome. Here we use a numerical approach to investigate the random appearance of functional motifs with the aim of addressing biological questions such as: How are organisms protected from undesirable occurrences of motifs otherwise selected for their functionality? Has the random appearance of functional motifs in protein sequences been affected during evolution?
Here we analyse the occurrence of functional motifs in random sequences and compare it to that observed in biological proteomes; the behaviour of random motifs is also studied. Most motifs exhibit a number of false positives significantly similar to the number of times they appear in randomized proteomes (=expected number of false positives). Interestingly, about 3% of the analysed motifs show a different kind of behaviour and appear in biological proteomes less than they do in random sequences. In some of these cases, a mechanism of evolutionary negative selection is apparent; this helps to prevent unwanted functionalities which could interfere with cellular mechanisms.
Our thorough statistical and biological analysis showed that there are several mechanisms and evolutionary constraints both of which affect the appearance of functional motifs in protein sequences.
The detection of functional sequence patterns (motifs) in a yet uncharacterized protein is one of the most widely used and powerful methods for assigning a function to proteins in newly sequenced proteomes. Sequence patterns associated to functional motifs are usually generated manually in an attempt to maximize the number of sequences that clearly belong to the set functionally characterized by the motif (true positives, TP), while minimizing the number of unrelated sequences (false positives, FP) . The possibility of estimating the number of false predictions is critical in evaluating the significance of finding a pattern in a protein sequence. The false positive rate of a pattern on a large protein database can be estimated from the number of matches expected to occur by chance [2, 3]. In the following we will refer to this thesis as the 'classical hypothesis'. Both these authors measured the expectation of occurrence of PROSITE  functional patterns in a sequence database of size N, simply as the product of N and the amino acid probabilities in each position of the pattern. The individual amino acid probability values were calculated from the frequencies of residues in Swiss-Prot . Sternberg  assumed the calculated expectations as a benchmark for evaluating motif matches on the Swiss-Prot database as annotated in PROSITE; Nevill-Manning and co-workers  used such expectations for assessing the specificity of motifs exhaustively generated from a multiple sequence alignment of related proteins. From this perspective, the number of occurrences of a motif in a set of proteins can be regarded as the sum of the functional occurrences plus the random occurrences, i.e. motif matches explained by the sequence composition alone .
The statistics of the number of occurrences of regular expression motifs in a random text, has been studied by several authors [[7–11] and related references]. Nicodème and co-workers  in particular, computed the theoretical expectation λ of the number of matches of PROSITE patterns on the PRODOM multi-alignment consensus sequences ; This analytical method uses computer science algorithms and combinatorial mathematics to give a constructive method for approximating (or calculating exactly, if the size of the problem allows for this) the distribution of number of matches of a given regular expression in a random text, the random text being modelled as either a Bernoulli sequence (independent letters with given probabilities of occurring) or a Markov sequence with given transition matrix. The matches can be defined as either (possibly) overlapping or as non-overlapping. For large texts, it is shown that the number of occurrences of the expression in the text will approximately follow a Normal distribution with mean and variance that can be calculated. In the application example, matching PROSITE motifs in a PRODOM based set of sequences, the whole database is treated as one large text and the letter frequencies used are thus computed as averages over all target sequences. The quantity λ was compared to the corresponding total number of observed matches O, with the finding that λ systematically underestimates O, a result that can be expected from the functional significance of PROSITE patterns.
Whereas events of over-representation of a motif are usually related to its biological significance, the analysis of the relationship between the expected number of random matches of a motif (λ) and its number of false predictions on a biological database (FP), might provide insight into the evolutionary nature of protein sequences. Indeed a chance match of a functional motif is unlikely to be functional wherever it is found in a protein: a motif will be recognized as functional only when occurring in the right conformation, location and cellular context. It is possible, however, that, at least in some cases, a match occurring for the "mere" sequence composition, fulfils physical conditions similar enough to those of the corresponding functional occurrence, thus giving rise to an "unwished" functionality. These cases would be, as a rule, disadvantageous for the cell and could be the object of a counter-selection process. On the other hand, a functional motif may involve such a high stringency of boundary conditions (protein conformation, cellular compartment, etc.) that its appearance (e.g. by exon shuffling or by a random mutation of a "pre-motif") in more than one unrelated protein family would be extremely unlikely to result in function interference.
The relationship between λ (expected) and FP (observed) has not been yet thoroughly investigated. In particular, a quantitative relationship, valuable for inferring the expected number of false positive matches for an uncharacterized pattern in a sequence database, is yet to be established. Neither has a qualitative analysis of the biological features of false occurrences, especially if such occurrences are associated to significantly higher or lower values of the corresponding theoretical expectations, been reported in the literature.
Here we propose a statistical analysis of the relationship between the theoretical expectation of the number of pattern matches in a database of random sequences and the number of false occurrences in a biological database. The study has been carried out for PROSITE patterns in the form of regular expression, but it is general enough to be applied to any motif of the same form.
Our approach is based on several concepts. First, we computed the expectation λ of a pattern P, as the mean number of hits in N database randomizations, instead of deriving it from some a priori statistical model for the occurrences of regular expressions (or motifs) in random texts. Second, a regression analysis on the set of m points (λ, FP), where m is the number of patterns under consideration, was used to determine an analytical relationship, which generalizes the (λ, FP) relationship to any motif and which can be, therefore, used for predictive purposes. Third, a study of statistical and biological features of the FP matches was performed for patterns displaying a number of false predictions in a biological database remarkably greater or lower than the expected number of hits in the corresponding randomized database. Our findings suggest diverse fascinating mechanisms and constraints occurring during evolution perhaps affecting the random appearance of functional motifs in protein sequences.
In the study of the relationship between the expected number of matches λ of a functional motif in a random dataset and the observed number of its false occurrences in the corresponding biological dataset, three important issues must be considered and discussed beforehand: the set of functional motifs used to carry out the experiments, the biological sequence dataset(s) in which the functional motifs are searched, and the statistical model adopted for establishing the theoretical expected number of random matches.
The dataset of motifs
The set of functional motifs in the form of regular expressions was derived from the PROSITE database of patterns and generalized profiles, as described in methods.
Among other useful features, the PROSITE database provides, for each entry, complete lists of Swiss-Prot proteins manually verified for true positive (TP), false positive (FP), and false negative (FN) assignments .
Our work is dependent on the accuracy of PROSITE annotations of true and false positive matches. Random errors in the PROSITE annotation, however, should not affect the statistics of motif matches for two reasons: firstly, they are rare. In fact, true and false positives of PROSITE patterns are manually verified by expert curators through both the literature and the information retrieved from other databases such as Swiss-Prot or Pfam . Secondly, random errors, by definition, do not have a preference for specific groups of patterns, and hence do not cause a systematic bias in our analysis. As it will be discussed, the presence of systematical errors, which may partly influence some results, has been evaluated and rejected.
The sequence datasets
The complete Swiss-Prot sequence database is a general reference for motif statistics. However, it is redundant and its composition in protein families and organisms is still biased by the trends of the scientific community. The analysis carried out on human100 (see methods) must take into account that it is considerably smaller than the complete human proteome. The yeast proteome is only partially represented in the Swiss-Prot database. The two further proteomes analysed, E. coli and M. jannaschii, which instead are almost entirely represented in the Swiss-Prot database, belong to small organisms, and unfortunately the number of PROSITE patterns' FPs is too small for a solid statistical analysis (data not shown).
The statistical model
The procedure adopted to estimate the expected number of random matches of a sequence motif does not rely on a priori assumptions about the statistical distribution of such matches (see methods). Moreover, it allowed us to overcome the obstacle of estimating the number of chance occurrences for those patterns characterized by variable spacers between more conserved positions. In fact, the problem of analytically calculating the probability of occurrence of this type of patterns in a random text has not yet been faced .
Correlation and slope of PROSITE and reversed patterns
0.877 ± 0.019
1.080 ± 0.023
0.908 ± 0.031
1.055 ± 0.028
1.008 ± 0.046
0.977 ± 0.049
The Nicodème and co-workers approach is slightly different from the approach used in this work, since our method of randomizing by permutation within each sequence and of defining matches as simply absence or presence of the motif in the target sequences leads to a closer link between the actual sequence database and the randomized sequences and also to simpler statistical properties for the number of matches. The major consequence concerns patterns abundant in cysteines. Since proteins are particularly heterogeneous regarding the density of the cysteines, the value of λ of some cysteine-rich patterns turned out to be underestimated by Nicodème and co-workers and overestimated by our procedure. Such patterns were discarded from the regression analysis.
PROSITE and reversed patterns statistical analysis
The lines defining the 95% confidence interval divide the (λ, FP)-plane into three regions (see Fig. 1). Patterns belonging to the first region (I) are such that FP > λR (outliers with observed number of random matches greater than the corresponding expected number). Patterns with λL < FP < λR are in the central region (II), and those belonging to the third region (III) are such that FP < λL (outliers with observed number of random matches lower than the corresponding expected number).
The number and features of patterns from regions I, II and III were analysed separately and then compared. The majority of the patterns belong to the central region (II), while few patterns have a number of FPs significantly greater than expected by chance (region I) in every dataset considered. sprot100 and human100 also display a subset of outliers which have a number of FPs significantly lower than expected by chance (region III).
On a biological dataset, matches of random patterns, i.e. derived from differently ordered positions of functional motifs, probably occur by chance. We obtained randomized PROSITE patterns by reversing their regular expressions (see methods). This procedure should generate patterns with no functional significance. Being made up of the same composition of residues as the original PROSITE patterns, these random patterns display the same statistical properties, including the information content , as the original ones. The statistical analysis of the reversed patterns revealed a high correlation between matches in the random datasets and matches in the biological datasets and a regression slope that is always equal to one (Table 1).
The comparison between the slope values of PROSITE and reversed patterns shows that, whereas reversed patterns have slope ≈ 1 on every datasets considered (i.e. λ ≈ FP), PROSITE patterns display a slope value lower than one, namely, on average, a higher number of matches in the random datasets as opposed to the biological datasets in the cases of sprot100 and human100.
In the following, the detailed analysis performed on the sprot100 dataset is reported.
Patterns in region II
PROSITE patterns lay in region II (see Table 2). Patterns where FP = 0 are predominant in this region. The fact that the majority of patterns fall in this region shows that our model confirms the "classical hypothesis" [2, 3], although the slope < 1 (see table 1) indicates a general tendency of having FP < λ.
The information content (IC)
26.8 ± 0.7
20.3 ± 0.5
33.3 ± 0.3
24.2 ± 0.2
μ = FP = 0
36.9 ± 0.4
24.5 ± 1.2
17.3 ± 0.5
32.8 ± 0.4
21.9 ± 0.2
μ = FP = 0
35.2 ± 0.4
24.4 ± 2.1
31.9 ± 0.4
20.8 ± 0.3
μ = FP = 0
33.2 ± 0.4
Even though the majority of patterns has a number of FPs similar to the number of matches expected by chance, we need to take into account that the cell machinery is constantly subject to mutational events and, consequently, to the force of natural selection. It is therefore reasonable that, on average, regarding the accidental occurrence of functional motifs, protein sequences do not behave as mere aggregations of letters. Thus, we hypothesize that, albeit if as a very small effect, the tendency of having FP < λ might reflect the evolutionary pressure (non-uniformly distributed) against the random appearance of functional motif matches. This hypothesis of "mild counter-selection" cannot be proved. It is, however, strengthened by the fact that, for non-functional patterns, we found FP ~λ (see below).
Outliers of region I
The order propensity (OP) value (GlobPlot)
0.37 ± 0.03
0.25 ± 0.03
0.31 ± 0.02
0.25 ± 0.06
0.14 ± 0.02
0.22 ± 0.02
0.41 ± 0.08
0.32 ± 0.04
Number of expected by chance and observed PROSITE patterns in regions I and III
patterns that are mis-annotated in PROSITE (if correctly annotated they would belong to region II);
mis-annotated patterns are examples of patterns whose occurrences, annotated as FPs for a specific PROSITE pattern, are able to identify functionally or structurally relevant regions in protein families different from the true positives protein family but anyway functionally related to it. Two of them are PS00103 and PS00120.
The majority of PS00103 true positives are ribose-phosphate pyrophosphokinases, which contain the Pribosyltran Pfam  domain. The PS00103 motif is well conserved in this domain. Nearly all the false positives are adenine phosphoribosyltransferase (APRT), which also have a Pribosyltran Pfam domain. It would be, therefore, more appropriate to use this motif to describe the wider family of Pribosyltran domain containing proteins.
PS00120 is the PROSITE motif built around the serine active site of lipases. Many false positives are found among esterases. This pattern is very conserved (especially the stretch around the catalytic site) in the Pfam alpha/beta hydrolase fold domain, which is found in several protein families including lipases and esterases.
The number of true outliers is in agreement to what expected by chance from the Poisson distribution. One interesting example of a true outlier among many others is represented by PS00014, which is annotated in the ELM database (Eukaryotic Linear Motif. database) [18, 19] as TRG_ER_KDEL. This is a short C-terminal signal motif which is strictly conserved in the major endoplasmic reticulum (ER) proteins, and which allows proteins that permanently reside in the ER lumen to be distinguished from newly synthesized secretory proteins. In sprot100, this motif is also detected in 53 non-related proteins, which are clearly not located in the ER (because they are of bacterial or viral origin, for example).
A further analysis was performed on the PS00014 false positive sequences annotated in the Swiss-Prot release 50.1. The subcellular location of each protein was retrieved by means of the Swiss-Prot annotation. Out of the 100 FPs, only two reside in the ER: one is annotated in the manually curated ELM database as true positive and the other could potentially belong to the set of true positives.
We hypothesize that a "proliferation" (e.g. by gene duplication) of FPs might have occurred, in some cases, in organisms or cellular compartments where their occurrence does not interfere with the function associated to the motif. In fact, it is unlikely that negative selection will act on accidental duplication events if these do not perturb the cell functionality.
Outliers of region III
Thirty-six patterns lay in region III (Table 2 and 3). Following the Poisson distribution, the number of patterns expected to fall in this region by mere chance is 3 (see Table 4). These patterns have a number of FPs which is lower than λ. It should be also noticed that they display low information content and their FPs occur in more disordered (more exposed) regions of proteins (see next section). Our findings suggest that they are likely to result in "unwished" functionalities and, therefore, are good candidates for negative selection.
a systematic underestimate in the PROSITE annotation for true positives
a non-complete coverage of the sequence datasets
Some proteins might have been erroneously identified as true positives by similarity alone, indeed. If this were the case, we would expect the real number of false positives to be higher and these patterns to belong to region II. In other words, for these patterns, the number of true positives as assigned in PROSITE (TP) would consist of a number of experimental true positives plus a number of mis-annotated true positives. In such a case we would expect to find that the difference between the number of matches expected by chance and the number of PROSITE false positives is correlated to TP. We found that this correlation is < 0.2, and rejected the hypothesis of a systematic error in the annotation of patterns in region III.
It could be proposed that, by increasing the number of sequences in the datasets, the number of FPs might grow more rapidly than the number of random matches, resulting in a shift of patterns from region III to region II.
In order to verify this possibility, we started from non-redundant versions of the datasets under study and increased progressively their redundancy (this corresponds to augmenting the number of sequences). Then we studied the relationship between FP and λ and found that the number of FPs increases more slowly than the number of random matches in the dataset (data not shown). This result implies that the addition of sequences to a dataset would either relocate some patterns of region II in region III or leave the situation unaffected.
Information content and disorder propensity
The patterns' mean information content (IC) was calculated as explained in Methods . The IC of a pattern is directly proportional to the length of the pattern and inversely proportional to its degeneracy. Patterns with high IC are in general longer and display lower degeneracy than patterns with low IC. This implies that a high IC is advantageous for the selectivity of a motif. We found that the highest IC value is attained by patterns for which λ = FP = 0 (see Table 2).
Interestingly, for each sequence dataset considered the mean IC decreases from patterns belonging to region I to those of region III. In particular, a single pattern analysis showed that the vast majority of patterns in region III are short (few positions) and non-degenerate (few amino acid types permitted in each position). This means that these patterns are less subject to conformational constraints.
Patterns were compared also for the propensity of their false positive matches to occur in ordered/disordered protein regions (see Methods). Ordered regions typically contain regular secondary structures packed into a compact globule . Ordered regions, therefore, tend to be more buried, and therefore more hidden, than disordered ones. On average, false positive matches of patterns belonging to region III have a higher propensity of occurrence in protein disordered segments than those belonging to region I and II have (Table 3). These findings suggest that the patterns of group III tend to occur in more exposed and less structurally constrained regions of proteins, as compared to patterns of groups I and II and especially to those for which λ = FP = 0. The evolutionary implications of these results will be further addressed in the 'Discussion' section.
The most interesting result is that these patterns display a regression slope which is always equal to one (Table 1). A detailed analysis was performed in order to establish if all the reversed patterns are non-functional. 352 reversed patterns matching PROSITE patterns were removed (see Methods). The great majority of the remaining patterns lies in the 95% confidence interval. Few of them fall in region I (thirty-eight patterns for sprot100, eleven for human100 and six for yeast100). These are predominantly patterns highly conserved in some Pfam  family or domain (22 for sprot100, 7 for human100 and 4 for yeast100). For example, the reversed of PS00850 is found almost solely in regulator of ribonuclease activity A proteins and, moreover, it is conserved in the demethylmenaquinone methyltransferase Pfam domain present in these proteins. Hence, these are clearly non-random patterns that cannot be considered as non-functional and are, therefore, excluded from the regression analysis.
Finally, in region I, only fourteen patterns for sprot100, four for human100 and two for yeast100 are apparently non-functional. These numbers are in agreement with what it is expected by chance in this region (12 for sprot100, 5 for human100 and 3 for yeast100).
There is also a subset of reversed patterns falling in region III (twenty-five patterns for sprot100, four for human 100 and none for yeast). These patterns are less frequent (and in seven cases in sprot100 even much less frequent) in the biological database than in the random database. This observation together with an ad hoc analysis of the patterns, suggests that some of them share a particular amino acid compositions whose random appearance in a protein would have a high probability of interfering with the normal cell functionality. In this case it is possible that they are functional and conceivable that could be subjected to events of negative selection.
The first telling conclusion is that the great majority of functional motifs have a number of false occurrences comparable to the number of matches on a random database (i.e. they belong to the region II of the (λ, FP)-plane).
This result is in agreement with works such as  and . Thus, it seems that, in most cases, proteins are not affected if a stretch of amino acids, selected during evolution and carrying a structural or functional ability, appears in a proteome only by chance. In other words false occurrences of a functional motif do not generally compete with true positive ones. Indeed, there are several boundary conditions a motif has to fulfil in order to be functional in a protein or to be recognized by interactors. In the majority of cases, interactors are specific enough to discriminate between an exceedingly high number of similar sites and avoid mis-functionalities. On the other hand, sites that are similar to target motifs with limited specificities can be found not to interfere since they are hidden or appear in other cellular contexts, different cell types or tissues or even different organisms.
This possibility is in agreement with the order/disorder propensity data for false positive matches of patterns belonging to region I and II, i.e. patterns for which the number of false positives is higher or similar to the expected number of random hits (Table 3). In fact, we observed that false positive matches of patterns in region I and II are, on average, in more ordered areas than those of patterns in region III, suggesting how proteins may avoid cases of mis-recognition by interactors with little specificity.
A careful analysis of patterns for which the number of FP is notably greater than the number of matches expected by chance revealed several interesting features. First, some cases of mis-annotation have been identified. Besides these cases, which are only relevant for the quality of a pattern database, we observed several patterns whose false positive matches are functionally important in proteins non-related to and not co-localizing with proteins matching the true positives. In some other cases it seems that false positive matches proliferate, even with no functional relevance, in proteins spatially segregated from true positives. In both situations, evolution has been apparently more permissive or even rewarding towards compositions of amino acids belonging to non-interfering proteins.
Another solution to the problem of functional pattern specificity might be that, during evolution, longer and not too variable functional modules have been rewarded . In this case, not only could the true positive site be unique, but there might not be any sites with one mismatch. In this regard, it is worth noting that between 72% (in sprot100) and 89% (in yeast100) of patterns are such that λ = FP = 0 and that the mean information content (IC) of these patterns is much higher than the mean IC of any other group considered.
What can be said in terms of evolution about patterns of group III? These are patterns whose number of false positives is lower than expected by chance. They may belong to group III for three principal reasons.
The first one might be a systematic error in the PROSITE annotation for true positives, something which has been excluded by our analysis.
The second reason concerns the randomization model. We have seen that, at least in some cases, the expected number of chance matches of patterns rich in cysteines, depends on the statistical model adopted to evaluate it. Thus, one can imagine that patterns belonging to group III have some particular features, thus making their rate of occurrence in a random dataset dependent on the procedure adopted to randomize the dataset. An accurate analysis of the patterns, however, did not reveal any distinctive features supporting this hypothesis.
The third reason has evolutionary implications. The patterns of group III are characterized by a preponderance of residues predisposed to be present in more disordered, i.e. more exposed, regions of proteins. Moreover, short patterns, with little IC, undergo less conformational constraints than long patterns, with high IC. Thus, at least two important conditions of functionality are more easily fulfilled by this group of patterns.
If a false occurrence of a functional motif results in an "unwished" functionality, the protein(s) carrying it would be rejected during evolution. Cases of evolutionary negative selection have been recognized in immunology  and are likely to have an important role in many biological systems [23, 24]. Zarrinpar and co-workers  hypothesized negative selection against non-specific interactions as a mechanism for specificity enhancement of a particular SH3-ligand pair in yeast. Discrimination against proteins holding sequence consensi that are, for example, possible competitors in recognition or interaction processes, might account for the observed non-random distribution of false positive matches of some patterns. For example, a false positive match of a SH3 ligand consensus might result in promiscuous SH3 binding in the case of subcellular co-localization and temporal overlapping with a true occurrence of the ligand peptide.
The lower IC and the observed disorder tendency of the false positives of patterns of group III, compared to patterns of groups I and II, support the hypothesis of their counter-selection.
Evolutionary negative selection, however, is difficult to prove because so few biological cases have been clearly identified and there is only indirect information on the "products" of such a mechanism. Furthermore, organisms have developed several strategies for avoiding protein mis-functionalities, which may or may not operate through the mechanism of negative selection. Finally, counter-selection is more likely to occur in complex organisms, where evolution deals with duplication and mutation of a greater number of genes or portions of them. These organisms, however, are still insufficiently represented in the Swiss-Prot databank. More data will be available to support or disprove our hypotheses as soon as large and fully-annotated proteomes become available.
We presented a general numerical analysis exploring the different mechanisms used by Nature in order to prevent random occurrences of a functional motif interfering with the proper functioning of a living cell.
We used quantitative parameters (information content, disorder) to analyse PROSITE patterns sharing a common behaviour in terms of their appearance in random sequences. This analysis, together with a further literature study of the single motifs, led to the conclusion that, in the majority of the cases (>90%), FPs of functional motifs are not counter-selected during evolution: Apparently, the probability that a false positive occurs in the same organism, tissue, cell compartment, and protein region of a true positive, is low enough to prevent the risk of functional interference.
Our results therefore show that, for the majority of proteins, the mere presence of a motif is not enough to entail a particular function and therefore additional constraints must be satisfied. Furthermore, we identified a subgroup of motifs whose false positives have been subjected to events of counter-selection.
A set of functional patterns, in the form of regular expressions, was extracted from the complete PROSITE database  release 28.27, discarding patterns that are so general that PROSITE cannot classify true and false matches, and patterns restricted to either the N- or C-terminal of a sequence. This filtering procedure produced a set of 1295 functional motifs whose true (TP) and false positive (FP) sequences were identified from the PROSITE annotations and cross-referenced on the Swiss-Prot sequence database , release 42.
In the following, we will refer to "matches", as the number of sequences with at least one match, i.e. we did not consider multiple instances of a pattern in the same sequence.
The analysis described in this work was performed on five sequence datasets: the complete Swiss-Prot database after the removal of sequences containing one or more undetermined amino acid (sprot100, 145203 sequences), the set of 10632 H. sapiens sequences (human100), and the set of 4925 S. cerevisiae sequences (yeast100) derived from sprot100. The two further subsets analysed, are E. coli (complete proteome 4,338 proteins) and M. jannaschii (1,782 proteins), which are almost entirely represented in the Swiss-Prot database. Notice that the entire human and yeast proteomes comprise 35,093 proteins and 6,224 proteins, respectively. For each sequence dataset, the group of PROSITE patterns displaying at least one true positive hit was identified: 1295 patterns for sprot100, 855 for human100, 607 for yeast100, 639 for E. coli and 260 for M. jannaschii.
Data on the complete proteomes size are extracted from the Integr8 EMBL-EBI genome statistics . Sequence and pattern datasets are available on request.
Sequence databases randomization
In order to preserve the local sequence composition and to account for finite sequence length effects, the sequence databases were randomized by reshuffling each single sequence. We define a shuffled sequence of a sequence S as one in which the number of each kind of amino acid is exactly the same as in S . The randomization program was written in C using the GNU scientific library for random number generation and sequence shuffling .
Each dataset under consideration was randomized N (N = 1000) times. The randomization program is available on request.
The basic dataset was randomized N times and the number of matches with all selected patterns was counted for each randomization. For each pattern, the average number of matches was then calculated. The probability distribution of matches of a given pattern was assumed to be Poisson . This assumption was checked by plotting average number of matches for each pattern against the corresponding variance, finding a satisfactorily linear plot with unit slope (as expected in a Poisson setting).
More precisely, our randomization and match counting method implies that the random variable which counts the number of matches of a given motif in the randomized database will be the sum of a very large number (the number of sequences in the database) of Bernoulli variables (0/1 variables) with different but always small probabilities for the value 1, representing the presence of the motif in a given, permuted, single sequence. The sum of these probabilities is the expected number of matches of the motif in the whole database. The distribution of the number of matches can be approximated by the Poisson distribution regardless of the size of the expected number of matches as long as the largest single probabilities discussed above are small.
For large expected values, the Poisson distribution will simply be approximately Gaussian. In any case, the variance of the number of matches will always be smaller, although usually almost equal to, the variance implied by the Poisson distribution. Thus, use of the Poisson distribution will be conservative. In other words, considering a given observation as significantly deviating from an expected distribution will be more difficult under the Poisson distribution than under the "exact" distribution.
The number N of randomizations was set at 1000, yielding a relative error less than 3% in the determination of average numbers of matches larger than 1 and, although relative error may be larger, yielding an even smaller absolute error for averages smaller than 1.
We then constructed an exact confidence interval (c.i.) comprising at least 95% probability for each value λ of the observed average numbers of matches by iteratively summing probabilities p around λ (with probability values taken from the theoretical Poisson distribution) until Σp ≥ 0.95. The values of λ and the c.i. are plotted in Figure 1. Since the Poisson distribution is discrete, the calculation produced irregular lines, which indicate the upper and lower limits [λL, λR] of the prediction intervals and divide the (λ, FP)-plane into three regions (I, II and III). Furthermore, for each observed value of λ (expected number of matches under randomization), the corresponding value of effectively observed FP is used to generate a point in the figure. Points lying outside the c.i. can be considered as candidates for "extra-random effects".
It should be noticed that the discrete nature of the Poisson distribution implies that the probability above and below each c.i. will not be exactly 2.5% and may be different for each λ. This affects the expected number of patterns to be found outside the c.i. "by pure chance". However, one can calculate the exact expected number of patterns lying below or above the prediction interval by simply summing the probabilities corresponding to values left out from the intervals (There are good theoretical grounds for assuming that also the number of "chance outliers" follows the Poisson distribution).
The above construction of prediction intervals and relative calculation of "outlier patterns" was repeated at the 99% probability level, in addition at the 95% level in the previous experiment. In both cases, we found a number of outlier patterns lying above (region I) or below (region II) the prediction intervals significantly higher than expected by chance (see Table 4).
All the statistical computing was performed using the R language and environment .
For each pattern, λ was plotted versus the PROSITE pattern false positive number of matches and a line was fitted to the data, i.e. a regression analysis was applied to the set of points (λ, FP).
Given that false positive matches are expected to occur by chance alone in a biological database, it is reasonable to assume that the response variable, FP, comes from a Poisson distribution. From this assumption it follows that the variance of the variable FP increases with its mean value: to correct for the heteroskedasticity of residuals we defined a vector of weights (w) for k observations as w = (1/(λ1 + 1),...,1/(λi + 1),...,1/(λk + 1)). In other words, the influence of an observation on the fit decreases as its value increases.
From the equation for the line of best fit, the slope and intercept values were then calculated.
PROSITE patterns are written in the form:
P = A1 - x(i1, j1) - A2 - x(i2, j2) -...- x(ip-1, jp-1) - A p where Ai is a non-empty set of amino acid symbols and ik ≤ jk, which are integers, indicate the length of a wildcard x. We define the information content (IC) of a PROSITE type pattern as ([31, 14]):
where c is a constant (normally c = 0.5) and I1(Ai) is the information content of a single position Ai:
pa is the probability (calculated from the frequency of amino acid a in the dataset under consideration) of amino acid a, Σ is the set of all amino acids and .
This measure is based on Shannon's theory  and takes also into account the increase in uncertainty due to variable spacers of patterns.
The control: reversed patterns
As a control, the statistical analysis was also performed on randomized (i.e. non functional) PROSITE patterns. There are too many possible permutations when PROSITE patterns are used, thus we chose to reverse the pattern positions as a randomization procedure.
reversed patterns were found to match a PROSITE pattern. These were considered functional and therefore discarded. It is possible, however, that some of the remaining reversed patterns still encode a function. This is difficult to detect by means of an automated procedure. Thus, we performed a manual analysis of the reversed patterns displaying an observed number of matches very different from the number of expected matches (regions I and III). Reversed patterns matching conserved regions of some Pfam  domains were also discarded. The regression analysis was carried out, for each sequence dataset, on the reversed patterns retained after the filtering procedure only.
The false positives "disorder"
Protein disorder is described as the lack of regular secondary structure and a high degree of flexibility in the polypeptide chain . Several computational methods exist for identifying disordered residues within proteins . To infer the tendency of PROSITE patterns false positive hits of being in either disordered or ordered/globular regions of proteins, we applied GlobPlot , a predictor of protein disorder and globularity, to the sequences of the datasets considered.
GlobPlot is based on propensities, P, for all amino acids to be in globular or non-globular states. The leading hypothesis is that the tendency for disorder of an amino acid a can be expressed as P(a) = RC-SS where RC and SS are calculated as the frequencies for the amino acids' appearing either in regular secondary structures (helices or strands) as defined by DSSP  or outside them ('random coil', loops, turns etc.). Given a protein sequence of length L, a sum function is defined as:
where P(αi) is the propensity for the i th amino acid. The sum function defines a curve, which provides the regions of disorder/order along the sequence.
We then identified the position along the sequences of the false positive matches. The order propensity of a pattern (OP ∈ [0,1]) was defined as the ratio of residues of the pattern belonging to an ordered region (as defined in ) to the total number of residues of the pattern. The lower the value of OP of a pattern, the higher its propensity of lying in disordered regions.
We thank Giovanni Chillemi at Caspur for providing precious computing time. We thankfully acknowledge the support of Telethon (GGP04273), AIRC, a PNR 2001–2003 (FIRB art.8) and a PNR 2003–2007 (FIRB art.8).
- Falquet L, Pagni M, Bucher P, Hulo N, Sigrist CJ, Hofmann K, Bairoch A: The PROSITE database, its status in 2002. Nucleic Acids Res 2002, 30: 235–238. 10.1093/nar/30.1.235PubMed CentralView ArticlePubMedGoogle Scholar
- Sternberg MJE: Library of common protein motifs. Nature 1991, 349: 111. 10.1038/349111a0View ArticlePubMedGoogle Scholar
- Nevill-Manning CG, Wu TD, Brutlag DL: Highly specific protein sequence motifs for genome analysis. Proc Nat Acad Sci USA 1998, 95: 5865–5871. 10.1073/pnas.95.11.5865PubMed CentralView ArticlePubMedGoogle Scholar
- Hulo N, Sigrist CJ, Le Saux V, Langendijk-Genevaux PS, Bordoli L, Gattiker A, De Castro E, Bucher P, Bairoch A: Recent improvements to the PROSITE database. Nucleic Acids Res 2004, 32: D134-D137. 10.1093/nar/gkh044PubMed CentralView ArticlePubMedGoogle Scholar
- Bairoch A, Apweiler R, Wu CH, Barker WC, Boeckmann B, Ferro S, Gasteiger E, Huang H, Lopez R, Magrane M, Martin MJ, Natale DA, O'Donovan C, Redaschi N, Yeh LS: The Universal Protein Resource (UniProt). Nucleic Acids Res 2005, 33: D154-D159. 10.1093/nar/gki070PubMed CentralView ArticlePubMedGoogle Scholar
- Nicodème P, Doerks T, Vingron M: Proteome analysis based on motif statistics. Bioinformatics 2002, 18: S161-S171.View ArticlePubMedGoogle Scholar
- Hart RK, Royyuru AK, Stolovitzky G, Califano A: Systematic and fully automated identification of protein sequence patterns. J Comput Biol 2000, 7: 585–600. 10.1089/106652700750050952View ArticlePubMedGoogle Scholar
- Reinert G, Schbath S, Waterman MS: Probabilistic and statistical properties of words: an overview. J Comput Biol 2000, 7: 1–46. 10.1089/10665270050081360View ArticlePubMedGoogle Scholar
- Nicodème P, Salvy B, Flajolet P: Motif Statistics. ESA'99 volume 1643 of Lecture Notes in Computer Science. Proc European Symposium on Algorithms-ESA'99, Prague Springer-Verlag; 1999, 194–211. [http://citeseer.ist.psu.edu/eme99motif.html]Google Scholar
- Nicodème P: Regexpcount, a symbolic package for counting problems on regular expressions and words. Fundamenta Informaticae 2003, 56: 71–87.Google Scholar
- Robin S, Daudin J-J, Richard H, Sagot M-F, Schbath S: Occurrence probability of structured motifs in random sequences. J Comp Biol 2002, 9: 761–773. 10.1089/10665270260518254View ArticleGoogle Scholar
- Servant F, Bru C, Carrere S, Courcelle E, Gouzy J, Peyruc D, Kahn D: ProDom: Automated clustering of homologous domains. Brief Bioinform 2002, 3: 246–251. 10.1093/bib/3.3.246View ArticlePubMedGoogle Scholar
- Finn RD, Mistry J, Schuster-Böckler B, Griffiths-Jones S, Hollich V, Lassmann T, Moxon S, Marshall M, Khanna A, Durbin R, Eddy SR, Sonnhammer ELL, Bateman A: Pfam: clans, webtools and services. Nucleic Acids Res 2006, 34: D247-D251. 10.1093/nar/gkj149PubMed CentralView ArticlePubMedGoogle Scholar
- Jonassen I, Eidhammer I, Grindhaug SH, Taylor WR: Searching the protein structure databank with weak sequence patterns and structural constraints. J Mol Biol 2000, 304: 599–619. 10.1006/jmbi.2000.4211View ArticlePubMedGoogle Scholar
- Bateman A, Coin L, Durbin R, Finn RD, Hollich V, Griffiths-Jones S, Khanna A, Marshall M, Moxon S, Sonnhammer ELL, Studholme DJ, Yeats C, R Eddy SR: The Pfam protein families database. Nucleic Acids Res 2004, 32: D138-D141. 10.1093/nar/gkh121PubMed CentralView ArticlePubMedGoogle Scholar
- Austin S, Kundrot C, Dixon R: Influence of a mutation in the putative nucleotide binding site of the nitrogen regulatory protein NTRC on its positive control function. Nucleic Acids Res 1991, 19: 2281–2287. 10.1093/nar/19.9.2281PubMed CentralView ArticlePubMedGoogle Scholar
- Morett E, Segovia L: The sigma 54 bacterial enhancer-binding protein family: mechanism of action and phylogenetic relationship of their functional domains. J Bacteriol 1993, 175: 6067–74.PubMed CentralPubMedGoogle Scholar
- Puntervoll P, Linding R, Gemünd C, Chabanis-Davidson S, Mattingsdal M, Cameron S, Martin DMA, Ausiello G, Brannetti B, Costantini A, Ferre F, Maselli V, Via A, Cesareni G, Diella F, Superti-Furga G, Wyrwicz L, Ramu C, McGuigan C, Gudavalli R, Letunic I, Bork P, Rychlewski L, Kuster B, Helmer-Citterich M, Hunter WN, Aasland R, Gibson TJ: ELM server: a new resource for revealing short functional sites in modular eukaryotic proteins. Nucleic Acids Res 2003, 31: 3625–3630. 10.1093/nar/gkg545PubMed CentralView ArticlePubMedGoogle Scholar
- ELM – Functional Sites in Proteins[http://elm.eu.org/]
- Linding R, Russell RB, Neduva V, Gibson TJ: GlobPlot: exploring protein sequences for globularity and disorder. Nucleic Acids Res 2003, 31: 3701–3708. 10.1093/nar/gkg519PubMed CentralView ArticlePubMedGoogle Scholar
- Schneider TD, Stormo GD, Ehrenfeucht A: Information content of binding sites on nucleotide sequences. J Mol Biol 1986, 188: 415–431. 10.1016/0022-2836(86)90165-8View ArticlePubMedGoogle Scholar
- Palmer E: Negative selection – clearing out the bad apples from the T-cell repertoire. Nat Rev Immunol 2003, 3: 383–91. Review Review 10.1038/nri1085View ArticlePubMedGoogle Scholar
- Yaffe MB, Leparc GG, Lai J, Obata T, Volinia S, Cantley LC: A motif-based profile scanning approach for genome-wide prediction of signaling pathways. Nat Biotechnol 2001, 19: 348–353. 10.1038/86737View ArticlePubMedGoogle Scholar
- Newman JR, Keating AE: Comprehensive identification of human bZIP interactions with coiled-coil arrays. Science 2003, 300: 2097–2101. 10.1126/science.1084648View ArticlePubMedGoogle Scholar
- Zarrinpar A, Park SH, Lim WA: Optimization of specificity in a cellular protein network by negative selection. Nature 2003, 426: 676–680. 10.1038/nature02178View ArticlePubMedGoogle Scholar
- Integr8 – Access to complete genomes and proteomes[http://www.ebi.ac.uk/integr8/]
- Fitch WM: Random sequences. J Mol Biol 1983, 163: 171–176. 10.1016/0022-2836(83)90002-5View ArticlePubMedGoogle Scholar
- Galassi M, Davies J, Theiler J, Gough B, Jungman G, Booth M, Rossi F:GNU Scientific Library Reference Manual. 2nd edition. ISBN 0954161734 [http://www.gnu.org/software/gsl/] ISBN 0954161734
- Nicodème P: Fast approximate motif statistics. J Comput Biol 2001, 8: 235–48. 10.1089/10665270152530836View ArticlePubMedGoogle Scholar
- R Development Core Team: R: A language and environment for statistical computing.R Foundation for Statistical Computing, Vienna, Austria; 2004. [http://www.R-project.org] ISBN 3-900051-07-0Google Scholar
- Jonassen I, Collins JF, Higgins DG: Finding flexible patterns in unaligned protein sequences. Protein Sci 1995, 4: 1587–95.PubMed CentralView ArticlePubMedGoogle Scholar
- Shannon CE: A mathematical theory of communication. Bell System Technical Journal 1948., 27: 379–423 and 623–656 379–423 and 623–656Google Scholar
- Wright P, Dyson H: Intrinsically unstructured proteins: re-assessing the protein structure-function paradigm. J Mol Biol 1999, 293: 321–331. 10.1006/jmbi.1999.3110View ArticlePubMedGoogle Scholar
- Bracken C, Iakoucheva LM, Romero PR, Dunker AK: Combining prediction, computation and experiment for the characterization of protein disorder. Curr Opin Struct Biol 2004, 14: 570–6. 10.1016/j.sbi.2004.08.003View ArticlePubMedGoogle Scholar
- Kabsch W, Sander C: Dictionary of protein secondary structure: pattern recognition of hydrogen-bonded and geometrical features. Biopolymers 1983, 22: 2577–2637. 10.1002/bip.360221211View ArticlePubMedGoogle Scholar
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.