Skip to main content
PMC home page
BMC Bioinformatics logoLink to BMC Bioinformatics
. 2011 May 19;12:173. doi: 10.1186/1471-2105-12-173

An analysis of single amino acid repeats as use case for application specific background models

Paweł P Łabaj 1,✉, Peter Sykacek 1, David P Kreil 1,✉
PMCID: PMC3124433  PMID: 21595908

Abstract

Background

Sequence analysis aims to identify biologically relevant signals against a backdrop of functionally meaningless variation. Increasingly, it is recognized that the quality of the background model directly affects the performance of analyses. State-of-the-art approaches rely on classical sequence models that are adapted to the studied dataset. Although performing well in the analysis of globular protein domains, these models break down in regions of stronger compositional bias or low complexity. While these regions are typically filtered, there is increasing anecdotal evidence of functional roles. This motivates an exploration of more complex sequence models and application-specific approaches for the investigation of biased regions.

Results

Traditional Markov-chains and application-specific regression models are compared using the example of predicting runs of single amino acids, a particularly simple class of biased regions. Cross-fold validation experiments reveal that the alternative regression models capture the multi-variate trends well, despite their low dimensionality and in contrast even to higher-order Markov-predictors. We show how the significance of unusual observations can be computed for such empirical models. The power of a dedicated model in the detection of biologically interesting signals is then demonstrated in an analysis identifying the unexpected enrichment of contiguous leucine-repeats in signal-peptides. Considering different reference sets, we show how the question examined actually defines what constitutes the 'background'. Results can thus be highly sensitive to the choice of appropriate model training sets. Conversely, the choice of reference data determines the questions that can be investigated in an analysis.

Conclusions

Using a specific case of studying biased regions as an example, we have demonstrated that the construction of application-specific background models is both necessary and feasible in a challenging sequence analysis situation.

Background

In the post-genomic era, with the abundance of sequencing data, the functional interpretation of these sequences constitutes a key challenge. In particular, the identification of biologically relevant differences or shared patterns against a backdrop of functionally meaningless variation is of interest. In computational sequence analysis, this corresponds to detecting unusual patterns relative to a 'background' model [1-3]. The quality of this model directly affects analysis performance. Tools for homology detection by sequence similarity, like FASTA [4] or BLAST [5-7], or the identification of functional sites by pattern conservation in multiple sequence alignments [8,9] traditionally assume positional independence of residues. More recent approaches, including Hidden-Markov-Models (HMMs) [10,11], allow a local dependency structure. In either case, proteins are considered as 'slightly edited random sequences' [12]. Indeed, the complexity of protein sequences reaches 99% of the maximum possible complexity (complete randomness) [13]. Amino acids can apparently often be exchanged for alternatives with similar physicochemical properties [14,15], with the exception of key residues, such as those contributing to an active centre [16].

Interestingly, the same models are typically used for different types of analysis and for all the sequences studied. Increasingly, however, the power and advantages of adjusting background models so that they explicitly take the nature of the studied data sets and/or the question at hand into account are being recognized. One of the first such applications of background-HMMs tailored for the detection of selected functional domains was introduced by PFAM [11]. Recent statistics assessing sequence similarity now can adjust the expected frequencies for each protein [17]. On the other hand, problem-specific background models have been developed, where e. g., advanced secondary-structure background models are used for scoring multiple alignments [18].

While standard background models in general perform well in the analysis of globular protein domains, they are known to break down in regions of stronger compositional bias or low complexity, giving nonspecific false positives. In general, these regions are not conserved, and are therefore assumed to be tolerated as neutral and consequently filtered and excluded [19,20]. In contrast, accumulating evidence suggests functional roles of biased regions [21-23], as is for example reflected in the involvement of single amino acid repeats (SAARs) in a number of diseases [24-26]. Furthermore, SAARs can also be an important factor in transcriptional regulation [27,28] and protein interaction networks [29], affect morphological changes [30], and may facilitate adaptive processes [31,32]. As a result, the study of these particularly simple amino acid repeats is attracting increasing interest, despite the difficulty of detecting biased regions of potential biological relevance [22,23].

With the unexpected abundance of single amino acid repeats, detection of those with potential biological function is particularly challenging. As the observed frequency of SAARs cannot be captured by standard models [33-35], an exploration of more complex approaches becomes necessary. We here introduce and validate an empirical background model constructed specifically for this application, which adapts to the characteristics of the studied data set. Our approach is then demonstrated on a practical use case. We thus demonstrate how alternative, appropriate background models can be constructed successfully also in challenging cases. These methods are directly applicable to more general related questions regarding biased or low-complexity regions, while similar empirical constructions will be helpful in other situations in which the established standard models break down.

Results and Discussion

In a comparison of the three kingdoms [36], bacteria and archaea typically had much fewer single amino acid repeats (SAARs) than eukaryotes. Consequently our analysis focused on eukaryotes.

Model choice

As the standard sequence model of positional independence is, in fact, a Markov model of order zero, higher order Markov models were obvious candidates for an attempt to capture more complex structures in protein sequences. Prediction performance was assessed for SAARs of length five in a comprehensive set of non-fragmented eukaryotic proteins. Statistically, under the standard model, repeats shorter than five are already expected by random chance for typical protein lengths [37]. Incidentally, five residues is also the shortest repeat-length that has been implicated in diseases [24]. Markov models of orders zero to three were considered, including the most complex Markov model that is meaningful for this pattern length (Suppl. Table S1 in Additional File 1).

