- Research article
- Open Access
Self-analysis of repeat proteins reveals evolutionarily conserved patterns
BMC Bioinformatics volume 21, Article number: 179 (2020)
Protein repeats can confound sequence analyses because the repetitiveness of their amino acid sequences lead to difficulties in identifying whether similar repeats are due to convergent or divergent evolution. We noted that the patterns derived from traditional “dot plot” protein sequence self-similarity analysis tended to be conserved in sets of related repeat proteins and this conservation could be quantitated using a Jaccard metric.
Comparison of these dot plots obviated the issues due to sequence similarity for analysis of repeat proteins. A high Jaccard similarity score was suggestive of a conserved relationship between closely related repeat proteins. The dot plot patterns decayed quickly in the absence of selective pressure with an expected loss of 50% of Jaccard similarity due to a loss of 8.2% sequence identity. To perform method testing, we assembled a standard set of 79 repeat proteins representing all the subgroups in RepeatsDB. Comparison of known repeat and non-repeat proteins from the PDB suggested that the information content in dot plots could be used to identify repeat proteins from pure sequence with no requirement for structural information. Analysis of the UniRef90 database suggested that 16.9% of all known proteins could be classified as repeat proteins. These 13.3 million putative repeat protein chains were clustered and a significant amount (82.9%) of clusters containing between 5 and 200 members were of a single functional type.
Dot plot analysis of repeat proteins attempts to obviate issues that arise due to the sequence degeneracy of repeat proteins. These results show that this kind of analysis can efficiently be applied to analyze repeat proteins on a large scale.
The relationship between protein sequences and structures has long been a widely accepted tenet of biochemistry . However this is not without noted exceptions as proteins that share high sequence identity typically have nearly identical structures, whereas proteins of similar structures are not required to share any sequence identity . Similarly, while evolutionarily conserved structures are typically associated with evolutionarily conserved protein sequences, conserved sequences themselves are not obliged to maintain a structure  as many intrinsically disordered regions in proteins maintain evolutionarily conserved sequences with sequence entropies  that are high enough to be statistically indistinguishable from those of structured regions . On the other hand, there are also regions of low-entropy/low complexity sequence regions (LCR) in which stretches of sequence are dominated by clumps of one or a few amino acid types which can be structured or unstructured [6, 7]. Rounding out all these exceptions to the sequence/structure rule are protein repeat (PR) domains which are comprised of 3–25 sets of 20–40 residue long sections of repeated sequence  which can be either structured  or unstructured .
Despite this apparent sequence simplicity, repeat proteins are broadly distributed across the tree of life and participate in a wide range of functional roles including but not limited to virulence , organelle regulation , nucleotide binding , antiviral response  and signal transduction . Estimates suggest that up to 25% of all proteins contain some kind of protein repeat [16, 17]. And although repeat proteins are more common in eukaryotes than prokaryotes , a survey found that 81% of archaeal and 96% of bacterial taxa contained at least one tetratricopeptide repeat (TPR) protein, and 81% of archaeal and 78% of bacterial taxa contained at least one Armadillo repeat (ARM) domain containing protein within their genomes , although functional differences identified between eukaryotic and prokaryotic repeat proteins have suggested that they may have had separate evolutionary origins [17, 18].
Sequence-based analysis of repeat proteins is particularly difficult and the repetitive, highly degenerate sequences found in repeat proteins can and do frustrate standard bioinformatics analyses . For example, the two-helix TPR repeat, widely dispersed in both prokaryotes and eukaryotes , was originally defined by a conserved 34 amino acid motif tetratricopeptide repeat (TPR)  although later analysis demonstrated that these repeats are comprised of a convergent pattern of large and small hydrophobic amino acids  and examples of TPR proteins with up to 42 amino acid repeats have been identified . Furthermore, a recent re-analysis of a set of proteins that had been positively identified as three-helix armadillo (ARM) repeat-containing proteins showed that 25 out of 95 of the examined proteins actually contained two-helix HEAT repeats  possibly due to a shared evolutionary origin . Even when they can be correctly identified, repeats do not necessarily occur in integer numbers nor must repeat length always be consistent [26,27,28]. This also confounds repeat identification techniques as a recent survey found very low (0.2%) consensus identification between four established methods . Even the rate of sequence change in repeat proteins is controversial as it was found that 61% of repeats in humans were conserved to at least the base of mammals  while others were found to be highly variable [10, 11, 27, 30]. In general, sequence-based rule sets for repeats have been difficult to apply universally. Fortunately, repeat proteins of known structure have been collected into RepeatsDB  which is subdivided into 5 structural groups with 23 subgroups based on the length of the repeating unit . However, the fact that the vast majority of repeat proteins do not have experimentally determined structures, combined with their highly degenerate sequences makes it difficult to differentiate evolutionary convergence from common ancestry .
While it is difficult to compare different repeat proteins, repeats within a single protein necessarily have an analyzable informational relationship between themselves (i.e. it is tautological that a repeat is similar to its sibling repeats). We endeavored to find a method to analyze these informational relationships. After examining several methods we decided to focus on the repeat-detecting, self-comparison program DOTTER  (Fig. 1) when we noticed that the dot plots produced were highly similar in related proteins despite millions of years of species divergence and fairly low global sequence similarity. This similarity likely takes into account both the functional and physical constraints on the protein as well as an inertial drag on sequence divergence between related species. DOTTER analysis of repeat proteins provides a fast method of clustering repeat proteins by taking advantage of the extra complexity of sparse 2D matrices over linear sequences. This method is robust to sequence degeneracy and does not require access to experimental structural information. Because these dot plots are readily analyzable by modern computers using a simple Jaccard metric (i.e. the intersection over union), we were able to analyze and cluster the galaxy of known protein sequences within the UniRef90 database .
Complex patterns of repeats exist in repeat proteins and are fairly common
The dot plots produced by DOTTER reveal complex patterns that can be used to compare repeat proteins much like traditional sequence alignment methods while also reducing the effect of sequence repetition . Analysis of repeat protein amino acid sequences (Fig. 1) using DOTTER  readily revealed visually identifiable patterns for the proteins (Fig. 2 & SI Figs. 1, SI Table 1). Human observation noted that pairs of dot plots with a Jaccard similarity score (JX ≥ 0.5; JX is the ratio of the number of matching black pixels in both dot plots to the total number of black pixels) were typically quite difficult to distinguish and pattern similarities were usually detectable by human observers at JX ≥ 0.1. Furthermore, known repeat containing proteins had more information rich dot plots on average than randomly selected proteins. Proteins within the RepeatsDB set had a mean of 272 pixels per protein chain (median 119 pixels/chain, mean length = 345 residues/chain, mean 0.66 ± 1.0 pixels/residue), where pixels were simply the black points within the dot plots corresponding to the comparison of a specific pair of amino acids related by the dot plot indices. This set of known repeat proteins had significantly more signal information in their dot plots than two control sets (“bacillus” and “mouse” generated by searching the PDB for both of these keyword terms) (Table 1, SI Fig. 2). Within the RepeatsDB set, 71.8% of proteins had more than 0.14 pixels/residue, with artificially designed repeat proteins (identified by searching within RepeatsDB for the term “design”) tending to have more pixel information than natural ones on average (SI Fig. 2d). Because the DOTTER-produced dot plots lack the explicit degeneracy that confounds traditional sequence comparisons and pairwise comparison of the plots was rapid and efficient it allowed us to analyze the entirety of the UniRef90 database . To compensate for differences in protein sizes, we introduced a “sliding” method in which the start of the smaller protein was positioned along every possible point that gave any overlap along the self-identity diagonal of the larger protein (Fig. 1). The highest JX score was considered the optimal positioning. We identified 13.3 million (16.9%) protein chains (out of 78.9 million) with an information content of at least 0.42 pixels/residue. The 0.42 pixels/residue cutoff was chosen based on a comparison of the RepeatsDB set and the control “mouse” and “bacillus” sets (see Table 1, SI Fig. 2). This is within the range previously reported for previous estimates of the prevalence of repeat-containing proteins [16, 17]. Likewise, we reasonably find that 5.5% of proteins in the set contain one or more LCR regions when a minimum length = 20 filter is applied (and 23.3% for a minimum length = 6 filter) .
Conservation of dot plot patterns in related proteins
The patterns present in the dot plots of repeat proteins were maintained longer than should have been expected as compared to randomly changing sequences, suggesting that there is some pressure to maintain these patterns. In order to investigate how the dot plots were affected by changes in sequence, we estimated the rate of information decay by subjecting a set of 79 chains (the standard set, see Methods, SI Table 2) to random in silico mutations (Fig. 3, SI Fig. 3) using BLOSUM62 . These 79 proteins (at least two from each of the RepeatsDB subcategories) were used as a standard test set throughout this work. Here, the standard set proteins were mutated in silico and the dot plots were calculated for the mutants to compare to the original protein, producing a decay curve for JX values. The resulting curves were fit to a simple exponential decay equation (JX = e-bz) where z indicates the per cent identity difference between the mutant and initial proteins. Random mutation usually resulted in a 50% reduction in JX after an 8.2 ± 1.1% loss of sequence identity demonstrating that the patterns decay rapidly in the absence of selective pressures (8.5 ± 0.5 when calculated only from the chains (N = 64) with good R2 values for the decay experiment, SI Table 1). It should be noted that both these decay constants are within each other’s standard error ranges. In most (19 of 22, 86%) of the subgroups taken directly from RepeatsDB at least 2 out of 3 proteins (SI Table 1) tested exhibited single exponential decay as judged by an R2 ≥ 0.98 for the fit, and in 12 of the 22 subgroups (55%) all of the protein chains did so (SI Table 2). Since JX values seemed to be conserved better than sequence identity (decay half-life < 10% seq id), we hypothesized that it might be employed as a more robust method to detect evolutionary relationships than approaches that rely solely on sequence alignments.
Because the decay had a “half-life” of less than 10% sequence identity, we examined how well this method could detect commonalities in related proteins and compared it to standard phylogeny using MrBayes . We chose 12 proteins from the standard set to attempt to identify conserved, consensus dot plot patterns that might be conserved among each set of these related proteins. Illustrative examples for 4 sets of closely related proteins are given in Fig. 2 (comparisons of phylogenic and dot plot analysis for all 12 sets are given in SI Fig. 1). Consensus dot plot patterns were identified for 10 of these 12 (83% success rate). We also used the standard set of 79 proteins (see Methods) to examine the effects of insertions on decay of the Jaccard score by randomly inserting amino acids into a protein sequence. Random insertions had a more debilitating effect on the dot plot conservation, with half of JX being lost on average after a 0.96% ± 0.37% insertion rate.
Relationship between sequence and dot plot conservation
We sought to investigate if the relationships between different dot plots were entirely due to sequence similarity. To do so the pairwise sequence identities for all the members of the full RepeatsDB  set were calculated and compared with their Jaccard distances (JD) (SI Fig. 4). This comparison showed two features, a main peak around 10–20% sequence identity comprising most of the pairwise comparisons between the proteins and a smaller one above 90% sequence identity which was highly enriched in streptavidin chains (N = 387) that have low information content plots (almost no positive pixels) but do make up a sizable portion (6%) of the total number of chains in the dataset. Additionally, the set of 79 standard proteins when mutated using a replacement matrix (see Methods) showed remarkable maintenance of the dot plot structures and JX values (Fig. 4, SI Fig. 5). Despite essentially no sequence identity between the protein and its mutated variant the dot plot patterns were often quite similar (as high as JX = 0.88 for GalNAc/Gal-specific lectin, see PDB ID 5f8w chain A in SI Fig. 5). In fact, 71 of the 79 (89.8%) test proteins had a JX ≥ 0.1 (our estimate for minimum JX that could be recognized by human observers) and 20 out of 79 (25.3%) had JX ≥ 0.5, the point at which it is typically difficult for human observers to distinguish two proteins, despite the two proteins having essentially no sequence identity in all cases.
Analysis of large data sets with DOTTER
We sought to determine how efficiently we could analyze large protein data sets with our method. First, we utilized the RepeatsDB database  to produce a general analysis of known repeat proteins (SI Dendrogram). Generation of the DOTTER dot plots for the set of ~ 6000 protein chains obtained from RepeatsDB in batch mode required only a few minutes on a modern LINUX desktop computer. The protein chains from RepeatsDB were analyzed using pairwise distances (1 –JX = JD) and then hierarchically clustered and the resulting clusters were scored based on how well they replicated the known sequence identity and structural subgroups defined in RepeatsDB. The clusters from the dendrogram were examined manually with special attention paid to clusters with a high average number of pixels per member (SI Table 3). We chose to examine the clustering generated by the McQuitty method in R because it gave the largest number of total clusters at a reasonable cut-off level and the clusters were the most homogenous with the sequence identity groupings and structural classifications used by RepeatsDB itself (SI Table 3, SI Dendrogram). We were unable to identify any correlation between these clusters and the structural groups as defined by RepeatsDB beyond what would be expected from sequence conservation. But, while most of the resulting groups were immediately obvious upon inspection, manual examination did find an intriguing clustering of the highly immunogenic OspA protein from the spiroform bacterium B. burgdorferi, the causative agent of Lyme disease  and the LIC proteins of unknown function from the pathogenic spiroform Leptospira bacteria  which cluster together despite not having significant group median sequence identity (42%). This relationship was also robust, occurring with several methods other than the reported McQuitty method (SI Table 3). We are unaware of this relationship having being noted elsewhere despite the not insignificant sequence identity these families share, although sequence similarity does not correlate well with the distance of evolutionary relationships in repeat proteins.
Second, we applied the method to a large data set, namely the UniRef90 database which contains all known protein sequences at 90% sequence identity. This set was analyzed with DOTTER and HipMCL  was used to cluster all sequences that had corresponding dot plots with at least 0.42 pixels/residue of information. This gave 23050 clusters of which 10205 had at least 5 members. We arbitrarily classed clusters with 4 or fewer members as singletons. Manual examination of those clusters which had between 5 and 200 members (n = 8569) found that only 538 of the clusters were not comprised of a single functional type as judged by UniProt protein names while 925 clusters were made up of entirely or essentially entirely “uncharacterized” or “hypothetical” proteins. 7104 clusters (82.9%) were easily human identifiable as a single functional type (or 8031 (93.7%) if “uncharacterized” proteins are included as a functional group) (SI Fig. 6). The number of multi-function clusters increases sharply at the lowest 5% of median sequence similarity clusters (SI Fig. 7). Analysis of these 8559 clusters from UniRef90 revealed that they had between 31.8–99.9% median pairwise sequence similarity within a cluster as calculated by a global alignment in BioPython (BLOSUM62, gap opening = − 11, gap extension = − 1)  (SI Fig. 7). Calculation of the pairwise sequence similarity for 10 of the clusters failed due to either long sequence length or a high number of non-standard amino acids. The distance relationships for the set of clusters with 5 or more members were visualized by CLANS  (Fig. 5). Attempts at finding superclusters of related proteins from this CLANS representation were not particularly successful, however the clusters in which the greatest proportion of their members contained LCR did seem to group in one small region of the plot. A list of the proteins contained in the clusters is included in the supplemental material.
In this study we sought to establish a basic groundwork for the analysis of the informational relationships present in repeat proteins using DOTTER. We are not the first to use self-comparison methods like DOTTER to analyze repeats in individual proteins [40,41,42]. However we differ from these previous attempts in that we noted the conservation of the patterns within these self-comparisons. This implies that the informational relationships present in the repeats, which can be quite complex (Fig. 2), is more analogous to the “fold” of a protein  than it is to a matched set of sequence motifs, likely due to the extra information present in the sparse 2D matrix generated by DOTTER. That is, like protein structure, these patterns can robustly accommodate numerous sequences, although random changes without consideration to the informational relationships can be quickly detrimental to pattern conservation (Fig. 3). This is not without precedent as a study of 28980 protein chains in 506 SCOP folds found that the relationship between sequence and structure was ambiguous and that structural motifs should not be correlated with particular sequences . Upon recognizing this, we utilized a simple model (Jaccard) to estimate the evolutionary distance between pairs of proteins accounting for size differences with a straightforward sliding method to find optimized overlaps and attempt to compensate for insertions and deletions. By optimizing the efficiency of these calculations we were able to identify all the likely repeat proteins in the known protein universe (UniRef90) and cluster them into a relatively small number of clusters requiring about 3.2 × 105 CPU hours (Fig. 5). While other investigators have used self-comparison methods like we did, more recent efforts tend to favor sequence statistical analysis approaches [44,45,46,47]. This preference may be partially due to historical attempts to define repeats by the length of the repeating sequence. The identification of 34 residue long TPR , the 35 residue long PPR , and the 38 residue long OPR  two helix repeats as well as the identification of 42 residue long TPR repeats  fit this historical tendency. Our method obviates this issue by being agnostic to repeat length (as do others ) as it can readily analyze short LCR type repetitions (Fig. 5) as well as the longer domain length repeats such as those in RepeatsDB  class 5 (Fig. 2). Furthermore, our model calculations show that simple mutation of less than 10% of a protein sequence or insertion of an additional 1% of the protein sequence will reduce the JX score of a protein and such a mutant by 50%. It intrigues us that related proteins which have undergone much greater changes than this often maintain more significantly similar dot plot patterns suggesting that these patterns are reporting on the parts of the protein which are under evolutionary pressure to be maintained.
The efficiency of this method then allowed an attempted analysis of several other aspects of the behavior of repeat proteins. While our estimate of the frequency of repeat proteins in the UniRef90 database is within the previously identified ranges [16, 17], we use a simple information content metric (0.42 pixels/residue) based on structures available in the PDB to make this determination which can easily be adjusted to change the prevalence should a reliable consensus frequency emerge. We were also able to analyze LCR in proteins as well as longer “full” repeats. Significant conservation in amino acid tandem repeats (a type of LCR) was observed in a set 3094 human/mouse protein pairs in agreement with our observation that LCR are largely localized to one region in our clustering of the repeat proteins (Fig. 5) . Perhaps the most intriguing though is the potential to detect possible relationships between repeat proteins that may be obscured by the apparent simplicity of both the sequence and structure of many repeat proteins. For example, all the robust clustering of the OspA protein from B. burgdorferi  and the LIC proteins of unknown function from Leptospira . But this possible relationship is still experimentally unconfirmed.
The amino acid sequences of repeat proteins maintain an unusual sort of sequence conservation in which there appears to be both maintenance over a long evolutionary period [19, 27] while also being much more forgiving of amino acid substitutions than standard proteins . The interesting question then concerns what kind of information is actually being conserved in repeat proteins and how can this be identified? By recognizing the tautological fact that protein repeats must repeat another part of the protein and mapping the resulting network of relations we can begin to understand what parts of the protein architecture are structurally or functionally important and therefore must be robust to stochastic sequence drift. Identification of these patterns can help to cluster related repeat proteins, discover parts of the protein that are essential for structure and function, and identify relationships between repeat proteins that may be remarkably difficult to analyze by purely sequence-based analysis .
Identifying the conservation of these informational relationships is of course the beginning of a line of inquiry and much work and many questions remain unresolved. The most obvious is that we have employed a rather simple sliding method to optimize the apparent matching between two proteins of different sizes (i.e. insertions and deletions). This does not account for large internal insertions which may split the pattern in half, nor for smaller insertions or deletions which would change the spacing between equivalent lines and are likely to efficiently reduce JX scores (Fig. 1). Likely an efficient method to divide the patterns into smaller units would improve our analysis. In addition, improvements to cluster analysis are needed. While we were able to efficiently find clusters that contained proteins of a single function (using slow, manual analysis), finding crowded areas comprised of a large number of clusters containing thousands of proteins was frustratingly ineffective as proximal clumps of several clusters in the CLANS plot (Fig. 5) only sometimes seemed to be enriched in single functionalities. Likewise, the clustering of LCR enriched clusters (Fig. 5) may either indicate an actual commonality or be simply a mathematical artifact of the methodology. Additionally, we did not discover any correlation between protein structure and clustering of repeats that would not be obvious from a direct comparison of sequence identity conservation (SI Dendrogram). Furthermore, our basic assumption that “protein repeats must repeat” may not always hold. For example, proteins with a single copy of a repeating unit within a chain would be missed by our method (e.g. a single copy of an ancient β-propeller) [22, 53]. We also do not know exactly what factors give rise to these informational networks or why they are conserved, but we expect that all of the possible explanations (structural or functional constraints, sequence inertia in recently diverged proteins, etc.) may occur singly or in combination in some sub-set of repeat proteins. And we are aware that these patterns can change with a frustrating arbitrariness; the pattern in the RCC proteins is maintained among the eukaryotic lineage despite a low sequence conservation, while there appears to be a different pattern for the sauropsid and synapsid vertebrate lineages for fibrinogen (SI Fig. 1Q, R). And lastly, many of the repeat clusters are comprised of membrane rather than repeat proteins, although the similarity between these two general classes of protein has been noted before [16, 54]. This may indicate a deficiency in our method or it may indicate a shared set of physical constraints in membrane and repeat proteins due to the hydrophobicity of membranes and protein interiors. The question of a commonality between these kinds of proteins is clearly beyond the scope of this manuscript.
Selective pressure on proteins is often quite intense and the recognition of what properties emerge from this pressure often goes a long way to understanding the behavior and function of a protein. Using these simple comparisons we were able to quickly analyze the entirety of known protein sequences in UniRef90 and generate clusters of which 93.7% were clusters of a single or uncharacterized function. These patterns can be quite robust to sequence changes as many of these functional clusters had as low as 31.8% median sequence similarity within the cluster. We were also able to maintain good facsimiles (JX = 0.88) of the dot plot patterns with artificially generated non-identity mutants although random in silico mutation usually lead to a 50% reduction in JX after an 8.2% loss of sequence identity. The recognition of the conservation of the informational relationship between repeats within a protein should help to further study, understand, and design repeat and LCR proteins.
Unless otherwise noted, calculations were performed with custom code written in R, FORTRAN, Python, or C++. A software container for the sliding pipeline is available for download by non-commercial users at https://gorna.uw.edu.pl/en/research/software.
Description of the sliding method
Sequences in FASTA format were subjected to self-analysis by DOTTER  in batch mode with a zoom level of 1 with black and white point values of 30 and 31 respectively, to generate .pdf and .ascii files. Scores of 31 or greater therefore defined the pixels in the dot plots. Dot plots were converted into binary format at the black/white level and pairs of plots were compared by calculating a Jaccard index (JX). The method reflects a procedure (Fig. 1) during which dot plots are aligned with respect to their main diagonal and shifted along it to compensate for differences in sizes between the two proteins, including size differences due to insertions and deletions, producing a Jaccard index for every shift. The highest value from the sequence was stored as a result and used in the next step and the maximal JX obtained was taken to be the closest relationship between the two sequences. During the analyses, the diagonal was ignored as it represents the trivial self-matches. Scanning the indices of each residue in the dot plots allowed the deconvolution of the plots back into repeats (Fig. 1).
A set of 79 repeat-containing proteins was generated from RepeatsDB 2.0  with at least 3 sequences that differed from each other at the 40% ID level for each repeat subgroup seeded with a few additional sequences of interest, each with > 100 residues length (average length = 423); however only two sets were available from RepeatsDB subgroup 4–7 and none from RepeatsDB subgroup 2–1. For each sequence, a dot plot was generated for the initial sequence. One residue was chosen at random and mutated according to probabilities based on BLOSUM62 and a dot plot was generated for the mutant sequence. JX was then calculated to compare the mutant and the initial sequences. This was repeated until the sequence had been subjected to n rounds of mutation, where n was the length of the sequence. The entire process from the initial sequence was repeated 1000 more times and the average JX and average sequence identity was calculated at each step. In order to investigate the influence of insertions on the value of JX, the following procedure was applied using the standard set of 79 protein sequences. For each sequence, amino-acid insertions were gradually introduced up to a number equal to 20% of its length. At every step the Jaccard index was computed and stored. The entire procedure was repeated 100 times.
Effect of sequence mutation on dot plot patterns (SI Fig. 5)
To test whether analogous sequences showing little similarity can at the same time yield similar dot plots, we used the amino-acid alphabet “shuffling” procedure. For each of the test set sequences, we generated an artificial analogous counterpart using a replacement matrix defining how the amino-acid alphabet will be changed. Such a matrix can be seen as a dictionary in which each amino-acid type (key) is unambiguously associated with another amino-acid (value) to which it will be replaced. The replacement matrix was independently optimized for each test sequence to generate the analogous counterpart with possibly low similarity to the original sequence. The optimization procedure involved the following steps: (i) Generation of a random 20-element replacement dictionary VA (ii) “Mutation” of the replacement dictionary VA into VM by exchanging two randomly selected keys. (iii) Transformation of the input sequence SA into a mutated sequence SM using the substitution dictionary VM. (iv) Calculation of the similarity score between the mutated sequence SP and the original sequence SA using the BLOSUM62 matrix . Steps ii to iv were repeated 10000 times using a Monte Carlo procedure. A “mutation” in the substitution dictionary was accepted (VM stored as new VA) if it decreased the similarity score or if the Monte Carlo (MC) acceptance criterion (kT = 0.04) was fulfilled. In addition, the whole procedure (steps i to iv) was repeated 10 times to ensure better sampling. The application of the MC procedure enabled the finding of dictionaries that generated sequences with low similarity to the original sequences.
Comparison of dot plots from all repeat proteins of known structure (SI Dendrogram)
The entire UniRef90 set of protein sequences (n = 6315 chains) was downloaded on Nov 24th, 2017 and subjected to dot plot analysis as follows. The 78915455 sequences were subjected to DOTTER as above and filtered to only include sequences with a length greater or equal to 121 residues and that had a dot plot with at least 0.42 pixels per residue (considering the top half triangle and not the self-identity line). This gave a set of 13297656 chains for further analysis. Plots were converted to binary as before and pairwise comparisons were calculated for all members. The large comparison matrix was sparsified by selecting 1400 largest values for each dot plot and was clustered using HipMCL . For sequence selection procedure, we modified DOTTER which is a part of the Seqtools suite  in order to yield pixel per residue ratios and a binary file containing pixel data. A custom Python script using SCOOP library  handled parallel execution of DOTTER on an HPC cluster and produced the metadata required by the pipeline. Both sliding and sparsification procedures were performed using self-written C++ code. For each cluster, the medoid, the point which is the least different as measured by all pairwise JX values, was identified and a representation of the clusters was generated in CLANS  using cluster medoids as representatives (Fig. 5). The full list of clusters and protein IDs is provided in the SI.
A similar process was also undertaken using the protein chains in the RepeatsDB set, however the distances were clustered in R using HClust  and manipulated using the dendextend package . The full set of repeat proteins from RepeatsDB was filtered in R with the protcheck function from the protr package  and then the remaining 6280 chains were aligned with the pairwiseAlignment function in the Biostrings package in R  to compare pairwise sequence identities between all the protein chains (SI Fig. 4). The results were rounded to the nearest per cent and binned and a heat map of the results was generated using the heatmap.2 function of Gplots in R . Dendrograms were cut evenly at 50 heights and the clusters were then compared to the groupings (using both the structural subgroups and sequence identity) from RepeatsDB as well as examining the JD values between group members. The expected amount of information in repeat protein dot plots was determined by counting the number of positive pixels not on the diagonal from the protein chains in the RepeatsDB set. An estimate of the background information that might be expected to occur in non-repeat proteins was measured by creating two control sets comprised of 1325 “bacillus” or 985 “mouse” protein chains from the PDB . Sets were generated by a search of the PDB for proteins with the text keyword “bacillus” or “mouse” with resolution between 0.0 and 2.0 Å and with matches trimmed at ≤30% sequence identity. These were downloaded as FASTA sequences and then chains present in RepeatsDB or those less than 101 residues length were removed.
Identification of consensus dot plot patterns (SI Fig. 1)
Visual examination is often sufficient to identify a consensus pattern within a group of closely related proteins. Sets of example proteins were generated by selecting proteins from the 79 member test set and then finding related proteins using BLASTp , while the FASTKD1 and plant RAP containing protein sets were found using Pfam  . A multiple sequence alignment of the related proteins was generated by MUSCLE . Alignment positions in which 20% or more of the sequences had a “gap” position were then trimmed. A set of 25 blank gap spaces (due to the size of the standard DOTTER scoring window ) was added to the N and C termini of the aligned sequences to reduce edge effects of the editing and the edited, identical length sequences were re-analyzed by DOTTER as detailed in general methods. The optimal method for hierarchical clustering was performed as with the RepeatsDB set and clustering methods and dendrogram cut levels were scored by looking for clusters in which members shared close relations (JD ≤ 0.875). The average score at each position in the matrix was calculated and the resulting average DOTTER matrix was converted to a binary format to produce consensus dot plots. Images of consensus dot plots were generated using the heatmap.2 function of gplots in R  . Relatedness between the sequences was also confirmed by phylogenetic analysis using MrBayes  . During the runs the substitution model was optimized and runs were continued until the standard deviation of split frequencies was < 0.01.
Deconvolution of the consensus dot plots was also used to predict the location of the repeats within the proteins. A sequence position that had a consensus score of at least the cutoff value (multiples of 10 up to 50) anywhere in its associated row or column in the dot plot was considered to be part of the repeat which were readily detectable in the deconvoluted histograms (Fig. 1).
Availability of data and materials
Purpose written code for this analysis (a docker container and corresponding source code) is available for non-commercial users to download at https://gorna.uw.edu.pl/en/research/software. Supporting information is available online. Data used in this analysis is available from the online databases UniProt (https://www.uniprot.org/), RepeatsDB (http://repeatsdb.bio.unipd.it/) & the Protein Data Bank (https://www.rcsb.org/). A list of the clusters and the proteins included in each are included as part of the supplemental material.
Kidera A, Konishi Y, Ooi T, Scheraga HA. Relation between sequence similarity and structural similarity in proteins - role of important properties of amino-acids. J Protein Chem. 1985;4(5):265–97.
Krissinel E. On the relationship between sequence and structure similarities in proteomics. Bioinformatics. 2007;23(6):717–23.
Uversky VN. Intrinsically disordered proteins and their “mysterious” (meta)physics. Front Phys-Lausanne. 2019;7:10.
Rado-Trilla N, Alba MM. Dissecting the role of low-complexity regions in the evolution of vertebrate proteins. BMC Evol Biol. 2012;12:155.
Chen JW, Romero P, Uversky VN, Dunker AK. Conservation of intrinsic disorder in protein domains and families: I. a database of conserved predicted disordered regions. J Proteome Res. 2006;5(4):879–87.
Kumari B, Kumar R, Kumar M. Low complexity and disordered regions of proteins have different structural and amino acid preferences. Mol BioSyst. 2015;11(2):585–94.
Mier P, Paladin L, Taman S, Petrosian S, Hajdu-Soltesz B, Urbanek A, et al. Disentangling the complexity of low complexity proteins. Brief Bioinform. 2019;00(00):1–15.
Kajava AV. Tandem repeats in proteins: from sequence to structure. J Struct Biol. 2012;179(3):279–88.
Paladin L, Hirsh L, Piovesan D, Andrade-Navarro MA, Kajava AV, Tosatto SCE. RepeatsDB 2.0: improved annotation, classification, search and visualization of repeat protein structures. Nucleic Acids Res. 2017;45(D1):D308–12.
Jorda J, Xue B, Uversky VN, Kajava AV. Protein tandem repeats - the more perfect, the less structured. FEBS J. 2010;277(12):2673–82.
Cerveny L, Straskova A, Dankova V, Hartlova A, Ceckova M, Staud F, et al. Tetratricopeptide repeat motifs in the world of bacterial pathogens: role in virulence mechanisms. Infect Immun. 2013;81(3):629–35.
Schmitz-Linneweber C, Small I. Pentatricopeptide repeat proteins: a socket set for organelle gene expression. Trends Plant Sci. 2008;13(12):663–70.
Renault L, Nassar N, Vetter I, Becker J, Klebe C, Roth M, et al. The 1.7 angstrom crystal structure of the regulator of chromosome condensation (RCC1) reveals a seven-bladed propeller. Nature. 1998;392(6671):97–101.
Varela M, Diaz-Rosales P, Pereiro P, Forn-Cuni G, Costa MM, Dios S, et al. Interferon-induced genes of the expanded IFIT family show conserved antiviral activities in non-mammalian species. PLoS One. 2014;9(6):1.
Jacobsen SE, Binkowski KA, Olszewski NE. SPINDLY, a tetratricopeptide repeat protein involved in gibberellin signal transduction Arabidopsis. P Natl Acad Sci USA. 1996;93(17):9292–6.
Pellegrini M, Renda ME, Vecchio A. Ab initio detection of fuzzy amino acid tandem repeats in protein sequences. Bmc Bioinformatics. 2012;13:S8.
Marcotte EM, Pellegrini M, TO Y, Eisenberg D. A census of protein repeats. J Mol Biol. 1999;293(1):151–60.
Kajava AV. Review: proteins with repeated sequence - structural prediction and modeling. J Struct Biol. 2001;134(2–3):132–44.
Jernigan KK, Bordenstein SR. Tandem-repeat protein domains across the tree of life. Peerj. 2015;3:e732.
Schaper E, Kajava AV, Hauser A, Anisimova M. Repeat or not repeat?-statistical validation of tandem repeat prediction in genomic sequences. Nucleic Acids Res. 2012;40(20):10005–17.
Sikorski RS, Boguski MS, Goebl M, Hieter P. A repeating amino-acid motif in Cdc23 defines a family of proteins and a new relationship among genes required for mitosis and Rna-synthesis. Cell. 1990;60(2):307–17.
D’Andrea LD, Regan L. TPR proteins: the versatile helix. Trends Biochem Sci. 2003;28(12):655–62.
Marold JD, Kavran JM, Bowman GD, Barrick D. A naturally occurring repeat protein with high internal sequence identity defines a new class of TPR-like proteins. Structure. 2015;23(11):2055–65.
Gul IS, Hulpiau P, Saeys Y, van Roy F. Metazoan evolution of the armadillo repeat superfamily. Cell Mol Life Sci. 2017;74(3):525–41.
Andrade MA, Petosa C, O'Donoghue SI, Muller CW, Bork P. Comparison of ARM and HEAT protein repeats. J Mol Biol. 2001;309(1):1–18.
Andrade MA, Bork P. Heat repeats in the Huntingtons-disease protein. Nat Genet. 1995;11(2):115–6.
Andrade MA, Perez-Iratxeta C, Ponting CP. Protein repeats: structures, functions, and evolution. J Struct Biol. 2001;134(2–3):117–31.
Espada R, Parra RG, Sippl MJ, Mora T, Walczak AM, Ferreiro DU. Repeat proteins challenge the concept of structural domains. Biochem Soc T. 2015;43:844–9.
Schaper E, Gascuel O, Anisimova M. Deep conservation of human protein tandem repeats within the eukaryotes. Mol Biol Evol. 2014;31(5):1132–48.
Schuler A, Bornberg-Bauer E. Evolution of protein domain repeats in Metazoa. Mol Biol Evol. 2016;33(12):3170–82.
Sonnhammer ELL, Durbin R. A dot-matrix program with dynamic threshold control suited for genomic DNA and protein sequence analysis (reprinted from gene Combis, vol 167, pg GC1-GC10, 1996). Gene. 1995;167(1–2):Gc1–Gc10.
Bateman A, Martin MJ, Orchard S, Magrane M, Alpi E, Bely B, et al. UniProt: a worldwide hub of protein knowledge. Nucleic Acids Res. 2019;47(D1):D506–15.
Henikoff S, Henikoff JG. Amino-acid substitution matrices from protein blocks. P Natl Acad Sci USA. 1992;89(22):10915–9.
Ronquist F, Huelsenbeck JP. MrBayes 3: Bayesian phylogenetic inference under mixed models. Bioinformatics. 2003;19(12):1572–4.
Steere AC, Drouin EE, Glickstein LJ. Relationship between immunity to Borrelia burgdorferi outer-surface protein a (OspA) and Lyme arthritis. Clin Infect Dis. 2011;52:S259–65.
Miras I, Saul F, Nowakowski M, Weber P, Haouz A, Shepard W, et al. Structural characterization of a novel subfamily of leucine-rich repeat proteins from the human pathogen Leptospira interrogans. Acta Crystallogr D. 2015;71:1351–9.
Azad A, Pavlopoulos GA, Ouzounis CA, Kyrpides NC, Buluc A. HipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks. Nucleic Acids Res. 2018;46(6):e33.
Cock PJA, Antao T, Chang JT, Chapman BA, Cox CJ, Dalke A, et al. Biopython: freely available python tools for computational molecular biology and bioinformatics. Bioinformatics. 2009;25(11):1422–3.
Frickey T, Lupas A. CLANS: a Java application for visualizing protein families based on pairwise similarity. Bioinformatics. 2004;20(18):3702–4.
Pellegrini M, Marcotte EM, Yeates TO. A fast algorithm for genome-wide analysis of proteins with repeated sequences. Proteins-Struct Funct Genet. 1999;35(4):440–6.
Szklarczyk R, Heringa J. Tracking repeats using significance and transitivity. Bioinformatics. 2004;20:311–7.
Heger A, Holm L. Rapid automatic detection and alignment of repeats in protein sequences. Proteins-Struct Funct Genet. 2000;41(2):224–37..
Lo Conte L, Ailey B, Hubbard TJP, Brenner SE, Murzin AG, Chothia C. SCOP: a structural classification of proteins database. Nucleic Acids Res. 2000;28(1):257–9.
Soding J, Remmert M, Biegert A. HHrep: de novo protein repeat detection and the origin of TIM barrels. Nucleic Acids Res. 2006;34:W137–42.
Pellegrini M, Renda ME, Vecchio A. TRStalker: an efficient heuristic for finding fuzzy tandem repeats. Bioinformatics. 2010;26(12):i358–66.
Jorda J, Kajava AV. T-REKS: identification of tandem REpeats in sequences with a K-meanS based algorithm. Bioinformatics. 2009;25(20):2632–8.
Newman AM, Cooper JB. XSTREAM: a practical algorithm for identification and architecture modeling of tandem repeats in protein sequences. BMC Bioinformatics. 2007;8:382.
Xing HT, Fu XK, Yang C, Tang XF, Guo L, Li CF, et al. Genome-wide investigation of pentatricopeptide repeat gene family in poplar and their expression analysis in response to biotic and abiotic stresses. Sci Rep-Uk. 2018;8:1.
Rahire M, Laroche F, Cerutti L, Rochaix JD. Identification of an OPR protein involved in the translation initiation of the PsaB subunit of photosystem I. Plant J. 2012;72(4):652–61.
Mularoni L, Veitia RA, Alba MM. Highly constrained proteins contain an unexpectedly large number of amino acid tandem repeats. Genomics. 2007;89(3):316–25.
Makabe K, McElheny D, Tereshko V, Hilyard A, Gawlak G, Yan S, et al. Atomic structures of peptide self-assembly mimics. P Natl Acad Sci USA. 2006;103(47):17753–8.
Holm L, Sander C. An evolutionary treasure: unification of a broad set of amidohydrolases related to urease. Proteins. 1997;28(1):72–82.
Kopec KO, Lupas AN. Beta-propeller blades as ancestral peptides in protein evolution. PLoS One. 2013;8(10):e77074.
Sarti E, Aleksandrova AA, Ganta SK, Yavatkar AS, Forrest LR. EncoMPASS: an online database for analyzing structure and symmetry in membrane proteins. Nucleic Acids Res. 2019;47(D1):D315–21.
Kaisers W. seqTools: analysis of nucleotide, sequence and quality content on fastq filesIn., vol. R package version 1.18.0; 2019.
Hold-Geoffroy Y, Gagnon O, Parizeau M. Once you SCOOP, no need to fork. In: Proceedings of the 2014 annual conference on extreme science and engineering discovery environment: July 13-18, 2014; Atlanta, GA, USA; 2014.
Mullner D. Fastcluster: fast hierarchical, agglomerative clustering routines for R and python. J Stat Softw. 2013;53(9):1–18.
Galili T. Dendextend: an R package for visualizing, adjusting and comparing trees of hierarchical clustering. Bioinformatics. 2015;31(22):3718–20.
Xiao N, Cao DS, Zhu MF, Xu QS. Protr/ProtrWeb: R package and web server for generating various numerical representation schemes of protein sequences. Bioinformatics. 2015;31(11):1857–9.
Pagès H, Aboyoun P, R G, DebRoy S. Biostrings: efficient manipulation of biological stringsIn., 2.46.0 edn. R; 2017.
Warnes GR, Bolker B, Bonebakker L, Gentleman R, Huber W, Liaw A, et al. Gplots: various R programming tools for plotting dataIn. R; 2016.
Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, et al. The protein data Bank. Nucleic Acids Res. 2000;28(1):235–42.
Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ. Basic local alignment search tool. J Mol Biol. 1990;215(3):403–10.
Finn RD, Coggill P, Eberhardt RY, Eddy SR, Mistry J, Mitchell AL, et al. The Pfam protein families database: towards a more sustainable future. Nucleic Acids Res. 2016;44(D1):D279–85.
Chojnacki S, Cowley A, Lee J, Foix A, Lopez R. Programmatic access to bioinformatics tools from EMBL-EBI update: 2017. Nucleic Acids Res. 2017;45(W1):W550–3.
The authors would like to thank Drs. Georgios A. Pavlopoulos, Ariful Azad, & Ed Griffiths for helpful discussions and Laszlo Dobson for a careful reading of the manuscript.
The work was supported by the National Science Centre, Poland [grant agreement 2014/15/D/NZ1/00968 to M.W.G.] and [grant agreement 2015/18/E/NZ1/00689 to S. D-H. and [grant agreement 2019/32/T/NZ1/00323 to J.L.], the European Union’s Horizon 2020 research and innovation programme [Marie Skłodowska-Curie grant agreement No 655075 to M.W.G.] This research was supported in part by PL-Grid Infrastructure (Poland).
Ethics approval and consent to participate
Consent for publication
The authors declare that they have no competing interests.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Merski, M., Młynarczyk, K., Ludwiczak, J. et al. Self-analysis of repeat proteins reveals evolutionarily conserved patterns. BMC Bioinformatics 21, 179 (2020). https://doi.org/10.1186/s12859-020-3493-y
- Protein repeat
- Repeat identification
- Structural bioinformatics
- Protein evolution