- Research article
- Open Access
Mining protein loops using a structural alphabet and statistical exceptionality
© Regad et al; licensee BioMed Central Ltd. 2010
Received: 7 July 2009
Accepted: 4 February 2010
Published: 4 February 2010
Protein loops encompass 50% of protein residues in available three-dimensional structures. These regions are often involved in protein functions, e.g. binding site, catalytic pocket... However, the description of protein loops with conventional tools is an uneasy task. Regular secondary structures, helices and strands, have been widely studied whereas loops, because they are highly variable in terms of sequence and structure, are difficult to analyze. Due to data sparsity, long loops have rarely been systematically studied.
We developed a simple and accurate method that allows the description and analysis of the structures of short and long loops using structural motifs without restriction on loop length. This method is based on the structural alphabet HMM-SA. HMM-SA allows the simplification of a three-dimensional protein structure into a one-dimensional string of states, where each state is a four-residue prototype fragment, called structural letter. The difficult task of the structural grouping of huge data sets is thus easily accomplished by handling structural letter strings as in conventional protein sequence analysis. We systematically extracted all seven-residue fragments in a bank of 93000 protein loops and grouped them according to the structural-letter sequence, named structural word. This approach permits a systematic analysis of loops of all sizes since we consider the structural motifs of seven residues rather than complete loops. We focused the analysis on highly recurrent words of loops (observed more than 30 times). Our study reveals that 73% of loop-lengths are covered by only 3310 highly recurrent structural words out of 28274 observed words). These structural words have low structural variability (mean RMSd of 0.85 Å). As expected, half of these motifs display a flanking-region preference but interestingly, two thirds are shared by short (less than 12 residues) and long loops. Moreover, half of recurrent motifs exhibit a significant level of amino-acid conservation with at least four significant positions and 87% of long loops contain at least one such word. We complement our analysis with the detection of statistically over-represented patterns of structural letters as in conventional DNA sequence analysis. About 30% (930) of structural words are over-represented, and cover about 40% of loop lengths. Interestingly, these words exhibit lower structural variability and higher sequential specificity, suggesting structural or functional constraints.
We developed a method to systematically decompose and study protein loops using recurrent structural motifs. This method is based on the structural alphabet HMM-SA and not on structural alignment and geometrical parameters. We extracted meaningful structural motifs that are found in both short and long loops. To our knowledge, it is the first time that pattern mining helps to increase the signal-to-noise ratio in protein loops. This finding helps to better describe protein loops and might permit to decrease the complexity of long-loop analysis. Detailed results are available at http://www.mti.univ-paris-diderot.fr/publication/supplementary/2009/ACCLoop/.
Protein structures are classically described using secondary structures: α-helices, β-strands and loops, also called coils. This third class is a default description, which denotes all residues that are not involved in periodic local structures, helices or strands. On average, protein loops encompass 50% of residues. Protein loops are often involved in protein functions . They participate in active sites of enzymes  and in molecular recognition [3, 4]. They are often the place of binding sites: for example, the ATP and GTP-binding site (P-loop motif) and the calcium-binding site (EF-hand motif) are found in loops [5–8]. The description and analysis of protein loops have been the subject of many studies. Protein loops were first seen as random because they are highly variable in terms of sequence and structure and are subject to frequent insertions and deletions [9, 10]. Because of their large variability, loops are the protein regions which are the most difficult to analyze and modelize. Indeed, in protein models, loops, and more particularly long loops, are the place of a lot of errors.
Systematic studies actually showed that loops, even long ones, are far from random. In their study, Panchenko et al. (2004) analyzed the evolution of protein loops and identified a linear correlation between sequence similarity and average loop structural similarity in protein families . They suggested that the evolution of loops is made via an insertion/deletion process and concluded that even longer loop regions cannot be defined as "irregular conformations" or "random coils".
The resolution of an increasing number of protein structures allowed the classification of short loops (3 to 12 residues) according to their geometry, and gave birth to several loop classification systems: Sloop [12–14], Wloop[15, 16], ArchDB[17–19], Li et al. classification [20, 21]. These different classification initiatives were based on different criteria such as loop length [12, 14, 15, 17, 18], flanking region type [12, 14, 17, 18, 20, 21], flanking-region geometry [12, 14, 17, 18], or loop conformation [17, 18]. The majority of the resulting loop clusters presented a significant sequence signature. These classifications thus revealed the existence of recurrent loop conformations with amino-acid dependence. However, these classifications focus on short and medium loops (less than 12 residues) and do not take long loops into consideration.
Another type of studies focused on specific structural motifs extracted from loops such as β-turn [22–25], β-hairpin [26–29], helix-turn-helix , helix-turn-strand , or ω-loop [1, 32]. The most frequent motif is β-turn. It corresponds to 25% of residues . Other turn types have been identified such as γ-turn [34–36] or α-turns [37, 38]. Recently, Golovin et al. (2008) proposed a web application that allows identifying known small structural motifs characterized by hydrogen-bonds (alpha-beta motif, asx-motif, beta-bulge, beta-bulge-loop, beta-turn, catmat, gamma-turn, nest, schellmann-loop, st-motif, st-staple, st-turn) from a query protein . A database of these structural motifs extracted from a set of 400 representative proteins is now available . All these studies were dedicated to particular -and known- small structural motifs, but did not perform a systematic analysis of all loops.
In a previous study, we have shown that the structural alphabet HMM-SA (Hidden Markov Model-Structural Alphabet) is an effective tool to simplify loop structures with good accuracy . Structural alphabets constitute a privileged tool to discretize 3D structures including loop regions, with an accuracy that depends on the size of the fragment library . HMM-SA is a collection of 27 structural prototypes of four residues called structural letters, permitting the simplification of all three-dimensional (3D) protein structures into uni-dimensional (1D) sequences of structural letters .
Here, we present an extensive analysis and description of both short and long loops based on the analysis of structural motifs extracted from loops. The systematic extraction of seven-residue structural motifs is based on the loop decomposition in structural letters provided by HMM-SA. Thanks to this decomposition, structural motifs are described as patterns of structural letters, called structural words. This representation as structural words permits to partition the full space of loop conformations, independently of their length, in clusters represented by distinct words. We first present general results concerning structural words: repartition of clusters and intrinsic characteristics of structural words such as structural variability and sequential specificity. Then, we present the analysis of the link between structural words and loop types. In order to gain further insight into the high complexity of loop structures, we complement our analysis with an original approach based on statistical exceptionality implemented in the SPatt software . The idea is to compute, for each structural motif, a score that is a measure of its "unusualness" with respect to some background model. The goal is to assess whether some structural motifs are more or less frequent than expected. This is directly inspired by analogous studies of sequence patterns in genomes [44, 45], that permitted the discovery of functional patterns such as restriction sites , cross-over hot spot instigator sites  and polyadenylation signals . Finally, this systematic structural-alphabet decomposition and word analysis provide an accurate description of loops and allows extracting meaningful motifs in both short and long loops, which is an important contribution to the difficult task of long loop analysis.
We extracted all structural motifs within loops from a non-redundant data set of 8186 protein chains, using the structural alphabet HMM-SA. This alphabet is a collection of 27 prototypes of four residues, denoted [A-Z, a], based on a hidden Markov model [40, 42]. It permits the encoding of a protein structure of n residues into a sequence of (n - 3) structural letters.
Loop structures extracted from our protein data set were encoded into structural-letter sequence using HMM-SA. Each encoded loop was then decomposed into overlapping structural words, i.e. series of k consecutive structural letters, corresponding to k - 3 residue fragments. Thus, structural words can be seen as a way of clustering the fragments. Each cluster of fragments is defined by a structural word. The first step of this work is the determination of the optimal length of fragments/words.
Choice of the structural word length
The choice of the optimal length was guided by the following dilemma. On the one hand, it is desirable to consider long fragments, in order to better describe 3D conformation and capture the longest-range interactions. On the other hand, the amount of available data rapidly becomes insufficient when dealing with long fragments. To choose this optimal length, we computed the frequency of all structural words in our data set, with length from five residues (two-structural letters) to ten residues (seven-structural letters), see Additional file 1. We identified seven residues as the maximum length to avoid the problem of data sparsity. The number of different structural words sharply increases beyond that limit and 80% of structural words of 8 residues are seen at most 6 times in our data set, versus 34 times for words of 7 residues. For these reasons, we selected seven residues, i.e., four structural letters as the most meaningful length for systematic extraction.
First Part: Global results on structural words
We systematically extracted structural words of four structural-letters from protein loops and analyzed their properties: structural variability, amino-acid specificity and preference for particular loop types.
Extraction of structural words from loops
Quantification of the structural word extraction from the non-redundant data set.
Number of words
Number of fragments
All-loop coverage rate
Short-loop coverage rate
Long-loop coverage rate
Loops containing at least one word
Short loops containing at least one word
Long loops containing at least one word
Loop coverage by W set≥30words
In this part, we check if the elimination of rare words does not result in (i) a dramatic diminution of loop coverage or (ii) a loss of diversity in structural families.
At first, we can observe that the selection of W set≥30 words does not favor any loop length: the distribution of loop lengths in W set≥30 is similar to the global loop-length distribution (cf. Additional file 1).
Global loop coverage
(cf. Materials and Methods). Words from W set≥30 encompass 60% of the fragments. However, since we extracted overlapping fragments, the coverage rate of loop structures is more than 60%: if a loop of 8 structural letters is described by two W set≥30 words on positions 1 to 4 and 5 to 8, the actual coverage is 100% even if only 2 out the 5 overlapping fragments are represented by frequent words.
Coverage rates are reported in Table 1. The limited number of words seen more than 30 times (3310) covers most loop, namely 73% of loop lengths. If we make the distinction between short loops (up to 12 residues) and long loops (longer than 12 residues), we can see that W set≥30 words cover both short and long loops. If we now consider loops that contain at least one W set≥30 word, W set≥30 words partially describe 85% of all loops -80% of short loops and 98% of long loops.
The consideration of the restricted set W set≥30 thus allowed us to get rid of clusters with high positional uncertainty while still covering a large fraction of protein loops.
SCOP superfamily coverage by W set≥30words
Population of SCOP superfamilies before and after elimination of rare conformations
Nb superfamilies with less than 30 members
Consequently, we can conclude that the systematic extraction of structural words shows that most loops can be described by a limited number of frequent four-structural-letter words.
Structural and amino-acid conservation of words
The next step consists in analyzing the intrinsic structural and sequential properties of structural W set≥30 words. We considered the following properties: structural variability of the fragments, and dependence to their amino-acid sequence.
Structural properties of words
Structural and sequential properties of words in W set≥30 according to the statistical word type
Average RMSd w (Å)
(± standard deviation)
Average RMSd dev (Å)
(± standard deviation)
(± standard deviation)
(± standard deviation)
(± standard deviation)
Amino-acid preferences of words
Intra-word amino-acid specificity is assessed using Z-score computation as described in Material and Methods. Briefly, we computed Z-scores for the 20 amino acids at the 7 positions of a structural word. We then considered the maximum Z-score, denoted Zmax, measuring the strongest amino-acid specificity, and the number of significant positions, denoted nbpos*, indicating how many positions exhibit significant sequence specificity. As shown in Table 3, the global average Zmax (resp. nbpos*) is equal to 10.3 (resp. 3.3). Almost every word (97%) present at least one significant position (Zmax ≥ 4) and 19% of words have at least one very significant position (Zmax ≥ 14). Conversely, only 3% of words (89 words covering 2% of loops) have no informative position. Among the sequence-informative words, 198 words (6% of recurrent words) are highly informative, as all their positions are significant. These very informative words cover 16% of loops. Words with high Zmax contain structural letters D and S, in agreement with the fact that these two letters have very strong sequence specificity . Thus we can conclude that most loops are composed of motifs with amino-acid specificities.
Correlation between structural variability and sequential specificity
words are characterized by both low structural variability and significant sequential specificity, with RMSd w lower than 1 Å and Zmax greater than 4. These structural words cover 63% of loop regions. We can conclude that most loops are composed of motifs with a weak variability and amino-acid specificities.
Relation between structural words and loop type
After exploring the intrinsic structural and sequential properties of structural words, we analyzed their relationship with different loop types seen in proteins. We defined different loop-types according to their lengths and flanking secondary-structures [14, 15, 17, 18].
Preference of structural words in W set≥30 according to the loop types as assessed by the KLD criterion and the associated loop coverage rate (on a per structural letter basis).
Loop words specificity
UR w 7
NS w 7
OR w 7
Shared words 1
We now consider the four possible flanking regions for a loop: ββ : loops linking two β-strands, αβ: loops linking an α-helix and a β-strand, αα : loops linking two α-helices and βα: loops linking a β-strand and an α-helix. We found that about 60% of W set≥30 display a significant preference for one of the four-flanking-region types. This word set permits to cover about 59% of loops. Thus, about half of the loops are described by flanking-region-specific words.
Loop length × flanking regions
We then combine the loop length and loop type descriptors to distinguish eight types of loops. According to the KLD criterion, 2543 words (80% of W set≥30) exhibit a significant preference for one of the eight loop-types. This significant word set covers more than half of the loops (66%).
Loop-type preferences × intrinsic properties
Structural and sequential properties of loop-type specific words in W set≥30
shared words a
short-long specific words
long-long specific words
flanking-region unspecific words
flanking-region specific words
Average RMSd w (Å)
(± standard deviation)
(± standard deviation)
(± standard deviation)
We can note that only 44 words (1% of the W set≥30 words) have neither amino-acid-significant position, nor loop-type preference. Thus, less than 1% of loop regions are covered by these unspecific words in terms of sequence dependence and loop types.
Our approach, which relies on a systematic decomposition of short and long loops, allowed showing loops are composed of recurrent structural motifs, some of them with preference for a particular loop type in terms of loop length and/or flanking regions. Conversely, some structural words have no preference for a loop length, meaning that they are similarly found in short and long loops.
Second part: Statistical exceptionality of structural words
In the second part of this study, we complement our analysis of word properties by their statistical exceptionality in protein structures represented by strings of structural letters. Statistical exceptionality is traditionally used in genome analysis to extract functional motifs such as enzyme restriction sites or regulatory motifs [44–48]. Our goal was to explore if a statistical bias is also associated to specific properties in the case of protein structures. Statistical exceptionality does not measure the frequency of a word. It is an indicator of the discrepancy between observed and expected occurrence according to a background model that takes into account the first order Markovian process between structural letters. The statistical representation of words was assessed using the SPatt software that computes an exceptionality score L p for each word (see Material and Methods). According to the value of L p , words are classified as over-represented, under-represented or not significant. Hereafter, over-represented words are referred to OR w , under-represented words as UR w and not significant words as NS w .
Extraction of exceptional words
The analysis of the correlation between the frequencies (i.e. cluster size) and L p values for all words in the data set shows that many frequent words tend to be over-represented but there is no linear relation between frequency and exceptionality (cf. Additional file 1). Some frequent words are classified as UR w or NS w , like FFFF (seen 537 times, L p = -2.8). Conversely, some rare words are classified as OR w , like GDZI (seen 64 times, L p = 102.2). An illustration of the geometry of these words is presented in Figure 1. This result shows the relevance of the extraction of word exceptionality instead of word frequency.
The repartition of words in W set≥30 according to exceptionality status is given in Table 1. We can see that OR w contribute predominantly to the set of fragments in W set≥30: 40% of the fragments are in OR w clusters. OR w clusters are indeed significantly bigger than other word types (cf. Table 1).
Redundancy of loops and robustness of the extraction method
In this study, loops were extracted from a non-redundant data set presenting less than 50% sequence identity. Different redundancy levels have been used in the literature. Concerning loop classifications, Wloop used a protein data bank with 50% sequence identity. The loop classification system ArchDB is available in two versions: one built on a set of proteins with 40% sequence identity and the second on a redundant-protein set with 95% sequence identity . It is classically considered that the evolutionary relationship between two proteins is detectable up to 25% sequence identity. Consequently this cut-off is frequently used for calibrating prediction methods . Since loops are more variable than the rest of the protein sequence, we set the identity cut-off at 50% in order to work with as many data as possible with limited redundancy.
One could object that no attention was given to how many redundant loops were left or removed from the database during the redundancy filtering. The problem of loop redundancy is a non-trivial one: the extraction of loops from a non-redundant protein set does not necessarily result in a non-redundant loop set, and loop redundancy is itself difficult to quantify. We indirectly addressed this question by repeating our systematic extraction on different data sets, using identity levels of 25% and 80%. It was also important to ensure that our observations were applicable to protein structures in general and not only to the data set used. Taking into account the correction due to the different database sizes (see Method), we found a satisfactory level of consensus equal to 82% between the 25% and 50% databases, and 90% between the 50% and the 80% databases (more details are given in Additional file 1). These ratios refer to the proportion of recurrent words - common to both data sets - that are classified in the same statistical word type (over-presented/not significant/under-represented). Moreover, only one word, QLHB, was assigned as over-represented in a data set and under-represented in the other. Therefore, we can conclude that the extraction of exceptional words is robust and very weakly depends on the redundancy of the data set. Then, we compared the properties of the W set≥30 words after classification into these three classes.
Exceptionality and word properties
The structural and amino-acid property measures for the three statistical word types (OR w , NS w and UR w ) are reported in Table 3.
The coverage of the structural space by the structural words of different exceptionality status is assessed by the RMSd between clusters. The goal is to evaluate how well the structural words sample the conformational space of loops. In order to assess the coverage of the loop-conformational space, we computed the RMSd between all pairs of words in the W set≥30, denoted RMSd dev . The average RMSd dev computed for each type of words is given in Table 3. The average RMSd dev for words in W set≥30 is equal to 2.7 Å It is significantly greater than the average RMSd w , indicating that the structural variability of words is low compared to the structural differences between words. This observation stands for the three types of words. RMSd dev were computed between every words of W set≥30, and the resulting 3310 × 3310 dissimilarity matrix is used to compute Sammon's map projections shown in Figure 3b. It can be seen that the three statistical word types all sample the conformational space in the same way. It means that OR w correctly sample the W set≥30 conformational space and are not restricted to some particular shapes. Let us note that RMSd are dissimilarity measures that do not necessarily respect the triangular inequality. A consequence is that the Sammon's projection does not actually reflect the word's proximity (words separated on the map can be structurally close). However, since the three point series are simultaneously projected on the same subspace, Sammon's maps can be used to qualitatively assess the similarity between the conformational sampling. We can thus conclude that OR w are, on average, significantly more structurally stable than other words, and sample all the conformational space.
The coverage of sequence space by the different structural words is assessed using a procedure similar to the one used for structural space. We computed the Euclidean distances between Z-score vectors of each word pair in W set≥30. The resulting average distances are given in Table 3. The Kruskal-Wallis test indicates that, in terms of amino-acid specificity, OR w are significantly more distant one from the other (p-value <2.2-16, cf Table 3). Sammon's map projections of the three word-types are shown in Figure 4b. We can see that OR w cover a large region of the map, including regions not visited by NS w and UR w . We can conclude that OR w are globally more distinct from each other in terms of amino-acid sequence dependence than other words and that they sample the sequence space better than other word types.
Exceptionality and loop types
As shown in Table 1, OR w significantly contribute to the description of long loops: OR w cover about 40% of both short and long loops. Moreover, 58% of the loops contain at least one OR w , and as many as 80% of long loops contain at least one OR w . If we consider the specificity of words for a particular loop length (cf. Table 4) it can be seen that 260 OR w are specific to long loops and 233 OR w are specific to short loops. It means that 493 OR w out of 930, i.e. 53% of OR w , exhibit a significant preference for a loop-length type. This proportion should be compared to what is obtained for other words: 31% of NS w and 28% of UR w are significantly dependent on a particular loop length range. If we consider the flanking secondary-xstructures, the same observation can be made: 70% of OR w versus 52% of NS w and 45% of UR w are specific to a particular loop type. It thus seems that OR w exhibit stronger dependence toward the loop type than other statistical word-types.
Finally, we compared the preference of the three word-types for the eight loop-types defined by length range and flanking secondary-structures. We found that 88% of OR w versus 72% of NS w and 75% of UR w exhibit a significant dependence for a particular loop type. The qualitative analysis by correspondence analysis is displayed in Figure 2, where the three statistical word types are highlighted in different colors. It can be seen that OR w predominantly appear in outlying regions of the plot, in agreement with the KLD quantification.
Therefore, we can conclude that OR w present higher signature in terms of structure and/or sequence and higher dependence to loop types than other words. At the same time, OR w correctly sample all the loop-conformational space, and better cover the sequential space of protein loops. They are seen in every loop type and offer a reasonable coverage rate, with only 930 different structural motifs.
Discussion and Conclusion
In this study, we have developed an original approach for the analysis and the description of loop structures. This approach corresponds to a systematic extraction and statistical analysis of seven-residue structural motifs within loops, using a structural-alphabet simplification. Contrary to classic approaches, our method does not require either loop-structural alignment or computation of structural parameters. The structural word approach defines a structure-based clustering of all fragments, where all seven-residue fragments encoded in a similar word can be seen as a cluster. Our systematic clustering resulted in 28274 clusters, with 1 to 1633 fragments per cluster, and an average size equal to 15. The analysis of B-factors showed that some of the singletons are indeed associated to regions with high B-factors, which is indicative of coordinate uncertainty. It was thus legitimate to exclude them from the analysis.
In order to compute cluster properties, we chose to restrict ourselves to the 3310 clusters (= 12% of clusters) with more than 30 fragments, referred to W set≥30. This reduction was required to have a sufficient number of fragments to compute RMSd and sequence profiles for clusters. This limited number of structural words (3310) results in a good coverage rate of the loops: 73% of loop-lengths. We additionally checked that the restriction to W set≥30 does not result in the restriction to highly populated structural families, and that our results are stable on different data sets.
Comparison with existing approaches
An extensive comparison with already existing loop classification schemes is extremely difficult because we do not consider the same objects, and pursue different objectives. Existing classifications cluster loops according to their length [12, 14, 15, 17, 18], flanking region types [12, 14, 17, 18, 20, 21], flanking region geometry [12, 14, 17, 18] and loop geometry [17, 18]. Such classifications consider full length loops and are thus inherently limited to short loops. In the present study, we cluster fixed-length structural motifs within loops, independently of their lengths or flanking regions, thus also bringing information for long loops. Consequently, it is delicate to compare our loop analysis with existing loop classifications.
Other studies have previously investigated the use of seven-residue fragments to analyze protein structures [55, 56] whereas our study focuses on loop structural fragments. For this reason, the results are not directly comparable.
Other studies consisted in identifying functional patterns in whole proteins [57, 58]. Such patterns, involved in protein function, are relatively rare. On the contrary, our approach considers recurrent structural motifs in loops. Alternatively, some groups have investigated the identification of 3D structural patterns linked to functions that are not necessarily made of consequent residues [59–63]. For example, Ausiello et al. (2009)  extracted some structural motifs from protein in different folds which recognize ligands presenting same features. In this case also, the studied objects are very different, making the comparison difficult. Another interesting analysis, MegaMotifBase, deals with structural motifs that are important for the preservation of the 3D structure in given families or superfamilies . These motifs were identified using both sequence conservation and preservation of important structural features. They mainly correspond to regular secondary structures, whereas we focused our analysis on loops. For all these reasons, any comparison between our approach and already existing classifications should be regarded with caution.
Insight into loop structures
We analyzed structural and amino-acid properties of clusters, defined by structural words, using RMSd and different criteria to measure their amino-acid dependencies. We found an average intra-cluster RMSd w equal to 0.85 Å versus 2.72 Å for the inter-cluster RMSd dev , which confirms our previous results . In the loop classification ArchDB clusters grouping seven-residue loops present an average RMSd close to 1 Å. In Sander et al. , fragments were clustered according both to their structure and amino-acid sequence into 27 clusters with an average RMSd of 1.19Å. The most populated cluster groups α-helix fragments and probably largely contribute to the average RMSd.
Loop description by recurrent structural words permits a quantification of the loop structural redundancy: around 73% of loops are described by a limited number of accurate recurrent structural words. Thanks to the loop-structure simplification using HMM-SA, our method is the first one allowing a systematic mining of loops independently of their lengths and the study of all loops in terms of motif composition.
First, we demonstrate that the majority of the recurrent structural words have low structural variability and specific sequence signature. The simplification of loop structures using HMM-SA permits to analyze long loops. We can observe that 46% of loops are covered by words found both in short and long loops. These results show that short and long loops are composed of similar motifs. This is in agreement with the insertion/deletion process of loop evolution hypothesis made in . In addition to the identification of the shared structures, our analysis provides a quantification of how the same structural words are re-used in different loops. The existence of words found in both long and short loops could allow transposing some short-loop results into the long-loop analysis and decreasing the long-loop-analysis complexity.
We observe that only one third of short (resp. long) loops are covered by words that are specific to short (resp. long) loops. Moreover, words specific to short loops have higher amino-acid specificities than other words. That means that these short loop regions (30% of short loops) are more informative in terms of sequence than other regions. Interestingly, words that are specific to long loops are structurally less variable than others meaning that a part of long loops (34%) are structurally well defined.
We also analyze the dependence between recurrent words and the loop flanking-regions. We show that around 60% of words exhibit a significant preference. Most of these words are specific to βα and ββ loops. These results are in agreement with classification of short loops based on flanking region information as [12, 14, 15, 17, 18, 20, 21] and provide an identification and quantification of the structures with a dependence on the flanking regions. Moreover, this study allows identifying and quantifying regions with no preference for flanking-region types. Indeed, 31% of loops are covered by words with no preference for a flanking-region type.
The amino-acid specificities of structural words were also assessed. We observed that 97% of recurrent words, covering 70% of loops, have amino-acid specificities. Different studies have analyzed the amino-acid preferences of loops, particularly for short loops. Kwasigroch et al. (1997) have shown that amino-acid preferences were more frequent in the core of short loops [15, 16]. Other studies have focused on the amino-acid preferences of β-turns and shown that these amino-acid preferences occurred at end positions [25, 67]. This study provides an identification of regions with amino-acid specificities and a new quantification of the amino-acid specificity: we found an average number of three positions with significant amino-acid preference for W set≥30 motifs.
Perspective in terms of loop-structure prediction
Most recurrent motifs exhibit significant amino-acid specificities: half of them display significant level of amino-acid conservation in at least four significant-positions. If we consider words with at least four significant-positions as predictable, we extract 1359 words covering 60% of the loops (on a per-structural letter basis). It is clear that this predictability index (at least four significant positions) is very basic and too optimistic. The predictability index of a word has to combine both its sequence informativity and sequence specificity. Indeed, one word can have several positions with high amino-acid preferences but close sequence from other words. Conversely, words with few informative positions can be clearly distinguishable from others in terms of sequence. Moreover, several words can be compatible with a same seven-residue sequence, involving several candidates per amino-acid sequence. A possible strategy for loop prediction would consist in splitting the query sequence into overlapping seven-residue fragments, and identifying subset of structural words compatible in terms of sequence profile with each fragment.
The successions of compatible overlapping word candidates would then be selected using a hidden Markov model taking into account the favorable transitions between structural words. This would result in a 1D structural letter trajectory set compatible with the target loop sequence. Then, the 3D reconstruction from this set of 1D trajectories could be achieved using an energy function as in PEPfold . This approach could yield a set of 3D structural conformation candidates for the target loop, in agreement with the flexibility of loops. Finally, for long loop prediction, a confidence index could be proposed for different parts of the predicted loop. Indeed, for a given loop, prediction of some regions could result in a limited number of word candidates while for other regions, the prediction could result in a large number of word candidates. This approach could be a way to decrease the complexity of long-loop prediction.
Illustrative Example of loop analysis
This example shows that some motifs extracted from loops seem to be involved in protein function. It is not surprising due to the fact loops are often involved in protein function.
Perspective of functional-motif identification
In genomic sequences, functional motifs are often characterized by particular frequencies (rare or very frequent). Therefore, the search for functional motifs is successfully guided by the search for exceptional motifs [44, 45]. Inspired by this singularity, we explored the properties of structural words in proteins to see if the over- or under-representation of particular conformations can be linked to particular features. Contrary to classic methods that were primarily developed for DNA sequences, statistics are here computed by a method that takes into account the large number and short length of sequences of our data set . We considered the intrinsic properties of structural words and their relationship with the statistical exceptionality status of words, classified as over-represented, under-represented, or not significant. The comparison of the three statistical word types showed that over-represented words have indeed specific properties: they are highly conserved in terms of structure or sequence and highly dependent on loop types. By setting a RMSd w cut-off equal to 0.74 Å and a Z-max cut-off equal to 14, we found that 89% of over-represented words present either a low RMSd or a high Zmax or a significant dependence to a loop type defined by eight types according to the KLD criterion. This ratio is only 62% for other words. This indicates that statistical exceptionality results from a complex process combining word frequency, sequence and/or structure properties. The consideration of statistical exceptionality thus enhances the signal-to-noise ratio in protein loops. Most of the time, the relationship between local structures and protein function is not straightforward. Our findings open new perspectives to the use of over-representation in order to detect functional motifs in loops. It is the subject of an ongoing study (Regad et al, in preparation) where we suppose that functional motifs could correspond to over-represented motifs in a protein family.
We used a data set of protein structures corresponding to chains presenting less than 50% of sequence pairwise identity extracted from PDB of May 2008. The data set is composed of 8186 protein chains of at least 30 residues, obtained by X-ray diffraction with a resolution better than 2.5 Å. Proteins for with missing residues or alternate conformations were removed.
Structure simplification using HMM-SA
Our structural alphabet, HMM-SA, is a library of 27 structural prototypes of four residues, called structural letters, established using a hidden Markov model [42, 70]. Thanks to HMM-SA, the 3D structure of a protein backbone is simplified into a sequence of structural letters. The simplification relies on Cα positions only: each four-residue fragment of the protein structure is described by four inter-Cα distances. Consecutive four-residue fragments are overlapping on three residues resulting in one common distance. The resulting distances are the input of a hidden Markov model, and the 3D structure is translated as a sequence of 1D structural letters. This translation is made using the Viterbi algorithm  and takes into account both the structural similarity of the fragments with the 27 structural letters of the structural alphabet and the preferred transitions between structural letters. A protein structure of n residues is then simplified as a sequence of (n - 3) structural letters. The 27 structural letters, named [A-Z, a] are shown in Figure 1. It has been shown previously , that four structural-letters, [a, A, V, W], specifically describe α-helices, and five structural letters, [L, M, N, T, X], specifically describe β-strands. The remaining 18 structural letters [B, C, D, E, F, G, H, I, J, K, O, P, Q, R, S, U, Y, Z] allow accurately describing loops. Some transitions between structural letters are not possible, which results in a limited number of pathways between letters and in a limited number of short patterns of structural letters.
Extraction of structural motifs within loops
Following our previous study , loops are identified as series of structural letters linking simplified regular secondary structures (α-helices and β-stands) that are defined using regular expressions of structural letters. This approach permits to extract a bank of 93396 simplified loops ranging from 4 to 82 structural letters with an average length of 8.5 ± 5.5 structural letters, corresponding to an average length of 11.5 ± 8.6 residues. A loop of l structural letters corresponds to (l + 3) residues. Long loops -more than 12 residues- represent 28% of the loops in our data set. 39% of the loops are linking two β-strands, 23% are linking a β-strand to an α-helix, 22% an a-helix to a β-strand, and 16% two α-helices. The extraction of structural motifs in loops is illustrated in Figure 1. Simplified loops are split into series of overlapping words of four structural-letters, i.e., seven residues. A loop of l structural letters is then split into (l - 3) words. As we focus on structural motifs within loops, words beginning or ending with a structural letter specific to regular secondary structures [AaVWLMNTX] are excluded. This results in a global set of 28274 structural words describing all loops in the simplified structural alphabet space. The structural words thus define a partition of the structural diversity of loops, where each four-structural-letter word is a cluster of seven-residue fragments.
Loop coverage by structural words
The coverage rate of loops by a word set corresponds to the percentage of loop structural-letters covered by these words.
For example, given two loops of 11 (l11) and 15 (l15) structural letters and a set of recurrent 4-structural-letter words (S w ). Loop l11 contains two words of S w on positions 1 to 4 and 8 to 11. As these two words are not overlapping, they cover 8 structural letters. Loop l15 contains three words of S w on positions 1 to 4, 3 to 6 and 9 to 12. As the first two words are overlapping, these three words cover 10 structural letters. Thus, the coverage rate of these two loops by S w is equal to = 69%.
This coverage rate is used in order to provide information on loop description by a set of structural words.
Structural variability of words
The structural variability of a structural word is measured by the geometric variability of the seven-residue fragments encoded by that word, computed using C α Root-Mean-Square deviation (RMSd w ). It is obtained by computing the average RMSd w between 30 randomly selected fragments in the cluster. It is only computed for words seen more than 30 times.
The structural dissimilarity between two words is similarly measured by the average C α Root-Mean-Square deviation (RMSd dev ) between 30 fragment pairs randomly selected within pairs of seven-residue fragments encoded by the two words. The word-structure-space coverage is analyzed by a Sammon's map  performed using the C α RMSd dev dissimilarity matrix
Sequential specificity of words
Although the structural-alphabet decomposition into structural word is purely geometrical, it is still possible to analyse the sequence-to-structure dependence a posteriori. This is achieved using Z-score computation.
For a word w, we compute a Z-score for each of the 20 amino acids at each of the 7 positions of fragments corresponding to the word.
where N w is the frequency of w and N is the total number of words in the whole data set.
To analyze the significance of a Z-score, the expected frequency (Na,ℓ, w) must be greater than 5. A positive Z-score corresponds to an over-representation of the amino acid, and a negative one corresponds to an under-representation of the amino acid.
A word is thus described by a vector of 140 (7 positions × 20 amino acids) Z-scores. From these 140 Z-scores, two criteria are used to assess the amino-acid informativity of each word. The first criterion, denoted Zmax, corresponds to the maximum Z-score among the 140. It measures the strongest amino-acid specificity among the 7 positions of a word. The second criterion, named nbpos*, 1 ≤ nbpos* ≤ 7, corresponds to the number of positions of word w where at least one amino acid is significant in terms of Z-scores. Significance cut-off is set to 4 using Bonferroni correction. It should be noted that this second criterion underestimates the sequence informativity because of the limitation introduced by the Z-score validity condition (only Z-scores with expected frequency (Na,ℓ, w) higher than 5 can be considered for significance).
To check if two words have close amino-acid-sequence preferences, the Euclidean distance between their 140 Z-score vectors is computed . The coverage of sequence specificity of words is analyzed by a Sammon's map performed using this Euclidean distance .
Loop type specificity of words
where pw, ℓ, denotes the relative frequency of word w in loop type ℓ and pℓ, the relative frequency of loop type ℓ among all loops. The KLD is equal to 0 if is w is similarly distributed in every loop type and increases with loop type dependence. The significance of KLD value is assessed by a chi-square test, since the quantity 2 × N w × KLD(w) follows a chi-square with N w - 1 degrees of freedom. Thus, words associated to specific loop types have significant KLD values. A correction is introduced using False Positive Rate (FPR) to take into account multiple testing. A correspondence analysis is used to visualize the main relationships between words and loop types.
Loop-word statistical exceptionality
where N(w) is the expected frequency of the word w, and N w its observed frequency. An over-represented word has a positive L p value and an under-represented word has a negative L p value. For example, an L p equal to 21.3 means that the word is over-represented with a p-value equal to 10-21.3. A L p equal to -17.7 means that the word is under-represented with a p-value equal to 10-17.7. The L p threshold for statistical significance is set to 5.94, using the Bonferroni adjustment to take into account multiple tests. This permits to classify words as over-represented (L p > 5.94), under-represented (L p < -5.94) or not significant (-5.94 ≤ L p ≤ 5.94).
As explained in , pattern significance scores tend to increase with the considered database size. This is due to the fact that a tail distribution event like the one we usually consider in pattern problems (i.e. pattern with small p-value) falls within the range of the Large Deviations theory [76, 77] which means that its probability p to occur can be approximated by p ≃ exp(-ℓI) where I is a real positive rate and ℓ is the database size. As a consequence we have log p ≃ -ℓI which is exactly the pattern score we consider (up to a constant multiplier). It is hence obvious that extreme pattern scores will increase in magnitude linearly with database size. If this is not a problem when we perform a pattern analysis on a single database, this bias has obviously to be corrected in order to compare results from two different databases. The correction simply consists in using one of the database as a reference and rescaling the pattern scores obtained on the second database by the appropriate ratio of sizes.
The authors want to express their appreciation and wish to acknowledge Pr. Philippe Deureumaux, Pr. Gilles Labesse, Dr. Jacques Chomilier, Dr. Joel Pothier for helpful discussions, Dr. Christelle Reynès and Dr. Joel Pothier for their critical reading of the manuscript, and Dr. Gaelle Debret for her help. The authors also wish to acknowledge the anonymous reviewers for their thoughtful remarks that helped to improved the manuscript. LR had a grant from the Ministère de la Recherche. JM had a grant from INRA.
- Fetrow JS: Omega loops: nonregular secondary structures significant in protein function and stability. FASEB J 1995, 9: 708–717.PubMedGoogle Scholar
- Johnson LN, Lowe ED, Noble ME, Owen DJ: The Eleventh Datta Lecture. The structural basis for substrate recognition and control by protein kinases. FEBS Lett 1998, 430: 1–11. 10.1016/S0014-5793(98)00606-1View ArticlePubMedGoogle Scholar
- Bernstein LS, Ramineni S, Hague C, Cladman W, Chidiac P, Levey AI, Hepler JR: RGS2 binds directly and selectively to the M1 muscarinic acetylcholine receptor third intracellular loop to modulate Gq/11alpha signaling. J Biol Chem 2004, 279: 21248–21256. 10.1074/jbc.M312407200View ArticlePubMedGoogle Scholar
- Kiss C, Fisher H, Pesavento E, Dai M, Valero R, Ovecka M, Nolan R, Phipps ML, Velappan N, Chasteen L, Martinez JS, Waldo GS, Pavlik P, Bradbury AR: Antibody binding loop insertions as diversity elements. Nucl Acids Res 2006, 34: 132–146. 10.1093/nar/gkl681View ArticleGoogle Scholar
- Saraste M, Sibbald PR, Wittinghofer A: The P-loop: a common motif in ATP- and GTP-binding proteins. Trends Biochem Sci 1990, 15: 430–434. 10.1016/0968-0004(90)90281-FView ArticlePubMedGoogle Scholar
- Via A, Ferre F, Brannetti B, Valencia A, Helmer-Citterich M: Three-dimensional view of the surface motif associated with the P-loop structure: cis and trans cases of convergent evolution. J Mol Biol 2000, 303(4):455–465. 10.1006/jmbi.2000.4151View ArticlePubMedGoogle Scholar
- Stuart D, Acharya K, Walker N, Smith S, Lewis M, Phillips D: Lactalbumin possesses a novel calcium binding loop. Nature 1986, 324: 84–87. 10.1038/324084a0View ArticlePubMedGoogle Scholar
- Golovin A, Henrick K: MSDmotif: exploring protein sites and motifs. BMC Bioinformatics 2008, 9: 312–312. 10.1186/1471-2105-9-312View ArticlePubMedPubMed CentralGoogle Scholar
- Benner SA, Gerloff D: Patterns of divergence in homologous proteins as indicators of secondary and tertiary structure: a prediction of the structure of the catalytic domain of protein kinases. Adv Enzyme Regul 1991, 31: 121–181. 10.1016/0065-2571(91)90012-BView ArticlePubMedGoogle Scholar
- Benner SA, Cohen MA, Gonnet GH: Empirical and structural models for insertions and deletions in the divergent evolution of proteins. J Mol Biol 1993, 229: 1065–1082. 10.1006/jmbi.1993.1105View ArticlePubMedGoogle Scholar
- Panchenko AR, Madej T: Structural similarity of loops in protein families: toward the understanding of protein evolution. BMC Evol Biol 2005, 5: 10. 10.1186/1471-2148-5-10View ArticlePubMedPubMed CentralGoogle Scholar
- Donate LE, Rufino SD, Canard LH, Blundell TL: Conformational analysis and clustering of short and medium size loops connecting regular secondary structures: a database for modeling and prediction. Protein Sci 1996, 5(12):2600–2616. 10.1002/pro.5560051223View ArticlePubMedPubMed CentralGoogle Scholar
- Rufino SD, Donate LE, Canard LH, Blundell TL: Predicting the conformational class of short and medium size loops connecting regular secondary structures: application to comparative modelling. J Mol Biol 1997, 267: 352–367. 10.1006/jmbi.1996.0851View ArticlePubMedGoogle Scholar
- Burke DF, Deane CM, Blundell TL: Browsing the SLoop database of structurally classified loops connecting elements of protein secondary structure. Bioinformatics 2000, 16: 513–19. 10.1093/bioinformatics/16.6.513View ArticlePubMedGoogle Scholar
- Kwasigroch JM, Chomilier J, Mornon JP: A global taxonomy of loops in globular proteins. J Mol Biol 1996, 259: 855–872. 10.1006/jmbi.1996.0363View ArticlePubMedGoogle Scholar
- Wojcik J, Mornon JP, Chomilier J: New efficient statistical sequence-dependent structure prediction of short to medium-sized protein loops based on an exhaustive loop classification. J Mol Biol 1999, 289: 1469–1490. 10.1006/jmbi.1999.2826View ArticlePubMedGoogle Scholar
- Oliva B, Bates PA, Querol E, Aviles FX, Sternberg MJ: An automated classification of the structure of protein loops. J Mol Biol 1997, 266: 814–830. 10.1006/jmbi.1996.0819View ArticlePubMedGoogle Scholar
- Espadaler J, Fernandez-Fuentes N, Hermoso A, Querol E, Aviles FX, Sternberg MJE, Oliva B: ArchDB: automated protein loop classification as a tool for structural genomics. Nucl Acids Res 2004, (32 Database):185–188. 10.1093/nar/gkh002Google Scholar
- Fernandez-Fuentes N, Hermoso A, Espadaler J, Querol E, Aviles FX, Oliva B: Classification of common functional loops of kinase super-families. Proteins 2004, 56(3):539–555. 10.1002/prot.20136View ArticlePubMedGoogle Scholar
- Li W, Liu Z, Lai L: Protein loops on structurally similar scaffolds: database and conformational analysis. Biopolymers 1999, 49: 481. 10.1002/(SICI)1097-0282(199905)49:6<481::AID-BIP6>3.0.CO;2-VView ArticlePubMedGoogle Scholar
- Li W, Liang S, Wang R, Lai L, Han Y: Exploring the conformational diversity of loops on conserved frameworks. Protein Eng 1999, 12(12):1075–1086. 10.1093/protein/12.12.1075View ArticlePubMedGoogle Scholar
- Venkatachalam CM: Stereochemical criteria for polypeptides and proteins. V. Conformation of a system of three linked peptide units. Biopolymers 1968, 1425–1436. Biopolymers Biopolymers 10.1002/bip.1968.360061006Google Scholar
- Lewis PN, Momany FA, Scheraga HA: Chain reversals in proteins. Bioch Biophys Acta 1973, 303: 211–229.Google Scholar
- Richardson JS: The anatomy and taxonomy of protein structure. Adv Protein Chem 1981, 34: 167–339. full_textView ArticlePubMedGoogle Scholar
- Hutchinson EG, Thornton JM: A revised set of potentials for β -turn formation in proteins. Protein Sci 1994, 3: 2207–2216. 10.1002/pro.5560031206View ArticlePubMedPubMed CentralGoogle Scholar
- Sibanda BL, Thornton JM: Beta-hairpin families in globular proteins. Nature 1985, 316: 170–174. 10.1038/316170a0View ArticlePubMedGoogle Scholar
- Milner-White EJ, Poet R: Four classes of beta-hairpins in proteins. Biochem J 1986, 240: 289–292.View ArticlePubMedPubMed CentralGoogle Scholar
- Sibanda BL, Blundell TL, Thornton JM: Conformation of beta-hairpins in protein structures systematic classification with applications to modelling by homology, electron density fitting and protein engineering. J Mol Biol 1989, 206: 759–777. 10.1016/0022-2836(89)90583-4View ArticlePubMedGoogle Scholar
- Sibanda BL, Thornton JM: Conformation of β hairpins in protein structures: classification and diversity in homologous structures. Methods Enzymol 1991, 202: 59–82. full_textView ArticlePubMedGoogle Scholar
- Efimov A: Structure of coiled β - β hairpins and β - β corners. FEBS 1991, 284: 288–292. 10.1016/0014-5793(91)80706-9View ArticleGoogle Scholar
- Rice PA, Goldman A, Steitz TA: A helix-turn-strand structural motif common in alpha-beta proteins. Proteins 1990, 8(4):334–340. 10.1002/prot.340080407View ArticlePubMedGoogle Scholar
- Leszczynski JF, Rose GD: Loops in globular proteins: a novel category of secondary structure. Science 1986, 234: 849–855. 10.1126/science.3775366View ArticlePubMedGoogle Scholar
- Kabsch W, Sander C: Dictionary of protein secondary structure : pattern recognition of hydrogen-bonded and geometrical features. Biopolymers 1983, 22: 2577–637. 10.1002/bip.360221211View ArticlePubMedGoogle Scholar
- Matthews BW: The gamma turn. Evidence for a new folded conformation in proteins. Macromolecules 1972, 5: 818–819. 10.1021/ma60030a031View ArticleGoogle Scholar
- Rose GD, Gierasch LM, Smith JA: Turns in peptides and proteins. Adv Protein Chem 1985, 37: 1–109. full_textView ArticlePubMedGoogle Scholar
- Milner-White EJ, Ross BM, Ismail R, Belhadj-Mostefa K, Poet R: One type of gamma-turn, rather than the other gives rise to chain reversal in proteins. J Mol Biol 1988, 204: 777–782. 10.1016/0022-2836(88)90368-3View ArticlePubMedGoogle Scholar
- Pavone V, Gaeta G, Lombardi A, Nastri F, Maglio O, Isernia C, Saviano M: Discovering protein secondary structures: classification and description of isolated α-turns. Biopolymers 1996, 38: 705–721. Publisher Full Text 10.1002/(SICI)1097-0282(199606)38:6<705::AID-BIP3>3.0.CO;2-VView ArticlePubMedGoogle Scholar
- Chou KC: Prediction of tight turns and their types in proteins. Anal Biochem 2000, 286: 1–16. 10.1006/abio.2000.4757View ArticlePubMedGoogle Scholar
- Leader D, Milner-White E: Motivated proteins: a web application for studying small three-dimensional protein motifs. BMC Bioinformatics 2009, 10: 60–60. 10.1186/1471-2105-10-60View ArticlePubMedPubMed CentralGoogle Scholar
- Regad L, Martin J, Camproux AC: Identification of non Random Motifs in Loops Using a Structural Alphabet. Proceedings of IEEE Symposium on Computational Intelligence in Bioinformatics and Computational, Toronto 2006, 92–100.Google Scholar
- Kolodny R, Koehl P, Guibas L, Levitt M: Small libraries of protein fragments model native protein structures accurately. J Mol Biol 2002, 323: 297–307. 10.1016/S0022-2836(02)00942-7View ArticlePubMedGoogle Scholar
- Camproux AC, Gautier R, Tufféry T: A hidden Markov model derivated structural alphabet for proteins. J Mol Biol 2004, 339: 561–605. 10.1016/j.jmb.2004.04.005View ArticleGoogle Scholar
- Nuel G, Regad L, Martin J, Camproux AC: Exact distribution of pattern in a set of random sequences generated by a Markov source: application to biological data. Algo Mol Biol 2010, 5: 15. 10.1186/1748-7188-5-15View ArticleGoogle Scholar
- Leung MY, Marsh GM, Speed TP: Over- and underrepresentation of short DNA words in herpesvirus genomes. J Comput Biol 1997, 3: 345–360. 10.1089/cmb.1996.3.345View ArticleGoogle Scholar
- Rocha E, Viari A, Danchin A: Oligonucleotide bias in Bacillus subtilis: general trends and taxonomic comparisons. Nucl Acids Res 1998, 26: 2971–2980. 10.1093/nar/26.12.2971View ArticlePubMedPubMed CentralGoogle Scholar
- Karlin S, Burge C, Campbell AM: Statistical analyses of counts and distributions of restriction sites in DNA sequences. Nucl Acids Res 1992, 20: 1363–1370. 10.1093/nar/20.6.1363View ArticlePubMedPubMed CentralGoogle Scholar
- Sourice S, Biaudet V, El Karoui M, Ehrlich S, Gruss A: Identification of the Chi site of Haemophilus influenzae as several sequences related to Escherichia coli Chi site. Mol Microbiol 1998, 27: 1021–1029. 10.1046/j.1365-2958.1998.00749.xView ArticlePubMedGoogle Scholar
- van Helden J, Olmo M, Perez-Ortin JE: Statistical analysis of yeast genomic downstream sequences revels putative polyadenylation signals. Nucl Acids Res 2000, 28: 1000–1010. 10.1093/nar/28.4.1000View ArticlePubMedGoogle Scholar
- Mönnigmann M, Floudas C: Protein loop structure prediction with flexible stem geometries. Proteins 2005, 61(4):748–62. 10.1002/prot.20669View ArticlePubMedGoogle Scholar
- Bourne PE, Weissig H: Structural Bioinformatics (Methods of Biochemical Analysis). Volume 44. Wiley-Liss 2003 chap. Structure Quality Assurance;Google Scholar
- Camproux AC, Tufféry P: Hidden Markov Model-derived structural alphabet for proteins : the learning of protein local shapes captures sequences specificity. Biochim Biophys Acta 2005, 1724: 394–403.View ArticlePubMedGoogle Scholar
- Kullback S, Leibler R: On information and sufficiency. Annals of Mathematics and Statistics 1951, 22: 79–86. 10.1214/aoms/1177729694View ArticleGoogle Scholar
- Fuchs P, Alix JF, Alain JP: High accuracy prediction of beta-turns and their types using propensities and multiple alignments. Proteins 2005, 59: 828–839. 10.1002/prot.20461View ArticlePubMedGoogle Scholar
- Hollander M, Wolfe DA: Nonparametric statistical inference. New York: John Wiley and Son; 1973.Google Scholar
- Sander O, Ingolf S, Lengauer T: Local protein structure prediction using discriminative models. BMC Bioinformatics 2006, 7: 14–26. 10.1186/1471-2105-7-14View ArticlePubMedPubMed CentralGoogle Scholar
- Hunter CG, Subramaniam S: Protein fragment clustering and canonical local shapes. Proteins 2003, 50: 580–588. 10.1002/prot.10309View ArticlePubMedGoogle Scholar
- Espadaler J, Querol E, Aviles FX, Oliva B: Identification of function-associated loop motifs and application to protein function prediction. Bioinformatics 2006, 22: 2237–2243. 10.1093/bioinformatics/btl382View ArticlePubMedGoogle Scholar
- Kim S, Wang Z, Dalkilie M: iGibbs: Improving Gibbs Motif Sampler for proteins by sequence clustering and iterative pattern sampling. Proteins 2007, 66: 671–681. 10.1002/prot.21153View ArticlePubMedGoogle Scholar
- Torrance JW, Bartlett GJ, Porter CT, Thornton JM: Using a library of structural templates to recognise catalytic sites and explore their evolution in homologous families. J Mol Biol 2005, 347: 565–581. 10.1016/j.jmb.2005.01.044View ArticlePubMedGoogle Scholar
- Polacco BJ, Babbitt PC: Automated discovery of 3D motifs for protein function annotation. Bioinformatics 2006, 22: 723–730. 10.1093/bioinformatics/btk038View ArticlePubMedGoogle Scholar
- Sacan A, Ozturk O, Ferhatosmanoglu H, Wang Y: LFM-Pro: a tool for detecting significant local structural sites in proteins. Bioinformatics 2007, 23: 709–716. 10.1093/bioinformatics/btl685View ArticlePubMedGoogle Scholar
- Ausiello G, Gherardini P, Marcatili P, Tramontano A, Via A, Helmer-Citterich M: FunClust: a web server for the identification of structural motifs in a set of non-homologous protein structures. BMC Bioinformatics 2008, 9: S2. 10.1186/1471-2105-9-S2-S2View ArticlePubMedPubMed CentralGoogle Scholar
- Ausiello G, Gherardini P, Gatti E, Incani o, Helmer-Citterich M: Structural motifs recurring in different folds recognize the same ligand fragments. BMC Bioinformatics 2009, 10: 182–191. 10.1186/1471-2105-10-182View ArticlePubMedPubMed CentralGoogle Scholar
- Pugalenthi G, Suganthan PN, Sowdhamini R, Chakrabarti S: MegaMotifBase: a database of structural motifs in protein families and superfamilies. Nucleic Acids Res 2008, 36: D218–221. 10.1093/nar/gkm794View ArticlePubMedPubMed CentralGoogle Scholar
- Fernandez-Fuentes N, Querol E, Aviles FX, Sternberg MJE, Oliva B: Prediction of conformation and geometry of loops in globular proteins; Testing ArchDB, a structural classification of loops. Proteins 2005, 60: 746–757. 10.1002/prot.20516View ArticlePubMedGoogle Scholar
- Panchenko AR, Madej T: Analysis of Protein Homology by Assessing the Dis(similarity) in Protein loop regions. Proteins 2004, 57: 539–547. 10.1002/prot.20237View ArticlePubMedPubMed CentralGoogle Scholar
- Colloc'h N, Cohen F: Beta-breakers: an aperiodic secondary structure. J Mol Biol 1991, 221(2):603–13. 10.1016/0022-2836(91)80075-6View ArticlePubMedGoogle Scholar
- Maupetit J, Derreumaux P, Tuffery P: PEP-FOLD: an online resource for de novo peptide structure prediction. Nucleic Acids Res 2009, (37 Web Server):W498–503. 10.1093/nar/gkp323Google Scholar
- Martin J, Regad L, Camproux AC, Nuel G: Pattern statistics in set of biological short sequences. ASMDA Proceedings 2007, 1–10.Google Scholar
- Camproux AC, Tufféry P, Chevrolat JP, Boisvieux J, Hazout S: Hidden Markov model approach for identifying the modular framework of the protein backbone. Protein Eng 1999, 12: 1063–1073. 10.1093/protein/12.12.1063View ArticlePubMedGoogle Scholar
- Rabiner LR: A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 1989, 77: 257–286. 10.1109/5.18626View ArticleGoogle Scholar
- Sammon JW: A non-linear mapping for data structure analysis. IEEE Trans Comput 1969, C-18: 401–409. 10.1109/T-C.1969.222678View ArticleGoogle Scholar
- Martin J, de Brevern AG, Camproux AC: In silico local structure approach: a case study on Outer Membrane Proteins. Proteins 2007, 71: 92–109. 10.1002/prot.21659View ArticleGoogle Scholar
- Nuel G: S-SPatt: simple statistics for patterns on Markov chains. Bioinformatics 2005, 21: 3051–3052. 10.1093/bioinformatics/bti451View ArticlePubMedGoogle Scholar
- Nuel G: Numerical solutions for Patterns Statistics on Markov chains. Statistical Applications in Genetics and Molecular Biology 2006, 5: 26. 10.2202/1544-6115.1219View ArticleGoogle Scholar
- Dembo A, Zeitouni O: Large deviations techniques and applications. Springer; 1998.View ArticleGoogle Scholar
- den Hollander F: Large deviations. American mathematical society, Providence; 2000.Google Scholar
- DeLano WL: The PyMOL Molecular Graphics System.2002. [http://www.pymol.org]Google Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.