Figure 1 plots the ratio of observed and predicted SAAR counts (y-axis) for all amino acids (x-axis), comparing the Markov models of different order (bar shading). Whiskers indicate the model standard deviations. As expected, SAAR abundance cannot be explained by the standard model assuming positional independence of amino acids. It is striking, however, that higher order models also do not capture the observed behaviour. Even for relatively short SAARs, significantly more repeats were observed than predicted. While deviations decreased with increasing model order, even at the highest meaningful model order for SAARs of length five, predictions were systematically too low, with over 50% more repeats observed than predicted (p < 10-35). Moreover, prediction performance deteriorated further with increasing SAAR length (Suppl. Fig. S1 in Additional File 1). It therefore seems that this popular model class, which predicts the occurrence of longer features from short local dependency structures, cannot be used to describe SAAR frequencies.

Figure 1.

Figure 1

Open in a new tab

Comparison of Markov models. For each amino acid (x-axis), the bars present the ratios of observed vs predicted counts of repeats with length five. Model standard deviations are indicated by whiskers. Predictions for the standard sequence model of positional independence (a Markov model of order zero) are compared to predictions from higher order models (bar shading), including the highest order model possible for this repeat length. Higher order models yield ratios closer to one, which represents the perfect agreement of observation and prediction.

Non-local models of repeats are apparently required. The parameters of such models have to be learned from multiple sequences, which will differ in amino acid composition and length. We know that both of these affect the expected number of repeats. Protein sequences, however, do not uniformly occupy the corresponding high dimensional parameter space. Moreover, while repeats in general are unexpectedly frequent, they still constitute relatively rare events, with many proteins not containing repeats at all. For investigations of general functional associations of repeats, one wants a model that has balanced positive and negative errors for realistic sets of proteins. To this end, models can directly be tuned for the correct prediction of repeats observed in the tested protein sets. Optimizing average prediction performance for groups of proteins may moreover allow simpler models of satisfactory quality.

In order to allow comparative analyses of SAAR abundance, we introduce and validate a dedicated zero-inflated relevance vector machine model (ZIRVM). First, the probability that a given protein has at least one repeat is assessed. Then, the conditionally expected number of repeats is modelled by an RVM. Figure 2 plots the ratio of observed and predicted counts (y-axis) for repeats of lengths five to ten (x-axis). The horizontal whiskers show the mean values for a selection of amino acids (A, Q, I, and L, as indicated by the legend). The vertical whiskers represent the prediction uncertainty. Comprehensive graphs for all amino acids are provided in Suppl. Fig. S2. The typical deviations from the model prediction were less than 2% across all amino acids and SAAR lengths, with more than 90% of all observations being within 10% of the prediction (dotted horizontal lines). In contrast to the Markov models, which vastly under-predicted the occurrence of longer repeats (Suppl. Fig. S1), the introduced ZIRVM captured the observed dependencies of the repeat frequencies on the repeat length. Similarly, the observed dependencies on the other model parameters - the amino acid composition and the protein length - were traced well by the prediction (Suppl. Fig. S3 and Fig. S4). The complementary Suppl. Figs can be found in Additional File 1. Despite its better performance, strikingly, the combined model is three orders of magnitude less complex than the best performing Markov model. We were therefore also interested in examining an even simpler application specific approach, where a standard polynomial fit replaces the more powerful RVM, giving a zero-inflated polynomial model (ZIPol). Figure 3 compares the three models (bar shading) for each amino acid (x-axis), showing the ratios of observed versus predicted counts of repeats of length five (y-axis). Model standard deviations are indicated by whiskers. Both application-specific models outperformed the Markov model, with the ZIRVM model being the overall winner by a clear margin. In particular, the value of one, representing perfect agreement of prediction and observation, lies within less than one standard deviation of the ZIRVM model prediction for all amino acids.

Figure 2.

Figure 2

Open in a new tab

Model fit quality assessed for the zero-inflated RVM. We plot the ratio of observed and predicted counts (y-axis) for repeats of lengths five to ten (x-axis). The horizontal whiskers represent the mean values for a selection of amino acids (A, Q, I, and L, as indicated by shades of grey). The vertical whiskers indicate uncertainty, showing the model standard deviation. More than 90% of all observations fall within 10% of the prediction (dotted horizontal lines). The dashed horizontal lines represent deviations by 25%. Comprehensive graphs for all amino acids are provided by Suppl. Fig. S2 in Additional File 1.

Figure 3.

Figure 3

Open in a new tab

Comparison of model fit. For each amino acid (x-axis), we compare the three best models (bar shading): a zero-inflated RVM (ZIRVM), a zero-inflated polynomial model (ZIPol), and a third order Markov model (MM). The bars show the ratios of observed and predicted counts for repeats of length five (y-axis). The model standard deviations are indicated by whiskers. The dashed horizontal lines represent deviations by 25%, facilitating comparisons with Fig. 2. The base line at the value of one represents perfect agreement of prediction and observation. It lies within less than one standard deviation of the ZIRVM model prediction for all amino acids.

