Volume 13 Supplement 3
ACM Conference on Bioinformatics, Computational Biology and Biomedicine 2011
Ab initio detection of fuzzy amino acid tandem repeats in protein sequences
- Marco Pellegrini^{1}Email author,
- Maria Elena Renda^{1} and
- Alessio Vecchio^{2}
DOI: 10.1186/1471-2105-13-S3-S8
© Pellegrini et al.; licensee BioMed Central Ltd. 2012
Published: 21 March 2012
Abstract
Background
Tandem repetitions within protein amino acid sequences often correspond to regular secondary structures and form multi-repeat 3D assemblies of varied size and function. Developing internal repetitions is one of the evolutionary mechanisms that proteins employ to adapt their structure and function under evolutionary pressure. While there is keen interest in understanding such phenomena, detection of repeating structures based only on sequence analysis is considered an arduous task, since structure and function is often preserved even under considerable sequence divergence (fuzzy tandem repeats).
Results
In this paper we present PTRStalker, a new algorithm for ab-initio detection of fuzzy tandem repeats in protein amino acid sequences. In the reported results we show that by feeding PTRStalker with amino acid sequences from the UniProtKB/Swiss-Prot database we detect novel tandemly repeated structures not captured by other state-of-the-art tools. Experiments with membrane proteins indicate that PTRStalker can detect global symmetries in the primary structure which are then reflected in the tertiary structure.
Conclusions
PTRStalker is able to detect fuzzy tandem repeating structures in protein sequences, with performance beyond the current state-of-the art. Such a tool may be a valuable support to investigating protein structural properties when tertiary X-ray data is not available.
Introduction
Motivations
In a seminal paper of 2001 M.A. Andrade and co-authors [1] observe that repetitive subsequences that appear tandemly often form integrated assemblies when viewed in their three-dimensional corresponding conformation, as they often confer multiple binding opportunities and play a structural role in proteins. Moreover, tandemly repeated structures constitute a different class from domains and motifs that appear singly in each protein (while they can be repeated across families of protein). M.A. Andrade and co-authors also remark that repeats in protein sequences are usually hard to detect because of their relatively (on average) short length and because of their considerable -inherent- sequence divergence.
A study of 1999 by Marcotte et al. [2] indicate that internal subsequence repetitions in proteins primary structure are quite widespread. They have been noticed in about 14% of all the known proteins, with eukaryotic proteins being three times more as likely to have internal repeats than prokaryotic ones. The distribution of TRs in protein families and the mechanisms of protein TR formations are discussed in detail in [3].
From a theoretical point of view almost any approach that works for a 4-characters alphabet (DNA) could also be applied to the 20-characters amino acid alphabet and indeed some methods are developed for "generic" biological sequences (e.g. [4]). In practice, there are differences between protein and DNA sequence, and the way they can be analyzed. Protein sequences tend to be shorter (at most of the order of 10^{4} amino acids) than DNA sequences (often of the order of 10^{6} nucleotides and more). In proteins, assigning a score to an amino acid substitution is important, and finally repetitions in amino acid sequences tend to be very divergent, since the same structural role can be maintained even with little sequence conservation. Also, empirically, we observe that the tools for detecting (tandem) repeats for DNA and for proteins constitute two rather distinct families, often employing completely different characterization and algorithmic approaches.
In [5] we presented TRStalker, an algorithm designed, developed and tuned to detect fuzzy tandem repeats in DNA sequences. In view of the biological relevance of tandemly repeated subsequences in proteins, we worked on an evolution of TRStalker, modified and tuned to work with protein sequences in order to detect amino acid (aa) tandem repeats, by incorporating amino acid similarity information deep into the algorithmic framework. Amino acid substitution matrices (such as the PAM and BLOSUM families of matrices, based on known evolutionary changes of amino acids in proteins) are usually expressed in terms of a similarity score between amino acids. In the framework we present here, we use the notion of weighted edit distance between sequences, thus converting standard similarity scores into distance weights. Interest in metric-space search and indexing in bioinformatics [6] has been recently rekindled since one can tap on a vast array of efficient metric-based generic methods developed over the years, thus reducing the need for developing ad-hoc searching and indexing algorithms for each new similarity measure. A technique for turning BLOSUM log-likelihood similarity matrices into corresponding metric space was proposed in [7], while a second method to turn PAM log-likelihood similarity matrices into a corresponding metric space was proposed in [8]. It is also possible to define new metrics over amino acids by first mapping each amino acid into a real vector space (see e.g. [9]), and then applying one of the many possible metrics associated to a real vector space. For this reason we generalize the definition of tandem repeat in order to incorporate this larger class of metrics in the proposed algorithm.
PTRStalker, the novel algorithm we developed, has been compared against competing state-of-the-art methods over large collections of proteins (UniprotKB/Swiss-Prot), on membrane channels proteins, and on selected families of proteins known to contain long fuzzy TRs. We found out that under edit distance 19.53% of the protein listed in UniPtotKB/Swiss-Prot have significant fuzzy TRs. We could find fuzzy TRs, not detected by some competing methods (XSTREAM, T-REKS, TRUST), in Human Titin (striated muscles). For the Chlorine channel protein ClC-0 (membrane transport) we show that PTRStalker can detect known symmetries while competing methods do not. The output of our analysis of protein sequences has been collected into a publicly available database, that will be continuously updated in order to provide useful insight to researchers interested in protein sequence analysis. The database is freely available at [10].
The outline of the paper is the following: after a short introduction on the algorithms developed for detecting tandem repeats in protein sequences, we introduce and describe PTRStalker procedural approach in detail. Next we describe the experiments we performed to evaluate the metric chosen, and the results obtained by PTRStalker and competing state of the art tools.
State of the art
The first methods developed for finding TRs in proteins are based on detecting sub-optimal alignments in the self-alignment matrix generated by the Smith-Waterman algorithm. Some examples are Internal Repeat Finder [2, 11], RADAR [12], REPRO [13, 14] and TRUST - Tracking Repeats Using Significance and Transitivity [15], even if they often detect both tandem and interspersed repeats. More recently Newman and Cooper proposed XSTREAM [16], which uses a seed expansion approach, while Jorda and Kajava proposed T-REKS [17], which uses a clustering approach based on k-means. The systems HHrep [18] and HHRepID [19] are instead based on building and matching Hidden Markov Models for the repeating substrings to be sought (not necessarily tandem). Some approaches based on neuronal networks aim at detecting particular repetitive structures. For example, in [20], Palidwor et al. developed a classification technique for detecting alpha-rods repeats, a specific repetitive structure. A meta searching approach that combines the output of different algorithms has been also proposed, for example in the tool REPPER [21]. With a few notable exceptions (see e.g. [4]) all these methods specialize on protein sequences. Sokol et al. [22] proposed TRED, which is based on an estimation of edit distance between strings. In principle their approach can be applied to any alphabet size, however the on line available software is tuned only for 4-character DNA strings.
Among the -few- databases reporting protein repetitive subsequences we recall ProtRepeatsDB [23], a relational database of perfect and mismatch repeats, which also provides cross species comparisons of different types of amino acid repeats.
Methods
Algorithm PTRStalker
In this Section we describe PTRStalker, an evolution of the algorithm TRStalker [5] we developed for finding TRs within DNA sequences. Whereas TRStalker and PTRStalker use the same overall procedural approach to detect tandemly repeated subsequences, PTRStalker has been opportunely tuned for detecting TRs in protein sequences. In particular, the main differences are in the formal definition of a tandem repeat, in the metrics used, and in the q-grams matching policy (see below). However, the overall idea still holds: TRs are detected by (i) first finding a set of candidate periods, (ii) then finding a set of candidate pairs (period, starting position), and (iii) finally verifying if in a particular position there exists a TR according to the precise mathematical definition adopted (see below). To make this paper self contained, after introducing a few working definitions we will recall the general structure of the algorithm presented in [5], describing the innovative parts PTRStalker has.
Preliminaries
In order to extend the methodology used in [5] by incorporating amino acid similarity information encoded in similarity matrices, we need to perform two tasks: define a weighted edit distance, and suitably modify the tandem repeat definition so to obtain a Weighted Steiner Simple Tandem Repeat (Weighted Steiner STR). We give here details for the BLOSUM metric space as defined in [7]. The extension to other metrics is straightforward.
BLOSUM-weighted edit distance
and ∑ is the amino acid alphabet. Since D_{ ij } represents the non-normalized distance between two characters, we use D_{ max }, representing the maximum distance between two characters, as the normalization value so to obtain the normalized weight C_{ ij } ∈ [0, 1]. In [7] it is shown that these weights are consistent, since they almost always satisfy the triangular inequality.
BLOSUM-weighted Steiner-STR
Let D_{ B }(a, b) be the BLOSUM-derived edit distance between strings a and b computed by using the BLOSUM-derived weights defined above. In order to give meaningful limits to the divergence of strings under this metric we need to define its behavior for random pair of amino acid strings. For the expected edit distance of two strings no analytic formula is known even in the unweighted case. Even if the theory of Karlin and Altshul [24] could give some insight, the issue of extending their methodology to the case of tandem sequences is not trivial. For these reasons we estimate D_{ B }(a, b) with an experimental approach, by generating a suitable number of random strings in which the probability of amino acid substitution is consistent with the BLOUSM data, and by measuring the weighted edit distance for a given error level. We define with E(C) the expected substitution cost among two amino acids due to the cost matrix C. As a consequence, two random amino acid stings of length p = |a| = |b| are at expected distance pE(C). If we allow only a percentage μ of substitutions we obtain an estimated weighted distance of μpE(C).
A BLOSUM-weighted Steiner-STR is defined as a string X = x_{1}x_{2}..x_{ t } for which two conditions hold, for a user defined error parameter 0 ≤ μ ≤ 1, and constant c with 1 ≤ c ≤ 2:
(a) for each i ∈ [1, .., t - 1], D_{ B }(x_{ i }, x_{ i }_{+1}) ≤ cμ|x_{ i }|E(C)
(b) there exists a Steiner string $\stackrel{\u0304}{x}\in {\Sigma}^{*}$ so that for each i ∈ [1, .., t], ${D}_{B}\left(\stackrel{\u0304}{x},{x}_{i}\right)\le \mu \left|{x}_{i}\right|E\left(C\right)$
Intuitively, in a BLOSUM-weighted Steiner-STR the TR consists of t duplications of a single Steiner consensus string $\stackrel{\u0304}{x}$ with at most μ times the number of mutations one would expect from random strings of the same length (condition (b)). Moreover consecutive copies of the mutated string do not diverge too much w.r.t. each other, at most cμ times the number of mutations one would expect from random strings of the same length (condition (a)). Note that condition (a) is vacuous for μ ≥ 1/c. The choice for the constant c depends also on the level of divergence. For protein repeats with low divergence c = 2 is a sensible choice since two copies at distance μ|x_{ i }|E(C) from $\stackrel{\u0304}{x}$ are also at distance at most $2\mu \left|\stackrel{\u0304}{x}\right|E\left(C\right)$ from each other by the triangular inequality. Thus (a) is a necessary condition for (b). For the higher level of divergence we are interested in (μ = 0.3), the value c = 2 is too loose and we use a lower value (c = 1.5), so to maintain a good filtering ability of condition (a) and to avoid having as a possible solution a TR where the consecutive pairs may have a very irregular divergence. Note that the standard TR definition for the unweighted edit distance corresponds to a matrix with cost 1 for each substitution.
Homologous q-grams
Let I be a finite subset of non-negative integers. We call I an index set. The span of I is span(I) = max{i - j|i, j ∈ I}, the position of I is pos(I) = min i ∈ I, and the shape of I is shape(I) = {i - pos(I)|i ∈ I}. When |I| = q and span(I) = s, the shape of I belongs to the class of (q, s)-shapes. Any set of non-negative integers Q containing 0 is a shape. For an alphabet ∑ (the 20 amino acid letters in our case), a string S ∈ ∑* of length n can be seen as a function defined over [0, ..,n - 1] with values in ∑, and for any subset I ⊂ [0, .., n - 1] the restriction of S to I, denoted by S[I], is a substring of S. Given any shape Q in the class of (q, s)-shapes, all sets I ⊂ [0, ..n - 1] such that shape(I) = Q, form the set of Indexes(Q, n). We can use elements from the Indexes(Q, n) to generate restrictions for the string S. An index set I such that |I| = q and span(I) = q - 1 is called an ungapped q-gram since its shape is shape(I) = [0, ..q - 1]. If we have an index set J with |J| = q and span(J) = s ≥ q we have a gapped q-gram since its shape is formed of non consecutive integers. As noted in [25] gapped q-grams are strictly more powerful than ungapped ones. In order to generate a population of candidate periods we consider now all possible (q, s)-shapes with q = 3 and s = 4, 3, 2. Denoting with - the gaps and with # symbols from ∑, (the first and last positions must be always #), we have the (3, 4)-shapes ## - - #, # - # - #, and # - - ##; the (3, 3)-shapes # - ##, ## - #; the (3, 2)-shape ###; and the (2, 1)-shape ##.
Gapped q-grams (also called spaced seeds) have been used in [26–28] to speed up homology search. In these papers much larger values of q and s are used in order to attain sensitivity. Therefore the key problem for them becomes how to select one (or a few) effective seed out of an exponentially large family (for s and q). Since we use small values of (q, s) we do not have this seed selection problem and we can afford to use a complete family, formed by 6 seeds only.
In defining the notion of homologous q-grams for amino acid sequences we take into account the fact that functional properties of proteins are preserved even under considerable sequence substitutions. The BLOSUM similarity matrices give a quantitative definition of the allowed amino acid substitutions. Given two index sets I_{1}, I_{2} ∈ Indexes(Q, n), we call them matching (or homologous in S, if S[I_{1}] and S[I_{2}] have two identical symbols in corresponding positions while the symbol in the remaining position can be different in the two strings but within ranking z of each other as given by the BLOSUM similarity matrix (that is, the one symbol is among the top z most similar symbols to the other one, and vice versa). The slackness parameter is z = 1 when we want exact match, and z = 3 and z = 5 when we allow more substitutions. The value |pos(I_{1}) - pos(I_{2})| is called the period of the match.
Note that, by considering the z amino acids closer to a given amino acid, we introduce a discrete ranking in the metric space. Alternatively one could choose a fixed radius and consider all amino acids within that radius. We performed dedicated experiments in order to choose the right approach and the results (not shown here) indicate that there is almost no difference in the two approaches. We decided to adopt the discrete ranking approach because choosing suitable radii implies ad-hoc dependance on the specific metric.
Anti-smear weighting
The anti-smear weighting technique allows to cope with the fluctuations in the period of matching q-grams introduced by insertion and deletions of amino acids in a sequence. If q_{1} and q_{2} are occurrences of homologous q-grams in X at distance k, before the implant of mutations, the effect of insertion and deletions on the positions of the string X between q_{1} and q_{2} is to alter their distance so that a different period k' is detected. The difference k - k' is equal to the algebraic sum of number of insertions and deletions in the positions between q_{1} and q_{2}. Assuming that any such position can be an insertion or a deletion independently with the same probability, the random variable k - k' is distributed as a sum of independent r.v. with values in {+1, -1, 0} with mean value 0, thus, by a Chernoff bound argument, its tail distribution decays exponentially [29, 30]. Also near-by probes in X have small variations in the value of the shift k - k'. Inspired by the above observation we devise a weighting scheme that increments the total weight of period k if another period of value $\stackrel{\u0304}{k}$ is discovered in a near-by position, with weights that decay exponentially with $|k-\stackrel{\u0304}{k}|$.
where Q is a queue holding the last H detected distances in the sequential scan of the input string Y. This way, the final weight w_{0}(k) for a given period k is the sum of the individual anti-smear weights computed above for probes at distance k. After the weight update, we enqueue all h values k_{ g } in the queue Q, and we dequeue an equal number h of items.
Multiplicity weighting
The candidate periods are then sorted by the weight w_{1}(.), and processed in decreasing order.
Positional k-density
We further exploit the property of TRs for which the same period is detected by probes in near-by positions. The positional k-density is the density of probes that contribute to the counter for the candidate period k. Let k be the period under investigation. Consider the set K_{ k } of the positions of those q-grams (i.e. substrings of Y) that contribute to the weighting of k through the multiplicity weighting. In order to avoid double counting we always take the position of the first of the two matching probes. Note that, if a position is shared by several pairs of probes it will be counted only once. Let f : [0, ..,|Y| - 1] → {0, 1} the characteristic function that for each position in Y denote the membership of that position to K_{ k }. Consider the k-window smoothing of $f:F\left(i\right)={\sum}_{j=i}^{i+k-1}f\left(j\right)$ that computes the k-smoothed density of the function f, for i ∈ [0, .., |Y| - k]. Finally we define a threshold t(k) proportional to the average k-density by a user-defined constant, and we consider as a candidate position set CP(Y, k) = {i ∈ [0, .., |Y| - k]|F(i) ≥ t(k)}. The output of this positional density computation is a sequence of pairs (k, i) where k is a candidate period and i a candidate position.
TR validation
We take each candidate pair (p, i) and explicitly test whether there is a TR of period p starting in position i according to the definition used, by using an alignment technique based on the well-known Smith-Waterman algorithm. In this phase, besides validating the TRs, we discover the (fractional) repetition number of the TRs eventually extracted. Finally, we check for inclusion the TRs found and we filter out those TRs completely enclosed in another one. For TRs in the same position and length but different period we report the TR with shorter period.
The algorithm in detail
Step 1. The number L of candidate periods to examine is empirically set to 50, while the set of candidate pairs K, and the set of TRs T to be given as output are initialized as empty sets.
Step 2. The function block(Y) splits the input sequence Y into n blocks Y_{ j }, 1 ≤ j ≤ n, of predefined length (we used a value of 2000 aa). We limit our computations within a block so to avoid counting q-grams when they are too far to be involved in a TR local to the block. For TRs stranding across blocks we adopt mechanisms to carry over useful information from one block to the next one.
Steps 3-4. The candidate periods are found by detecting the distance (counted in amino acid positions) among homologous q-grams. Because of the presence of substitutions, insertions, and/or deletions, many instances of q-grams will be probably affected by error and a match could be missed, thus reducing the frequency counts for the candidate period k. In order to cope with this effect, for each block Y_{ j }, function findGappedQGrams(Y_{ j }) records for each occurrence of a gapped q-gram P^{ i }in Y its distances K' to the next 5 occurrences (candidate periods) and its starting position i in Y. Note that the candidate periods will be processed later in order of cumulative weight.
Steps 5-8. For each period k detected by a q-gram at position i, the function updateWeight(k, i) increments the weight w(k) of the period k ∈ K' by applying the two weighting techniques presented before: the anti-smear weighting technique to cope with the fluctuations in the period of matching q-grams introduced by insertion and deletions of amino acids in a sequence (see Equation 1), and the multiplicity weighting (see Equation 2) to strengthen the signal when the TR is made by more than two repeating units. For computing the anti-smear weight as shown in Equation 1 we empirically set h = 5 and H = 20. The candidate pair (k, i) is then added to the set K, if it is not already present.
Step 9. Function getTopPeriods(K, L) ranks the periods by weighted frequency and returns only the top L positions in the set K_{ L }.
Step 10. PTRStalker further exploits the property of TRs that the same period is detected by probes in near-by positions through the positional k-density. Thus, the function posDensity(K_{ L }) computes the density of probes that contribute to the counter for the candidate period K, and then cuts off for position with low density, returning those candidates with higher positional density.
Steps 11-14. For each candidate pair (k, i), functions getTR() computes a candidate TR of period k starting at position i and verifyTR() verifies whether there is a tandem repeat t of period k starting at position i according to the definition of TR given, and if so t is added to the set T. Recall that for a BLOSUM-weighted Steiner-STR we set μ = 0.3 and c = 1.5.
Steps 16-18. Finally, for each candidate tandem repeat t ∈ T the function maximal() verifies whether t is included in a longer TR, and possibly removes t from T, while minp() for TRs in the same position and length but different period maintains only the TR with shorter period. The procedure returns the set T as result.
The elements of T can be visualized and listed according to different properties of the TR found: initial position, final position, repeating unit size, number of repetitions, total length, absolute divergence, mean divergence, etc.
Results
In this section we report PTRStalker performance with the use of a BLOSUM-based metric and the unweighted edit distance. Furthermore we report a detailed comparison of PTRStalker versus some state of the art algorithms. For some of the experiments reported below, PTRStalker has been run to analyze the UniprotKB/Swiss-Prot database of protein sequences. More in detail, the version we used in our experiments was UniProtKB/Swiss-Prot Release 57.15 of 02 March 2010 -henceforth called Swiss-Prot database, that contains 515, 203 sequence entries.
Metric evaluation
UniProtKB/Swiss-Prot database: percentage of protein sequences that contain at least a tandem repeat with length ≥ 20
Metric | z = 1 | z = 3 | z = 5 |
---|---|---|---|
BLOSUM 90 | 17.7 | 20.5 | 23.2 |
BLOSUM 70 | 21.6 | 25.6 | 26.1 |
BLOSUM 50 | 22.5 | 27.4 | 29.1 |
Edit | 4.3 | - | - |
UniProtKB/Swiss-Prot database: percentage of protein sequences that contain at least a tandem repeat with length ≥ 30
Metric | z = 1 | z = 3 | z = 5 |
---|---|---|---|
BLOSUM 90 | 5.7 | 6.4 | 7.8 |
BLOSUM 70 | 7.0 | 7.0 | 8.7 |
BLOSUM 50 | 7.1 | 8.4 | 8.8 |
Edit | 2.2 | - | - |
UniProtKB/Swiss-Prot database: percentage of protein sequences that contain at least a tandem repeat with length ≥ 40
Metric | z = 1 | z = 3 | z = 5 |
---|---|---|---|
BLOSUM 90 | 4.3 | 4.9 | 4.9 |
BLOSUM 70 | 4.9 | 5.5 | 5.4 |
BLOSUM 50 | 4.9 | 5.7 | 5.7 |
Edit | 1.8 | - | - |
Competitors
In what follows we compare PTStalker with several state of the art algorithms, namely, RADAR, TRUST, XSTREAM, T-REKS, HHrep and HHRepID. Like PTRStalker, all these algorithms do ab-initio identification of protein repeats with indels.
RADAR [12] and TRUST [15] detect internal sequence symmetries by aligning the protein sequence to itself and analyzing the collection of suboptimal alignments. In particular, they build a repeat profile to exactly determine repeat borders and extract a multiple alignment of repeats. Usually, the alignment of a sequence to itself for the detection of suboptimal alignments is performed with the Smith-Waterman algorithm [31] or its variations (see, e.g., [32]).
HHrep [18] and HHRepID [19] are based on HMM-HMM comparison instead of sequence-sequence comparison: a Hidden Markov Model (HMM) profile is built from a multiple alignment of proteins homologous to the analyzed one, and sub-optimal alignments are then searched by aligning this HMM with itself. These methods can be very sensitive in detecting long and highly divergent repeats.
TRUST and HHrep make also use of the concept of transitivity of alignments, through which identify additional distant homologue TRs and recognize and reduce the contribution of non-homologous TRs.
XSTREAM [16] is based on a short string extension algorithm.
T-REKS [17] uses a K-means clustering algorithm for identifying putative lengths of TRs. XSTREAM and T-REKS use quite similar definition of TR and are especially effective in finding relatively short tandem repeats (15-20 bp long).
Proteins with very long tandem repeats
Analysis of the 12 proteins from the UniProtKB/Swiss-Prot database with a very long fuzzy tandem repeat
Protein | Tandem repeats found by | ||||||
---|---|---|---|---|---|---|---|
Acc # | ID | Length | PTRStalker | XSTREAM | T-REKS | TRUST | RADAR |
Q8IVF2 | AHNK2_HUMAN | 5795aa | 165-x-24 | 165-x-23 | * | ** | 163-x-31 |
[720-4666] | [774-4617] | [289-5529] | |||||
Q9N4M4 | ANC1_CAEEL | 8545aa | 915-x-6 | 903-x-4.27 | 58-x-4 | ** | *** |
[3000-8491] | [4342-8199] | [2336-2567] | |||||
P08519 | APOA_HUMAN | 4548aa | 1495-x-3 | 114-x-37 | 114-x-24 | 114-x-39 | 111-x-38 |
[0-4486] | [7-4220] | [1501-4125] | [18-4523] | [17-4282] | |||
P20930 | FILA_HUMAN | 4061aa | 1339-x-3 | 323-x-11 | * | 324-x-12 | *** |
[32-4051] | [268-3902] | [82-3935] | |||||
Q54CU4 | COLA_DICDI | 11103aa | 433-x-17 | 430-x-17 | * | ** | 424-x-22 |
[1175-8554] | [1257-8691] | [301-9409] | |||||
Q8R0W0 | EPIPL_MOUSE | 6548aa | 515-x-8 | 515-x-8 | * | ** | *** |
[2000-6548] | [2067-6529] | ||||||
Q9Y6R7 | FCGBP_HUMAN | 5405aa | 1367-x-3 | 1201-x-3 | * | 1201-x-5 | 394-x-13 |
[1000-5102] | [1100-4811] | [21-5405] | [444-5382] | ||||
P05790 | FIBH_BOMMO | 5263aa | 1049-x-5 | 168-x-30 | 8-x-19 | ** | *** |
[1-5247] | [152-5221] | [3362-3495] | |||||
Q9UKN1 | MUC12_HUMAN | 5478aa | 1548-x-3 | 1557-x-2 | 25-x-8 | 28-x-151 | *** |
[74-4719] | [446-3569] | [2049-2280] | [215-5123] | ||||
Q8WXI7 | MUC16_HUMAN | 22152aa | 156-x-61 | 156-x-61 | 156-x-17 | ** | 153-x-61 |
[12038-21555] | [12047-21567] | [12420-15000] | [12046-21559] | ||||
Q6PZE0 | MUC19_MOUSE | 7524aa | 652-x-9.6 | 163-x-36.4 | * | ** | *** |
[1071-7372] | [1281 -7214] | ||||||
Q8WZ42 | TITIN_HUMAN | 34350aa | 1082-x-4 | 28-x-6 | 10-x-26 | ** | 395-x-28 |
[22186-26525] | [11428-11596] | [11445-11686] | [20001-29694] |
Membrane proteins
Membrane proteins perform a wide range of biological functions including signal transduction and molecular transport. Here we report the behavior of PTRStalker in detecting fuzzy tandem repeats in two families of well known membrane proteins: the Urea Transport Channels and the Chloride Channels.
Urea transport channels
Analysis of proteins belonging to the Urea Transporter (UT) family
Protein | Tandem repeats found by | ||||||
---|---|---|---|---|---|---|---|
ID | Acc # | Length | PTRStalker | HHRep | HHRepID | TRUST | RADAR |
dvUT | ABM28909 | 337aa | [14-165] | [11-91] | [2-138 ] | [11-139] | 5-x-44 |
[177-323] | [174-254] | [141-286] | [140-303] | [23-269] | |||
apUT | YP_001969475 | 300aa | [17-136] | [2-140] | [2-138] | [21-128] | [45-129] |
[153-284] | [156-288] | [156-286] | [175-278] | [199-277] | |||
mUT-A1 | AAM00357 | 930aa | [4-452] | [63-337] | [65-493] | [41-421] | 5-x-52 |
[467-918] | [532-800] | [533-916] | [422-866] | [117-775] | |||
hsUT-A1 | AAL08485 | 920aa | [4-320] | [50-338] | [87-490] | [102-564] | 6-x-24 |
[403-763] | [519-800] | [548-906] | [565-916] | [189-721] |
Chloride channel ClC-0
Analysis of the CIC-0 protein belonging to the Chloride Channel family
Protein | Tandem repeats found by | |||||
---|---|---|---|---|---|---|
ID | Acc # | Length | PTRStalker | HHRep | TRUST | RADAR |
CLC-0[CICH_TORMA] | P21564 | 805aa | [8-289] | [119-220] | [82-195] | [102-154] |
[291-575] | [174-260] | [196-303] | [161-205] | |||
[214-265] | ||||||
[517-627] | [542-597] | [447-483] | [329-353] | |||
[628-800] | [718-770] | [484-527] | [386-407] | |||
[528-564] |
Analysis of UniprotKB/Swiss-Prot
PTRStalker has been run to analyze the database in order to report Steiner Tandem Repeats with edit distance where the level of similarity between the repeated copies and the motif was greater than or equal to 0.7 i.e. error level μ = 0.3). The output of PTRStalker has been stored in a web-accessible database. The website takes as input the accession number of a sequence and shows a table containing all the TRs found in such a sequence. For every TR it displays the start and end position, the length of the motif, the number of repeats, the total length and the consensus string. The output can be filtered by range of values for several features of the TR (total length, motif length, number of repetitions).
Statistical significance
In our algorithm several parameters have to be set, the most important ones are the error threshold μ, the slackness parameter z and the metric used (i.e. type of similarity matrix) that influences the value of E[C]. Since an improper configuration may result in detecting a distribution of fuzzy TRs (FTRs) indistinguishable from the distribution of FTRs one could derive from a set of random sequences, we need to perform a statistical significance test to validate the configuration of parameters. In particular, we concentrate on the distribution of the longest FTRs found in a population of biological strings (sampled from UniprotKB/SwissProt), w.r.t. a control set of random strings, with the same length and aa count composition.
The distribution of the longest FTR in a set of random sequences may in principle be modeled by an Extremal Value Distribution (usually Gumbel-type) via a parameter fitting phase that relies on extensive experimentation. This approach however relies on several assumptions and approximations requiring experimental verification on the actual data. In order to reduce the assumptions needed we prefer to use a non-parametric test that does not assume that the distribution under investigation has some specific property, thus resulting in more robust conclusions. We apply (with some modifications, and simplifications) a methodology described in [37, 38] that, in turns is based on the Wilcoxon signed rank test of significance [39].
P-values for the Wilcoxon signed rank significance test (one tailed test)
Length Class | P-value (1-tail) |
---|---|
300 | 1.5967199936708E-3 |
400 | 2.0342486747627283E-2 |
500 | 2.4673807804867205E-4 |
600 | 6.36671915517767E-7 |
700 | 1.8930737304578085E-5 |
800 | 1.8821140025488957E-5 |
900 | 7.568768556122764E-6 |
1000 | 5.4931640625E-4 |
We determine the significance of the fuzzy tandem repeats found using PTRstalker with the specific parameter setting (μ = 0.3, c = 1.5, z = 1, BLOSUM 50).
The test is organized as follows. We subdivide the UniprotKB/SwissProt sequences in classes of length and we select the classes corresponding to lengths l = 400, 500, 600, 700, 800, 900, 1000. We test each length class separately. In each class, except class 900 and 1000, we randomly select 100 sequences that are shuffled to produce the control data set. In class 900 we select 81 sequences and in class 1000, 23 sequences, since these are all the sequences in those length class present in the database. The pairs of sequences (original and shuffled) are processed by PTRStalker and the length of the longest FTR found in both cases is returned as a matched pair to be fed to the Wilcoxon signed rank test. Since PTRStalker has a lower limit of 6 aa for the returned FTR, when one of the two runs fails to report a FTR we set it to the value 6 by default. When both runs fail to report a FTR we consider it a tie and is thus excluded in the testing, as required by the Wilcoxon procedure.
As we can see from the results reported in Table 7, the test gives p-values always below the 0.05 threshold for each length class considered.
Tuning of parameters
The most important parameters that regulate the operation of PTRStalker are μ, c, and z (note that the latter makes sense only when the distance definition is BLOSUM-based). A set of experiments has been carried out to study the effects of such parameters in finding TRs. We built a set of sequences belonging to the following classes of length: 400, 500, 600, 700, 800. Each class contains 100 sequences and each sequence has been generated by shuffling a real sequence of UniprotKB/SwissProt with same length (this ensures that the resulting sequences have the same properties of biological sequences in terms of aa count).
Figure 2 shows the average length of the longest TR found in every sequence of the set, when using edit distance. As expected, for a given value of c, the average length of the longest TR depends on the value of μ when the value of c increases, the length of the TRs increases as well. Varying the value of c has a similar effect, this is particularly evident for the larger values of μ.
Conclusions and future work
Discovering fuzzy tandem repeating units in amino acid sequences gives precious hints as to the internal protein organization and symmetries. However due to high level of protein sequence divergence this task is considered challenging even for relatively short sequences. In this paper we presented a new algorithm, PTRStalker, opportunely tuned for detecting amino acid tandem repeats within protein sequences. We proved that PTRStalker pushes forward the state of the art. Indeed, feeding PTRStalker with sequences from the UniProtKB/Swiss-Prot database did allow us to detect novel repetitive structures not captured by other state-of-the-art tools. In particular, we could find a notable long fuzzy TR in Human Titin that several competing methods missed. For Chlorine channel protein ClC-0, we showed that PTRStalker can detect general symmetries not detected by competing methods.
We believe that a tool such as PTRStalker can be used to extract valuable structural hints from protein sequences for which no tertiary structure (determined via X-ray or NMR) is available.
Future work will aim at comparing the relative power of different amino acid metric spaces within the PTRStalker framework. In particular we are interested in those based on PAM matrices [8] and those based on the vector space mapping approach [9]. Moreover, we will study the correlations between structural classifications of protein families (e.g. those in SCOP and CATH) and the fuzzy tandem repeats found in primary sequences.
Declarations
Acknowledgements
We wish to thank Michael Pusch and Laura Gioiosa for their insights on membrane proteins, and an anonymous referee for suggestions leading to improved testing. This work was partially supported by the European Community's Seventh Framework Programme FP7/2007-2013 under grant agreement N 223920 (Virtual Physiological Human Network of Excellence).
This article has been published as part of BMC Bioinformatics Volume 13 Supplement 3, 2012: ACM Conference on Bioinformatics, Computational Biology and Biomedicine 2011. The full contents of the supplement are available online at http://www.biomedcentral.com/1471-2105/13/S3.
Authors’ Affiliations
References
- Andrade MA, Perez-Iratxeta C, Ponting CP: Protein repeats: structures, functions, and evolution. J Struct Biol. 2001, 134 (2-3): 117-131. 10.1006/jsbi.2001.4392.View ArticlePubMedGoogle Scholar
- Marcotte EM, Pellegrini M, Yeates TO, Eisenberg D: A census of protein repeats. J Mol Biol. 1999, 293: 151-160. 10.1006/jmbi.1999.3136.View ArticlePubMedGoogle Scholar
- Björklund AK, Ekman D, Elofsson A: Expansion of protein domain repeats. PLoS Comput Biol. 2006, 2 (8): e114-10.1371/journal.pcbi.0020114.PubMed CentralView ArticlePubMedGoogle Scholar
- Coward E, Drablos F: Detecting periodic patterns in biological sequences. Bioinformatics. 1998, 14 (6): 498-507. 10.1093/bioinformatics/14.6.498.View ArticlePubMedGoogle Scholar
- Pellegrini M, Renda ME, Vecchio A: TRStalker: an efficient heuristic for finding fuzzy tandem repeats. Bioinformatics. 2010, 26 (12): i358-i366. 10.1093/bioinformatics/btq209.PubMed CentralView ArticlePubMedGoogle Scholar
- Miranke DP: Metric-space search in bioinformatics. SIGSPATIAL Special. 2010, 2: 32-35. 10.1145/1862413.1862422.View ArticleGoogle Scholar
- Halperin E, Buhler J, Karp R, Krauthgamer R, Westover B: Detecting protein sequence conservation via metric embeddings. Bioinformatics. 2003, 19 (Suppl 1): i122-i129. 10.1093/bioinformatics/btg1016.View ArticlePubMedGoogle Scholar
- Xu W, Miranker DP: A metric model of amino acid substitution. Bioinformatics. 2004, 20 (8): 1214-1221. 10.1093/bioinformatics/bth065.View ArticlePubMedGoogle Scholar
- Atchley WR, Zhao J, Fernandes AD, Drüke T: Solving the protein sequence metric problem. Proc Natl Acad Sci USA. 2005, 102 (18): 6395-6400. 10.1073/pnas.0408677102.PubMed CentralView ArticlePubMedGoogle Scholar
- Homepage of PTRStalker Data Base. [http://bioalgo.iit.cnr.it]
- Pellegrini M, Marcotte EM, Yeates TO: A fast algorithm for genome-wide analysis of proteins with repeated sequences. Proteins. 1999, 35 (4): 440-446. 10.1002/(SICI)1097-0134(19990601)35:4<440::AID-PROT7>3.0.CO;2-Y.View ArticlePubMedGoogle Scholar
- Heger A, Holm L: Rapid automatic detection and alignment of repeats in protein sequences. Proteins. 2000, 41 (2): 224-237. 10.1002/1097-0134(20001101)41:2<224::AID-PROT70>3.0.CO;2-Z.View ArticlePubMedGoogle Scholar
- Heringa J, Argos P: A method to recognize distant repeats in protein sequences. Proteins. 1993, 17: 391-411. 10.1002/prot.340170407.View ArticlePubMedGoogle Scholar
- George R, Heringa J: The REPRO server: finding protein internal sequence repeats through the Web. Trends Biochem Sci. 2000, 25: 515-517. 10.1016/S0968-0004(00)01643-1.View ArticlePubMedGoogle Scholar
- Szklarczyk R, Heringa J: Tracking repeats using significance and transitivity. Bioinformatics. 2004, 20 (Suppl 1): i311-i317. 10.1093/bioinformatics/bth911.View ArticlePubMedGoogle Scholar
- Newman A, Cooper J: XSTREAM: a practical algorithm for identification and architecture modeling of tandem repeats in protein sequences. BMC Bioinformatics. 2007, 8: 382-10.1186/1471-2105-8-382.PubMed CentralView ArticlePubMedGoogle Scholar
- Jorda J, Kajava AV: T-REKS: identification of Tandem REpeats in sequences with a K-meanS based algorithm. Bioinformatics. 2009, 25 (20): 2632-2638. 10.1093/bioinformatics/btp482.View ArticlePubMedGoogle Scholar
- Soding J, Remmert M, Biegert A: HHrep: de novo protein repeat detection and the origin of TIM barrels. Nucleic Acids Res. 2006, 34 (Web Server issue): W137-W142.PubMed CentralView ArticlePubMedGoogle Scholar
- Biegert A, Soding J: De novo identification of highly diverged protein repeats by probabilistic consistency. Bioinformatics. 2008, 24 (6): 807-814. 10.1093/bioinformatics/btn039.View ArticlePubMedGoogle Scholar
- Palidwor GA, Shcherbinin S, Huska MR, Rasko T, Stelzl U, Arumughan A, Foulle R, Porras P, Sanchez-Pulido L, Wanker EE, Andrade-Navarro MA: Detection of alpha-rod protein repeats using a neural network and application to huntingtin. PLoS Comput Biol. 2009, 5 (3): e1000304-10.1371/journal.pcbi.1000304.PubMed CentralView ArticlePubMedGoogle Scholar
- Gruber M, Soding J, Lupas AN: REPPER-repeats and their periodicities in fibrous proteins. Nucleic Acids Res. 2005, 33 (Web Server issue): W239-W243.PubMed CentralView ArticlePubMedGoogle Scholar
- Sokol D, Benson G, Tojeira J: Tandem repeats over the edit distance. Bioinformatics. 2007, 23 (2): e30-35. 10.1093/bioinformatics/btl309.View ArticlePubMedGoogle Scholar
- Kalita M, Ramasamy G, Duraisamy S, Chauhan V, Gupta D: ProtRepeatsDB: a database of amino acid repeats in genomes. BMC Bioinformatics. 2006, 7: 336-10.1186/1471-2105-7-336.PubMed CentralView ArticlePubMedGoogle Scholar
- Karlin S, Altschul S: Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. Proc Natl Acad Sci USA. 1990, 87 (6): 2264-2268. 10.1073/pnas.87.6.2264.PubMed CentralView ArticlePubMedGoogle Scholar
- Burkhardt S, Kärkkäinen J: Better filtering with gapped q-grams. Fundam Inform. 2003, 56 (1-2): 51-70.Google Scholar
- Ilie L, Ilie S: Multiple spaced seeds for homology search. Bioinformatics. 2007, 23 (22): 2969-2977. 10.1093/bioinformatics/btm422.View ArticlePubMedGoogle Scholar
- Ma B, Tromp J, Li M: PatternHunter: faster and more sensitive homology search. Bioinformatics. 2002, 18 (3): 440-445. 10.1093/bioinformatics/18.3.440.View ArticlePubMedGoogle Scholar
- Xu J, Brown DG, Li M, Ma B: Optimizing multiple spaced seeds for homology search. J Comput Biol. 2006, 13 (7): 1355-1368. 10.1089/cmb.2006.13.1355.View ArticlePubMedGoogle Scholar
- Motwani R, Raghavan P: Randomized Algorithms. 1995, Cambridge University PressView ArticleGoogle Scholar
- Mulmuley K: Computational Geometry, an Introduction through Randomized Algorithms. 1993, Prentice HallGoogle Scholar
- Smith T, Waterman M: Identification of common molecular subsequences. J Mol Biol. 1981, 147: 195-197. 10.1016/0022-2836(81)90087-5.View ArticlePubMedGoogle Scholar
- Waterman M, Eggert M: A new algorithm for best subsequence alignments with applications to tRNA-rRNA comparisons. J Mol Biol. 1987, 197 (4): 723-728. 10.1016/0022-2836(87)90478-5.View ArticlePubMedGoogle Scholar
- Linke WA: Sense and stretchability: the role of titin and titin-associated proteins in myocardial stress-sensing and mechanical dysfunction. Cardiovasc Res. 2008, 77 (4): 637-648.PubMedGoogle Scholar
- Kontrogianni-Konstantopoulos A, Ackermann MA, Bowman AL, Yap SV, Bloch RJ: Muscle giants: molecular scaffolds in sarcomerogenesis. Physiol Rev. 2009, 89 (4): 1217-1267. 10.1152/physrev.00017.2009.PubMed CentralView ArticlePubMedGoogle Scholar
- Minocha R, Studley K, Saier MH: The urea transporter (UT) family: bioinformatic analyses leading to structural, functional, and evolutionary predictions. Receptors Channels. 2003, 9 (6): 345-352.PubMedGoogle Scholar
- Dutzler R, Campbell EB, Cadene M, Chait BT, MacKinnon R: X-ray structure of a ClC chloride channel at 3.0 Å reveals the molecular basis of anion selectivity. Nature. 2002, 415 (6869): 287-294. 10.1038/415287a.View ArticlePubMedGoogle Scholar
- Neuwald AF, Liu JS, Lawrence CE: Gibbs motif sampling: detection of bacterial outer membrane protein repeats. Protein Sci. 1995, 4 (8): 1618-1632. 10.1002/pro.5560040820.PubMed CentralView ArticlePubMedGoogle Scholar
- Liu JS, Neuwald AF, Lawrence CE: Bayesian models for multiple local sequence alignment and Gibbs sampling strategies. J Am Stat Assoc. 1995, 90 (432): 1156-1170. 10.2307/2291508.View ArticleGoogle Scholar
- Wilcoxon F: Individual comparisons by ranking methods. Biometrics Bulletin. 1945, 1 (6): 80-83. 10.2307/3001968.View ArticleGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.