Similarly when considering, for each amino acid, the mean prediction error (RMSE) for all repeat lengths, both application-specific models did much better than the Markov model (Suppl. Fig. S5A). It is noteworthy that even the simple application-specific ZIPol model easily outperformed the more complex Markov model. Examining predictions for individual amino acids and repeat lengths, statistically significant deviations from the model were observed for 81% and 60% of the Markov and ZIPol predictions, respectively. Both models performed worse in the apparently harder prediction of frequent longer repeats. In contrast, no significant deviations were observed for the ZIRVM model at all (Suppl. Fig. S5B). Consequently, protein sets with typical repeat frequencies can be used as reference sets with the application-specific models. See Additional File 1 for Suppl. Figs.

Use case: SAARs in signal peptides

In order to demonstrate the benefits of a dedicated background model, we apply the introduced application specific model in an analysis of the over-representation of single amino acid repeats in signal peptides. The amino-end of the growing polypeptide chain of secreted and many membrane proteins contains a signal peptide, with a central part rich in hydrophobic amino acids. It has been observed that the location of many SAARs shows a positional bias towards the termini of polypeptides [34,38-40]. Although a possible association of leucine repeats with signal peptides has been suggested earlier [34], there has been no systematic study of repeat enrichment in signal peptides. In particular, a quantitative test is not possible without an appropriate background model to account for the effects of varying amino acid composition and sequence lengths on the observed repeat counts.

We now consider how application specific background models enable quantitative studies, and how the models can adapt to address specific questions, also adjusting to interim results as an analysis progresses. In the first investigation phase of this use case, a ZIRVM background model was trained on a comprehensive set of proteins without signal peptides and signal anchors. This allows an examination of

Hypothesis (1) Mature sequences of secreted and type I membrane proteins do not differ regarding the distribution of repeats from proteins with no signal sequence.

A model of the repeat distribution in proteins without a signal peptide would thus also capture the observed frequencies of repeats in the mature parts of proteins that had that transient peptide cleaved off. If this hypothesis holds - i. e., a common model can be learned from the comprehensive set of proteins with no signal sequences - then we can formulate the central question of the use case as follows:

Hypothesis (2) Signal peptides show an unusual enrichment of certain repeats (relative to a common background distribution).

The 'Null Hypothesis' expectation for the first test was that the ratio of observed and predicted repeat counts in the mature sequences would not be significantly different from the distribution of this ratio for proteins without signal peptides. Although this was indeed the case for longer repeats of the three strongly hydrophobic amino acids F, I, and V, surprisingly, highly significant differences were observed otherwise, affecting more than 80% of all amino acid/repeat length combinations (Suppl. Tab. S2 in Additional File 1). As a result we can strongly reject hypothesis (1).

The observation that the mature parts of secreted and type I membrane proteins have a distinct repeat distribution is actually interesting in its own right. Furthermore, this result changes the kind of related questions that we can ask and how we can test them, highlighting the need to first explicitly validate the (sometimes implicit) underlying assumptions of hypotheses. In particular, we now know that there is no common background distribution, making the original, simple formulation of the second hypothesis void. Background models fitted on proteins without signal peptides are in general not appropriate for examining a potential enrichment of repeats in signal peptides relative to the mature parts of the protein.

Such an analysis becomes possible after adapting the background model. By training on mature sequences of secreted and type I membrane proteins we can test the use case question as

Hypothesis (2b) Signal peptides show an unusual enrichment of certain repeats sequences relative to the mature parts.

Interestingly, a strong, significant over-representation was only found for leucine repeats, but not for any of the other hydrophobic amino acids abundant in signal peptides: Figure 4 plots a measure of the enrichment of repeats in signal peptides. For this we compare the SAAR frequency in the whole protein (including the signal peptide) to the frequency in the mature parts, for repeat lengths from five to ten (x-axis). In order to see results for different amino acids on a comparable scale, we consider ratios of observed SAAR counts versus counts predicted by the background model. If there is no enrichment, these ratios will be one, both for the whole protein and the mature parts. Any deviation for the whole protein indicates indicates over- or under-representation of SAARs in the signal peptide. We therefore plot the difference between the ratios for whole and mature protein in terms of model standard deviations (y-axis), and test for enrichment (p < 5%, as displayed in the graph).

Figure 4.

Figure 4

Open in a new tab

Enrichment of single amino acid repeats in signal peptides. We compare the SAAR frequency in the whole protein (including the signal peptide) to the SAAR frequency in the mature parts. For a standardized display, we consider ratios of observed SAAR counts versus counts predicted by the background model. We plot the difference between these ratios for whole and mature proteins in terms of model standard deviations (y-axis), and test for positive values. For significant enrichment (p < 5%) the p-values are printed next to the symbol. Median data are shown for a selection of hydrophobic amino acids (A, F, I, L, and V, as indicated by symbols) and repeat lengths from five to ten (x-axis).

While the figure examines the hydrophobic residues most frequent in signal peptides (A, F, I, L, and V, as indicated by the legend), we here actually report results for all amino acids (Suppl. Tab. S3 of the Additional File 1). It is noteworthy that in a complete survey of all eukaryotic proteins for SAARs of all amino acids there was no trend for enrichment of repeats in signal peptides other than the reported general significant overrepresentation of leucine repeats. This was unexpected, considering that the also hydrophobic alanine is similarly abundant in the core region of signal peptides and that the related hydrophobic amino acids isoleucine and valine are also frequent there. While it is understood that this hydrophobic region is required for interaction with the signal recognition particle, recent work has uncovered a surprising complexity of signal sequences [41] and suggested additional functions such as in the modulation of protein biogenesis [42]. The unusual enrichment of leucine repeats in signal peptides of eukaryotes may thus serve another purpose, although their exact role yet remains to be investigated by experiments.

Conclusions

Recent developments in sequence analysis have made it increasingly apparent that empirical adjustments or novel application-specific approaches are required to define a suitable baseline for each study. In particular, the identification of biologically relevant differences or shared patterns - against a backdrop of functionally meaningless variation - corresponds to identifying unusual observations relative to an appropriate 'background' model. The quality of the background model directly affects the performance of an analysis. For example, adjustments of statistics for protein amino acid composition have considerably improved existing sequence analysis tools for homology detection [17]. Still, regions of stronger compositional bias are traditionally filtered because they lead to a localised breakdown of the classic background model, making them more difficult to study quantitatively [19,20].

In this manuscript, we have explored the suitability of more complex sequence models and application-specific approaches for the investigation of biased regions, using specific sequence repeats as example. Interestingly, even the most complex local sequence models could not predict the high frequency of the observed repeat regions. In contrast, application-specific zero-inflated models consistently performed better, despite their much lower dimensionality. In particular, we could show that a zero-inflated RVM model (ZIRVM) captured the multi-variate dependencies well. It was also flexible enough for application in different scenarios, adapting to the reference data and question at hand.

These observations are, moreover, of wider relevance: Biased regions are abundant in most organisms. Although not conserved in general, certain biased regions are increasingly implicated in functional roles [21-23]. For traditional sequence similarity based methods of homology detection in the study of protein structure and function, however, biased regions have to be filtered. In contrast, an observed significant enrichment of biased regions in certain protein classes or selected sequence parts can aid functional comparisons at the feature level [43]. We have here chosen to study single amino acid repeats (SAARs), which form a particularly simple class of biased regions. Nevertheless, their high frequency and their potential functions are not fully understood [34]. SAARs have, however, anecdotally been identified as causing a number of diseases [24-26], constituting an important factor in transcriptional regulation [27,28] and protein interaction networks [29], affecting morphological changes [30], and contributing to the facilitation of adaptive processes [31,32].

In our use case for the application specific model, we identified general differences in the repeat distribution between proteins without a signal peptide and the mature parts of proteins remaining after cleavage of these transient regions. Considering this evidence of the heterogeneous nature of protein space, we next focused on proteins with signal peptides, adapting the background model accordingly. Relative to the mature sequences, further investigation identified leucine repeats as highly enriched in eukaryotic signal peptides, in contrast to repeats of any other amino acid. This is remarkable because it sets leucine apart from the remaining hydrophobic residues frequently found in signal peptides. As we have shown in a study of smaller scope elsewhere, these repeats are actually better conserved than their surrounding host sequence, suggesting a yet unknown function [36]. We have shown here that this is unique to leucine and that no other amino acids exhibit a similar trend for significant enrichment in signal peptides.

To summarize, in challenging sequence analysis situations the construction and validation of appropriate background models can become necessary. Using a specific case of studying biased regions as an example, we have shown the breakdown of both the standard sequence model of positional independence and higher-order local predictors. We have then illustrated the usefulness of dedicated, application-specific background models in the detection of biologically interesting signals. Besides highlighting the importance of selecting a suitable background model, our use case also shows how the question examined actually defines what constitutes the 'background', and thus determines an appropriate reference training set.

Methods

Data and feature extraction

Primary sequence data and analysis results were managed in a customized InterMine data warehouse [44,45]. Protein sequences were obtained from UniProt [46] release 15.13. To minimize artefacts, proteins annotated in UniProt as fragments were filtered because they could particularly affect signal peptide prediction, where knowing the start of the protein sequence is important. As SAARs are rare in Bacteria and Archaea [36] we concentrated on eukaryotic proteins, yielding a total of 1.9 million sequences. To facilitate the model fit, we construct a function from the counts of non-overlapping single amino acid tracts. The cumulative distribution of tract counts, in particular, provides an exact measure of repeat abundance while being easier to model than the tract counts themselves as it has a smaller number of jumps. Consequently, this is the function that is being modelled in this paper, and when we report 'repeat counts', we are referring to these cumulative counts. For example, in the sequence ACDFLLLLLGWSLLV there is one non-overlapping leucine tract of length five and one non-overlapping leucine tract of length two. Constructing the cumulative count distribution, for this example sequence, we observe one SAAR of length five (or longer), one SAAR of length four or longer, one of length three or longer and two SAARs of length two or longer. It is these cumulative counts that we report, often dropping the implied 'or longer' in the manuscript text.

SAARs were identified and counted by custom Perl scripts. Feature statistics were computed in the 'R' statistical environment [47]. Considering that frequencies were clearly residue specific, we model repeat frequencies independently for each amino acid.

Traditional sequence models

The challenge of identifying biologically relevant patterns is central to sequence analysis in bioinformatics and, consequently, a variety of complementary tools exist to detect unusual sequence regions. An established generic and powerful class of models captures local dependencies by way of Markov models, as supported, for example, by RSAT [3,48], R'MES [49], QuickScore [50], and SPatt [51]. Different implementations have their own respective strengths and features, including providing a service online with user support, optimized run-time performance, and different statistical approximation options for the assessment of significance. SPatt, in particular, offers statistics that are suitable for a direct comparison to traditional, non-overlapping pattern counts, and was therefore employed for our analyses. SPatt 2.0 was run with default parameters for Gaussian approximations, testing Markov models of orders zero to three. This includes both the highest meaningful model order for patterns of length five as well as the standard model of positional independence, which is a Markov model of order zero (also see Figure 1).

Parameters were obtained from the respective k - tuple frequencies (k = 1 ... 4) of the comprehensive set of non-fragmented eukaryotic proteins from UniProt (about 109 residues). Model complexity thus ranged from 20 parameters for the positional independence model to 204 = 160,000 parameters for the third order Markov model.

Application specific models

For capturing both the exponential scale behaviour of the frequency of the repeats as a function of their lengths, but also the occurrence of proteins with none at all, a zero-inflated model was found to be efficient: First, logistic regression was used to give the probability that a protein of given amino acid composition and length had at least one repeat of a particular residue type and repeat length. Then, a relevance vector machine [52] predicted the conditionally expected number of repeats as a function of repeat length, residue composition, and protein length, each on a logarithmic scale. Here, the logistic regression step in particular captures the considerable number of proteins with zero repeats (hence 'zero-inflated'). All regression and model testing was performed in the 'R' statistical environment. The standard function for fitting a generalized linear model (glm) was used for logistic regression. The relevance vector machine was trained using the rvm function of the established kernlab library [53]. The zero-inflated relevance vector machine (ZIRVM) model had a complexity of 900-2,100 parameters depending on the random starting point of the algorithm and the complexity of the training data set. For the evaluation of a simpler application specific approach, in the second stage, a polynomial model was fitted instead of an RVM,

graphic file with name 1471-2105-12-173-i1.gif

where c is the modelled count of repeats of non-overlapping n amino acids of residue type AA, conditional on the predicted existence of any such repeats in a protein of length l with a given amino acid composition fAA. Coefficients xi were obtained by standard least-squares fit using the nls function. This zero-inflated polynomial (ZIPol) model had a total of 304 parameters.

Model validation

For each protein, amino acid residue, and repeat length, the number of SAARs was recorded, giving a total of about 350 million observations. Besides the repeat length, the application specific models also considered protein length and amino acid frequencies as covariates to the SAAR counts.

For each residue type, a separate predictor was trained in a two step process: First, about three million data points were subsampled for logistic regression. Classification thresholds were empirically chosen to strike an equal balance between positive and negative prediction errors for each repeat length.

For the second modelling step, weighted subsampling was used to correct for the highly skewed nature of the data: Much fewer repeats were observed for higher repeat lengths, or at lower amino acid frequencies. For example, there were 13,675, 4,357, 1,642, 642, 294, and 145 R-repeats of lengths five to ten. Training sets were therefore compiled that balanced the number of observations in bins of defined protein lengths, amino acid composition, and repeat length. The total number of data points subsampled was limited to 2,000 for practical reasons in the RVM training.

Model quality was verified in 100-fold cross-validation, with two thirds of the comprehensive set of non-fragmented eukaryotic proteins used for training, and the remaining third as independent test set. For each repetition, we computed the ratio of observed and predicted repeat counts as a test score. We assess model fit by comparing the distribution of test scores to the perfect score of 1, calculating an empirical p-value. In plots, the standard deviation of this distribution is shown to indicate the prediction model uncertainty. Capturing average performance for each amino acid, we calculate the root mean square error (RMSE) over all repeat lengths. Calculations were performed on a log-scale for symmetrical weighting of over- and underprediction.

For all residue types except tryptophan both ZIRVM and ZIPol models could be fit and verified in 100-fold cross-validation. Longer tryptophan repeats are extremely rare, which makes an independent validation of the model fit difficult.

This validation demonstrates the ability of a model to capture the relevant sequence properties in a comprehensive set of proteins, thus identifying a relevant sequence model for the data examined. With an appropriately chosen reference set, it can serve as a background model.

Use case

To demonstrate the benefits of introducing application specific background models we explored the abundance of repeats in signal peptides.

For a conservative prediction of signal peptides, we combined the neural network and Hidden-Markov-Model predictors of SignalP 3.0 [54,55] applied using their default settings. Predictions were accepted if both methods agreed on the location of the cleavage site, at least one of the prediction scores met its default threshold, and the worse score reached at least half its threshold. Combining both predictors exploits the high sensitivity of the neural network in the detection of signal peptides, while still allowing a discrimination of signal anchors by the Hidden-Markov-Model component [56].

In the first phase of this analysis, a ZIRVM model was trained on the non-fragmented eukaryotic proteins having neither a signal peptide nor a signal anchor. We then studied the ratios of observed vs predicted SAAR counts for the mature sequences of secreted and type I membrane proteins. Deviations from the ZIRVM background model were assessed by empirical p-values computed from the distribution of test scores compiled as before. The reported two-sided test significance of differences for each amino acid is after Holm correction for testing multiple repeat lengths.

For a valid test of repeat enrichment in the signal peptide relative to the mature sequence, in the second phase of the analysis, the mature sequences of secreted and type I membrane proteins were used to train the background model. Testing for enrichment, reported significances are for one-sided tests.

Note that a separate assessment of model fit by cross-validation for the alternative training sets gave similar results to our model comparison on the comprehensive set of proteins (data not shown).

Authors' contributions

PPL implemented and performed all analyses, including the model construction, selection, and validation, and the use-case study. PS supervised the model construction. DPK conceived the study, supervised model selection, validation, and application to the use case. PPL and DPK wrote the manuscript. All authors have read and approve of the final text.

Supplementary Material

Additional file 1

Online Supplement. We provide an online Supplement with further supporting tables and figures, and also linking to the data and analysis code used for this study.

Click here for file (299.3KB, PDF)

Contributor Information

Paweł P Łabaj, Email: Pawel.Labaj@boku.ac.at.

Peter Sykacek, Email: Peter.Sykacek@boku.ac.at.

David P Kreil, Email: bmc2010@kreil.org.

Acknowledgements

The authors gratefully acknowledge support by the Vienna Science and Technology Fund (WWTF), Baxter AG, the Austrian Institute of Technology, and the Austrian Centre of Biopharmaceutical Technology. The authors are grateful to G. Kreil for advice and helpful discussions. PPL also thanks A. Bardet and G. Leparc for helpful discussions.

References

  1. Reinert G, Schbath S, S WM. Probabilistic and Statistical Properties of Words: An Overview. J Comp Biol. 2000;7(1-2):1–46. doi: 10.1089/10665270050081360. [DOI] [PubMed] [Google Scholar]
  2. Xie J, Kim NK. Bayesian Models and Markov Chain Monte Carlo Methods for Protein Motifs with the Secondary Characteristics. J Comp Biol. 2005;12(7):952–970. doi: 10.1089/cmb.2005.12.952. [DOI] [PubMed] [Google Scholar]
  3. Thomas-Chollier M, Sand O, Turatsinze JV, Janky R, Defrance M, Vervisch E, Brohée S, van Helden J. RSAT: regulatory sequence analysis tools. Nucleic Acids Research. 2008;36(suppl 2):W119–W127. doi: 10.1093/nar/gkn304. [DOI] [PMC free article] [PubMed] [Google Scholar]
  4. Pearson WR, Lipman DJ. Improved tools for biological sequence comparison. Proceedings of the National Academy of Sciences of the United States of America. 1988;85(8):2444–2448. doi: 10.1073/pnas.85.8.2444. [DOI] [PMC free article] [PubMed] [Google Scholar]
  5. Altschul SF, Gish W, Miller W, Myers EW, J LD. Basic local alignment search tool. J Mol Biol. 1990;215(3):403–410. doi: 10.1016/S0022-2836(05)80360-2. [DOI] [PubMed] [Google Scholar]
  6. Altschul SF, Madden TL, Schäffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ. Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res. 1997;25(17):3389–402. doi: 10.1093/nar/25.17.3389. [DOI] [PMC free article] [PubMed] [Google Scholar]
  7. Lopez R, Silventoinen V, Robinson S, Kibria A, Gish W. WU-Blast2 server at the European Bioinformatics Institute. Nucleic Acids Res. 2003;31(13):3795–8. doi: 10.1093/nar/gkg573. [DOI] [PMC free article] [PubMed] [Google Scholar]
  8. Thompson J, Higgins D, Gibson T. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res. 1994;22(22):4673–80. doi: 10.1093/nar/22.22.4673. [DOI] [PMC free article] [PubMed] [Google Scholar]
  9. Notredame C, Higgins DG, J H. T-Coffee: A novel method for fast and accurate multiple sequence alignment. Proc Int Conf Intell Syst Mol Biol. 2000;302:205–17. doi: 10.1006/jmbi.2000.4042. [DOI] [PubMed] [Google Scholar]
  10. Birney E, Thompson JD, Gibson TJ. PairWise and SearchWise: finding the optimal alignment in a simultaneous comparison of a protein profile against all DNA translation frames. Nucleic Acids Res. 1996;24(14):2730–9. doi: 10.1093/nar/24.14.2730. [DOI] [PMC free article] [PubMed] [Google Scholar]
  11. Sonnhammer EL, Eddy SR, Durbin R. PFAM: a comprehensive database of protein domain families based on seed alignments. Proteins. 1997;28(3):405–20. doi: 10.1002/(SICI)1097-0134(199707)28:3&#x0003c;405::AID-PROT10&#x0003e;3.0.CO;2-L. [DOI] [PubMed] [Google Scholar]
  12. Pande VS, Grosberg AY, Tanaka T. Nonrandomness in protein sequences: evidence for a physically driven stage of evolution. Proceedings of the National Academy of Sciences of the United States of America. 1994;91(26):12972–12975. doi: 10.1073/pnas.91.26.12972. [DOI] [PMC free article] [PubMed] [Google Scholar]
  13. Weiss O, Jimenez-Montano MA, Herzel H. Information Content of Protein Sequences. Journal of Theoretical Biology. 2000;206(3):379–386. doi: 10.1006/jtbi.2000.2138. [DOI] [PubMed] [Google Scholar]
  14. Henikoff S, Henikoff JG. Amino acid substitution matrices from protein blocks. Proceedings of the National Academy of Sciences of the United States of America. 1992;89(22):10915–10919. doi: 10.1073/pnas.89.22.10915. [DOI] [PMC free article] [PubMed] [Google Scholar]
  15. Chechetkin VR. Block structure and stability of the genetic code. Journal of Theoretical Biology. 2003;222(2):177–188. doi: 10.1016/S0022-5193(03)00025-0. [DOI] [PubMed] [Google Scholar]
  16. Ptitsyn OB, Volkenstein MV. Protein structure and neutral theory of evolution. J Biomol Struct Dyn. 1986. pp. 137–56. [DOI] [PubMed]
  17. Altschul SF, Wootton JC, Gertz EM, Agarwala R, Morgulis A, Schäffer AA, Yu YK. Protein database searches using compositionally adjusted substitution matrices. FEBS J. 2005;272(20):5101–9. doi: 10.1111/j.1742-4658.2005.04945.x. [DOI] [PMC free article] [PubMed] [Google Scholar]
  18. Sadreyev RI, Grishin NV. Accurate statistical model of comparison between multiple sequence alignments. Nucl Acids Res. 2008;36(7):2240–2248. doi: 10.1093/nar/gkn065. [DOI] [PMC free article] [PubMed] [Google Scholar]
  19. Wootton J Federhen S Statistics of local complexity in amino-acid-sequences and sequence databas Computers & chemistry 1993172149–163.21598156 [Google Scholar]
  20. Promponas VJ, Enright AJ, Tsoka S, Kreil DP, Leroy C, Hamodrakas S, Sander C, Ouzounis CA. Cast: an iterative algorithm for the complexity analysis of sequence tracts. Bioinformatics. 2000;16(10):915–22. doi: 10.1093/bioinformatics/16.10.915. [DOI] [PubMed] [Google Scholar]
  21. Marcotte EM, Pellegrini M, Yeates TO, Eisenberg D. A census of protein repeats. J Mol Biol. 1999;293:151–60. doi: 10.1006/jmbi.1999.3136. [DOI] [PubMed] [Google Scholar]
  22. Kreil DP, Ouzounis CA. Comparison of sequence masking algorithms and the detection of biased protein sequence regions. Bioinformatics. 2003;19(13):1672–81. doi: 10.1093/bioinformatics/btg212. [DOI] [PubMed] [Google Scholar]
  23. Kuznetsov IB, Hwang S. A novel sensitive method for the detection of user-defined compositional bias in biological sequences. Bioinformatics. 2006;22(9):1055–1063. doi: 10.1093/bioinformatics/btl049. [DOI] [PubMed] [Google Scholar]
  24. Delot E, King LM, Briggs MD, Wilcox WR, Cohn DH. Trinucleotide expansion mutations in the cartilage oligomeric matrix protein (COMP) gene. Hum Mol Genet. 1999;8:123–8. doi: 10.1093/hmg/8.1.123. [DOI] [PubMed] [Google Scholar]
  25. Siwach P, Ganesh S. Tandem repeats in human disorders: mechanisms and evolution. Front Biosci. 2008;13:4467–84. doi: 10.2741/3017. [DOI] [PubMed] [Google Scholar]
  26. Hands S, Sinadinos C, Wyttenbach A. Polyglutamine gene function and dysfunction in the ageing brain. Biochim Biophys Acta. 2008;1779(8):507–21. doi: 10.1016/j.bbagrm.2008.05.008. [DOI] [PubMed] [Google Scholar]
  27. Gerber H, Seipel K, Georgiev O, Hofferer M, Hug M, Rusconi S, Schaffner W. Transcriptional activation modulated by homopolymeric glutamine and proline stretches. Science. 1994;263(5148):808–811. doi: 10.1126/science.8303297. [DOI] [PubMed] [Google Scholar]
  28. Brown L, Paraso M, Arkell R, Brown S. In vitro analysis of partial loss-of-function ZIC2 mutations in holoprosencephaly: alanine tract expansion modulates DNA binding and transactivation. Hum Mol Genet. 2005;14(3):411–420. doi: 10.1093/hmg/ddi037. [DOI] [PubMed] [Google Scholar]
  29. Hancock JM, Simon M. Simple sequence repeats in proteins and their significance for network evolution. Gene. 2005;345:113–118. doi: 10.1016/j.gene.2004.11.023. [DOI] [PubMed] [Google Scholar]
  30. Fondon JW, Garner HR. Molecular origins of rapid and continuous morphological evolution. Proceedings of the National Academy of Sciences of the United States of America. 2004;101(52):18058–18063. doi: 10.1073/pnas.0408118101. [DOI] [PMC free article] [PubMed] [Google Scholar]
  31. Caburet S, Cocquet J, Vaiman D, A VR. Coding repeats and evolutionary 'agility'. BioEssays. 2005;27(6):581–587. doi: 10.1002/bies.20248. [DOI] [PubMed] [Google Scholar]
  32. Kashi Y, King DG. Simple sequence repeats as advantageous mutators in evolution. Trends Genet. 2006;22(5):253–9. doi: 10.1016/j.tig.2006.03.005. [DOI] [PubMed] [Google Scholar]
  33. Mar Alba M, Santibanez-Koref MF, Hancock JM. Amino acid reiterations in yeast are overrepresented in particular classes of proteins and show evidence of a slippage-like mutational process. J Mol Evol. 1999;49(6):789–97. doi: 10.1007/PL00006601. [DOI] [PubMed] [Google Scholar]
  34. Karlin S, Brocchieri L, Bergman A, Mrazek J, Gentles AJ. Amino acid runs in eukaryotic proteomes and disease associations. Proc Natl Acad Sci USA. 2002;99:333–8. doi: 10.1073/pnas.012608599. [DOI] [PMC free article] [PubMed] [Google Scholar]
  35. Depledge DP, Dalby AR. Copasaar-a database for proteomic analysis of single amino acid repeats. BMC Bioinformatics. 2005;6:196. doi: 10.1186/1471-2105-6-196. [DOI] [PMC free article] [PubMed] [Google Scholar]
  36. Łabaj PP, Leparc GG, Bardet AF, Kreil G, Kreil DP. Single amino acid repeats in signal peptides. FEBS Journal. 2010;277(15):3147–3157. doi: 10.1111/j.1742-4658.2010.07720.x. [DOI] [PubMed] [Google Scholar]
  37. Karlin S. Statistical significance of sequence patterns in proteins. Curr Opin Struct Biol. 1995;5(3):360–71. doi: 10.1016/0959-440X(95)80098-0. [DOI] [PubMed] [Google Scholar]
  38. Zhang L, Yu S, Cao Y, Wang J, Zuo K, Qin J, Tang K. Distributional gradient of amino acid repeats in plant proteins. Genome. 2006;49(8):900–5. doi: 10.1139/G06-054. [DOI] [PubMed] [Google Scholar]
  39. Huntley MA, Clark AG. Evolutionary analysis of amino acid repeats across the genomes of 12 Drosophila species. Mol Biol Evol. 2007;24(12):2598–609. doi: 10.1093/molbev/msm129. [DOI] [PubMed] [Google Scholar]
  40. Siwach P, Sengupta S, Parihar R, Ganesh S. Spatial positions of homopolymeric repeats in the human proteome and their effect on cellular toxicity. Biochem Biophys Res Commun. 2009;380(2):382–6. doi: 10.1016/j.bbrc.2009.01.101. [DOI] [PubMed] [Google Scholar]
  41. Hegde RS, Bernstein HD. The surprising complexity of signal sequences. Trends Biochem Sci. 2006;31(10):563–71. doi: 10.1016/j.tibs.2006.08.004. [DOI] [PubMed] [Google Scholar]
  42. Gouridis G, Karamanou S, Gelis I, Kalodimos CG, Economou A. Signal peptides are allosteric activators of the protein translocase. Nature. 2009;462:363–367. doi: 10.1038/nature08559. [DOI] [PMC free article] [PubMed] [Google Scholar]
  43. Koestler T, von Haeseler A, Ebersberger I. FACT: Functional annotation transfer between proteins with similar feature architectures. BMC Bioinformatics. 2010;11:417. doi: 10.1186/1471-2105-11-417. [DOI] [PMC free article] [PubMed] [Google Scholar]
  44. Lyne R, Smith R, Rutherford K, Wakeling M, Varley A, Guillier F, Janssens H, Ji W, Mclaren P, North P, Rana D, Riley T, Sullivan J, Watkins X, Woodbridge M, Lilley K, Russell S, Ashburner M, Mizuguchi K, Micklem G. FlyMine: an integrated database for Drosophila and Anopheles genomics. Genome Biology. 2007;8(7):R129. doi: 10.1186/gb-2007-8-7-r129. [DOI] [PMC free article] [PubMed] [Google Scholar]
  45. InterMine home page. http://www.intermine.org/
  46. The UniProt Consortium. The universal protein resource (UniProt) Nucleic Acids Res. 2008. pp. D190–195. [DOI] [PMC free article] [PubMed]
  47. The R Project home page. http://www.r-project.org/
  48. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. Journal of Molecular Biology. 1998;281(5):827–842. doi: 10.1006/jmbi.1998.1947. [DOI] [PubMed] [Google Scholar]
  49. Hoebeke M Schbath S R'MES: Finding Exceptional Motifs, version 3. User guide 2006http://migale.jouy.inra.fr/outils/mig/rmes21598443
  50. The QuickScore home page. http://algo.inria.fr/dolley/QuickScore/
  51. Nuel G. Numerical Solutions for Patterns Statistics on Markov Chains. Statistical Applications in Genetics and Molecular Biology. 2006;5:26. doi: 10.2202/1544-6115.1219. [DOI] [PubMed] [Google Scholar]
  52. Tipping M. The Relevance Vector Machine. Advances in neural information processing systems. 2000;12:652–658. [Google Scholar]
  53. Tipping M. Sparse Bayesian learning and the relevance vector machine. Journal of Machine Learning Research 1. 2001. pp. 211–244.
  54. Nielsen H, Engelbrecht J, Brunak S, von Heijne G. Identification of prokaryotic and eukaryotic signal peptides and prediction of their cleavage sites. Protein Eng. 1997;10:1–6. doi: 10.1093/protein/10.1.1. [DOI] [PubMed] [Google Scholar]
  55. Bendtsen JD, Nielsen H, von Heijne G, Brunak S. Improved prediction of signal peptides: SignalP 3.0. J Mol Biol. 2004;340(4):783–95. doi: 10.1016/j.jmb.2004.05.028. [DOI] [PubMed] [Google Scholar]
  56. Nielsen H, Krogh A. Prediction of signal peptides and signal anchors by a hidden Markov model. Proc Int Conf Intell Syst Mol Biol. 1998;6:122–30. [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Additional file 1

Online Supplement. We provide an online Supplement with further supporting tables and figures, and also linking to the data and analysis code used for this study.

Click here for file (299.3KB, PDF)

Articles from BMC Bioinformatics are provided here courtesy of BMC

RESOURCES