Home | About | Journals | Submit | Contact Us | Français |

**|**Algorithms Mol Biol**|**v.5; 2010**|**PMC2914642

Formats

Article sections

- Abstract
- Background
- Methods
- Results
- Discussion
- Competing interests
- Authors' contributions
- Supplementary Material
- References

Authors

Related links

Algorithms Mol Biol. 2010; 5: 29.

Published online 2010 July 15. doi: 10.1186/1748-7188-5-29

PMCID: PMC2914642

Pavel V Mazin,^{1} Mikhail S Gelfand,^{1,}^{3} Andrey A Mironov,^{1,}^{3} Aleksandra B Rakhmaninova,^{1,}^{3} Anatoly R Rubinov,^{3} Robert B Russell,^{2} and Olga V Kalinina^{}^{2,}^{3}

Pavel V Mazin: ur.usm.bbf.fnioib@nizam; Mikhail S Gelfand: ur.ptii@dnafleg; Andrey A Mironov: ur.usm.bbf.fnioib@vonorim; Aleksandra B Rakhmaninova: ur.usm.yksrezoleb@rba; Anatoly R Rubinov: moc.liamtoh@vonibur_ylotana; Robert B Russell: ed.grebledieh-inu.tnauqoib@llessur.trebor; Olga V Kalinina: ed.grebledieh-inu.tnauqoib@aninilak.aglo

Received 2009 November 30; Accepted 2010 July 15.

Copyright ©2010 Mazin et al; licensee 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.

This article has been cited by other articles in PMC.

Recent progress in sequencing and 3 D structure determination techniques stimulated development of approaches aimed at more precise annotation of proteins, that is, prediction of exact specificity to a ligand or, more broadly, to a binding partner of any kind.

We present a method, SDPclust, for identification of protein functional subfamilies coupled with prediction of specificity-determining positions (SDPs). SDPclust predicts specificity in a phylogeny-independent stochastic manner, which allows for the correct identification of the specificity for proteins that are separated on a phylogenetic tree, but still bind the same ligand. SDPclust is implemented as a Web-server http://bioinf.fbb.msu.ru/SDPfoxWeb/ and a stand-alone Java application available from the website.

SDPclust performs a simultaneous identification of specificity determinants and specificity groups in a statistically robust and phylogeny-independent manner.

The current explosion of data on protein sequences and structures lead to the emergence of techniques that go beyond standard annotation approaches, i.e. annotation by close homolog and homology-based family identification. These approaches usually start with a set of related sequences and perform a detailed analysis of each alignment position [1-15]. One of problems that such analysis can tackle is analysis of protein specificity. Let us assume that a protein family has undergone an ancient duplication that resulted in proteins that are related but perform different functions in the same organism. It is natural to assume that this functional divergence is mediated by mutation of certain amino acid positions. We call these positions specificity determinants, and this study is focused on their identification. We assume that specificity determinants, after mutation that allow for a new (sub-)function, should be under strong negative selection to let this newly asserted function to persist. This results is a very specific conservation pattern of the position in a multiple sequence alignment of the protein family: it is conserved among proteins that perform exactly same function and differ between different functional sub-groups. In this study, such positions are called SDPs (Specificity-Determining Positions). Another facet of the same problem is identification of proteins that have a certain specificity, i.e. refined functional annotation.

Most of techniques dealing with the stated problem reduce the problem of specificity prediction to the identification of alignment positions that may be important for protein specificity. They require the input set of sequences to be divided into groups of proteins having the same specificity (specificity groups) [1,3,4,6,9-15]. A common feature of these methods is that they measure the correlation between the distribution of amino acids in each position of a multiple sequence alignment (MSA) and the pre-defined groups. Those positions that show relatively high correlation are assumed to be important for differences in specificity between groups. Additionally, SDPpred [6] allows for a subsequent prediction of specificity for proteins, whose specificity has not been known a priori.

Some methods do not need prior information on protein specificity [2,5,7,12]. They start with an automated division of the MSA into possible specificity groups. A common feature of these methods is that they assign same specificity only to monophyletic clades of the proteins' phylogenetic tree. This imposes a significant restriction if the distribution of specificities within the protein family does not agree with the phylogeny. This can happen either as a consequence of convergent evolution, or if the phylogeny is not well resolved.

In this paper we address these weaknesses. We present a method, SDPclust, that simultaneously identifies SDPs and divides the alignment into groups of proteins that have the same specificity in a phylogeny-independent manner. Other phylogeny-independent methods to identify specificity-determining sites have been developed by Marttinen and co-workers [16] and Reva and co-workers [17]. We report the benchmarking of the presented method below.

Previously, we introduced the concept of specificity-determining positions (SDPs) [6,18]. Briefly, we say that a position of a multiple sequence alignment (MSA) is an SDP, if amino acids in the corresponding MSA column are conserved within pre-defined groups of proteins with the same specificity (specificity groups) and differ between such groups. We assume that positions with such conservation pattern account for differences in the specificity between proteins from different specificity groups.

One can easily note that the definition of SDPs relies on the definition of specificity groups in a protein family. This significantly constrains the applicability of previously developed methods. On the other hand, we previously showed that the identification of specificity groups can be done using SDPs [6,18]. SDPclust is a novel method that identifies SDPs in the absence of prior knowledge of specificity groups and simultaneously predicts these groups. At that, SDPclust does not predict the protein specificity *ab initio*, it merely says that proteins have coinciding or different specificity.

SDPclust consists of several components, which are connected as shown in Figure Figure1.1. SDPlight is a fast procedure to identify SDPs in a MSA that is divided into specificity groups. The idea of SDPlight is the same as in a previously reported method SDPpred [6], namely, it uses the mutual information to measure how close is the distribution of amino acids in a given MSA position *p *to the distribution of proteins into specificity groups:

$$M{I}_{p}={\displaystyle \sum _{\begin{array}{l}\alpha \in \\ \text{all amino acids}\end{array}}{\displaystyle \sum _{\begin{array}{l}i\in \\ \text{all}\\ \text{specificity groups}\end{array}}{f}_{p}(\alpha ,\text{}i)\mathrm{log}\frac{{f}_{p}(\alpha ,i)}{{f}_{p}(\alpha )f(i)},}}$$

(1)

where *f*_{p}(*α*, *i*) is the frequency of amino acid α in group *i *in position *p*, *f*_{p}(*α*) is the frequency of amino acid *a *in position *p *in the whole alignment, *f (i) *is the fraction of proteins in group *i*.

The main new feature of SDPlight that makes it much faster than SDPpred is the way the correction for the background distribution of the mutual information is performed. Instead of using shuffling, which is computationally inefficient, we pre-calculate the mean and the variance for any pattern of amino acids in an arbitrary column using an approximation described below. Let us assume that a MSA consists of proteins falling into *k *specificity groups, and, in a given position, amino acid *α *appears in each group *i*_{αj }times (*j *= 1,...,*k*). Then (1) can be rewritten as

$$M{I}_{p}=\frac{1}{N}{\displaystyle \sum _{\alpha =1}^{20}{\displaystyle \sum _{j=1}^{k}M}}I(\alpha ,j)\text{},$$

(2)

where

$$MI(\alpha ,j)={i}_{\alpha j}\mathrm{log}\left(\frac{{i}_{\alpha j}n}{{i}_{\alpha}{n}_{j}}\right)\text{},$$

(3)

where *n*_{j }is the size of group *j*, Σ_{j = 1,...,k }*n*_{j }= *N*, *N *is the total number of sequences in the MSA.

The exact formulae for the expectation value and the variance of *MI*_{p }are:

$$M(M{I}_{p})=\frac{1}{N}{\displaystyle \sum _{\alpha =1}^{20}{\displaystyle \sum _{j=1}^{k}{\displaystyle \sum _{\left\{{i}_{\alpha j}\right\}}p(\{{i}_{\alpha j}\})MI(\alpha ,j),}}}$$

(4)

$$\begin{array}{l}D(M{I}_{p})=\frac{1}{{N}^{2}}({\displaystyle \sum _{\alpha =1}^{20}{\displaystyle \sum _{j=1}^{k}D}}(MI(\alpha ,j))\\ +2{\displaystyle \sum _{\begin{array}{l}{\alpha}_{1},{\alpha}_{2}=1\\ {\alpha}_{1}>{\alpha}_{2}\end{array}}^{20}{\displaystyle \sum _{{}^{\begin{array}{l}{j}_{{}_{1}},\text{}{j}_{{}_{2}}=\text{}1\\ {j}_{{}_{1}}\text{}>\text{}{j}_{{}_{2}}\end{array}}}^{k}cov(MI({\alpha}_{1},{j}_{1}),MI({\alpha}_{2},{j}_{2}))}}).\end{array}$$

(5)

At this point we make the approximation that different amino acids are distributed independently in the groups. This leads to several simplifications: groups become equivalent, hence *n*_{j}/*n *= 1/*k*. Since all groups become equivalent, instead of taking a sum over all groups, we can multiply by *k*. The distribution {*i*_{αj}} of amino acids in *k *groups can be approximated by a multinomial distribution. Since the distributions for different amino acids are independent, we can rewrite formula (4) as $M(M{I}_{p})=\frac{1}{N}\xb7{\displaystyle \sum _{\alpha =1}^{20}M\text{}\left(M{I}_{{i}_{\alpha ,}k}\right)},$, probability to observe a given pattern of amino acid *a *is binomial and can be approximated as:

$$p\left(\left\{{i}_{\alpha j}\right\}\right)={\tilde{p}}_{{i}_{\alpha ,}k}\left(i\right)=\left(\begin{array}{l}{i}_{\alpha}\\ i\end{array}\right)\text{}{\left(\frac{1}{k}\right)}^{i}\text{}{\left(1-\frac{1}{k}\right)}^{{i}_{\alpha}-i}.$$

(6)

So the approximation for the expectation value of *MI*_{p }is:

$$\begin{array}{l}M(M{I}_{p})=\frac{1}{N}\xb7{\displaystyle \sum _{\alpha =1}^{20}M\text{}\left(M{I}_{{i}_{\alpha ,}k}\right)}=\\ =\frac{k}{N}\text{}\text{}{\displaystyle \sum _{\alpha =1}^{20}{\displaystyle \sum _{i=1}^{{i}_{\alpha}}\frac{{i}_{\alpha}!}{i!\left({i}_{\alpha}-i\right)!}}}{\left(\frac{1}{k}\right)}^{i}{\left(1-\frac{1}{k}\right)}^{{i}_{\alpha}-i}i\text{}\mathrm{log}\left(\frac{ik}{{i}_{\alpha}}\right).\end{array}$$

(7)

Since the distributions of amino acids are independent, all covariances between two amino acids in formula (5) equal 0, and all covariances between groups are equal to each other (so we can effectively multiply by *k*^{2 }- *k*):

$$\begin{array}{l}D(M{I}_{p})=\frac{1}{{N}^{2}}{\displaystyle \sum _{\alpha =1}^{20}D}(M{I}_{{i}_{\alpha},k})=\\ \frac{1}{{N}^{2}}{\displaystyle \sum _{\alpha =1}^{20}D}\text{\hspace{0.17em}}\left({\displaystyle \sum _{i=1}^{{i}_{\alpha}}\frac{{i}_{\alpha}!}{i!({i}_{\alpha}-i)!}}{\left(\frac{1}{k}\right)}^{i}{\left(1-\frac{1}{k}\right)}^{{i}_{\alpha}-i}i\mathrm{log}\left(\frac{ik}{{i}_{\alpha}}\right)\right)=\\ =\frac{k}{{N}^{2}}{\displaystyle \sum _{\alpha =1}^{20}{\displaystyle \sum _{i=1}^{{i}_{\alpha}}\frac{{i}_{\alpha}!}{i!({i}_{\alpha}-i)!}}}{\left(\frac{1}{k}\right)}^{i}{\left(1-\frac{1}{k}\right)}^{{i}_{\alpha}-i}{\left(i\mathrm{log}\left(\frac{ik}{{i}_{\alpha}}\right)\right)}^{2}+\\ +({k}^{2}-k){\displaystyle \sum _{\alpha =1}^{20}{\displaystyle \sum _{i=1}^{{i}_{\alpha}}{\displaystyle \sum _{i=2}^{{i}_{\alpha}-{i}_{1}}\frac{{i}_{\alpha}!}{{i}_{1}!\text{\hspace{0.17em}}{i}_{2}!({i}_{\alpha}-{i}_{1}-{i}_{2})!}}}}{\left(\frac{1}{k}\right)}^{{i}_{1}+{i}_{2}}.\\ .{\left(1-\frac{2}{k}\right)}^{{i}_{\alpha}-{i}_{1}-{i}_{2}}{i}_{1}\mathrm{log}\left(\frac{{i}_{1}k}{{i}_{\alpha}}\right){i}_{2}\mathrm{log}\left(\frac{{i}_{2}k}{{i}_{\alpha}}\right)-{M}^{2}\left(M{I}_{{i}_{\alpha},k}\right)\end{array}$$

(8)

The values of *M*($M{I}_{{i}_{\alpha},k}$) and *D*($M{I}_{{i}_{\alpha},k}$) are pre-calculated and tabulated, and requiring time *O*(*i*_{α}) and *O*(*i*_{α}^{2}), respectively. We pre-calculate these values for *k *= 2,...,200; *i*_{α }= 1,...,500 and store them. Then one run of the method involves only summing corresponding pre-calculated values for all 20 amino acids, and for a given alignment of ~100 sequences of length ~400 aa it takes approximately 50 ms (AMD Athlon™ 64 Processor 3800+).

Having pre-calculated values of *M*(*MI*) and *D*(*MI*), and given a MSA, we can calculate Z-scores for each position and the probability to obtain *k *highest-scoring positions analogously to SDPpred [6]. Finally, we select the least probable, given a random model, set of positions and call them SDPs, for these are the positions that correlate best with grouping of sequences by specificity.

The second component of the method is SDPprofile, which, analogously to SDPpred, computes positional weight matrices (PWMs) for each specificity group based only on the predicted SDPs and ignoring the rest of the alignment. Then, for a protein of unknown specificity, it is possible to assign it to one of the specificity groups by the highest PWM score. This allows us to augment the initial specificity groups with additional sequences. A virtual group was introduced to account for sequences that cannot be grouped into existing groups. It contains all sequences of the alignment and is ignored during the prediction of SDPs. Any sequence that has significantly higher score for one of the constructed PWMs is assigned to that group, whereas sequences with low scores or without pronounced preference of one PWM are assigned to the virtual group.

Whereas the components described above reproduce to some extent the previously reported method, the following components are new and allow for considering protein families that lack prior information on specificity.

SDPgroup is an iterative procedure to augment a pre-defined training set of specificity groups with new sequences from the MSA, and SDPtree is a wrapping procedure that multiply picks a random training set for SDPgroup and constructs the best clustering pattern.

The iterative steps of SDPgroup are the following. We start from a given training set of specificity groups and identify SDPs using the SDPlight procedure. Then we consider each sequence of the MSA as a sequence of unknown specificity, and use SDPprofile to reassign it to one of the specificity groups. After this step, most of sequences would probably stay in same groups, but specificity assignment of some sequences may change, and other sequences of previously unknown specificity may get assigned to one of the groups. The reassignment of all sequences constitutes one iterative step. Then we recalculate SDPs. If the grouping of sequences does not change after the current iterative step, the iterations stop, that is we iterate until convergence. If the initial grouping did not include all biologically relevant specificity groups, some sequences may remain unassigned to any of them (only to the virtual group).

Given a MSA without any additional information, SDPtree randomly selects several groups of equal size, whose number is roughly proportional to the number of sequences in the MSA, and runs SDPgroup. This step is repeated many times (by default, 10000). The distance between two sequences is defined as the negative logarithm of the frequency of assigning them to the same group by the SDPgroup procedure:

$$\begin{array}{l}d(se{q}_{1},se{q}_{2})=\\ =-\mathrm{log}\left(\frac{\#\left(se{q}_{1}\text{and}se{q}_{2}\text{are in the same specificity group}\right)}{10000}\right).\end{array}$$

(9)

Using thus defined distance, we construct a tree using a standard UPGMA procedure. Then we perform tree-guided clustering, so that clusters comprise branches of the tree. We then select the lexicographically best clustering using the following original algorithm.

Let *N *be the set of all sequences (points to be clustered). For every *i*, *j * *N*, the distance *d*_{ij }is defined by (9). Let *X*, *Y * *N *be subsets of *N*. We define the distance between *X *and *Y *by *d*(*X*, *Y*) = *min *{*d*_{ij}: *i**X*, *j**Y*}. Then for any cluster *X *we can introduce its quality function *Q(X) *as *Q*(*X*) = *Q*_{ext }- *Q*_{int}, where *Q*_{ext }= *d*(*X*, *N *- *X*) and *Q*_{int }= *max*{*d*(*Z*, *X *- *Z*):*Z * *X*}= *diam*(*X*). Thus, effectively,

$$\begin{array}{l}Q(X)=\\ =min\{{d}_{ij}:i\in X,J\notin X\}-max\{{d}_{ij}:i,j\in X\}>0.\end{array}$$

(10)

The goal function of the clustering procedure is $\{Q({N}_{1}),Q({N}_{2}),\dots ,Q({N}_{k})\}\underset{lex}{\to}max$, where *N*_{1}, *N*_{2},...,*N*_{k }is a set of non-overlapping subsets of *N*, the union of which constitutes the whole *N*. We compare these sets lexicographically.

For each subtree of the cluster tree, we can define its quality function *Q(X) *as above. Starting from leaves of the tree, we can identify the set of clusters of the maximal quality by the following dynamic programming procedure. We define

$$\begin{array}{l}{Q}_{\mathrm{max}}(X)=\\ =max\{Q(X),min\{{Q}_{max}({X}_{1\text{eft}}),{Q}_{max}({X}_{\text{right}})\left\}\right\},\end{array}$$

(11)

where *X*_{left }and *X*_{right }are the subtrees corresponding to the left and right children of the node *X*. When we reach the root, we know the maximal weight for each path. Then, backtracking from the root to the leaves, we identify the corresponding clusters by picking the first node *X*, for which *Q(X) *= *Q*_{max }(*X*). It can be shown that for any quality function *Q*(*X*) and any cluster tree this procedure yields the best (lexicographically maximal) clustering that conforms the cluster tree. This holds for any *Q(X) *that depends only on *X *and not on the clustering of the rest *N *- *X*.

SDPclust is implemented as a Web-server http://bioinf.fbb.msu.ru/SDPfoxWeb/ and a stand-alone Java application that can be downloaded from the same site. The Web interface is designed for an easier problem of the training set-guided specificity prediction, as described in the SDPgroup procedure. The alignment may contain from 4 to 2000 sequences forming at most 200 specificity groups, and must be shorter that 5000 aa. The more time-consuming *ab initio *grouping is implemented in the stand-alone application SDPfox.jar. It requires Java version 1.6.0_17 installed. To get help, run java -jar SDPfox.jar.

We generated two families of sequences of 190 amino acid in length following a naïve random evolutionary model. A random sequence of 190 amino acids was generated using amino acid frequencies from SwissProt. Then on each step the amino acid at a random position was mutated to a random amino acid 30 times. The resulting sequences were used as seed for a subsequent mutation process of another 50 steps. Thus, each family contained five subfamilies of ten sequences each differing from each other in up to 80 positions. Specificity was implicitly introduced by adding ten SDPs to each sequence to follow a pre-defined phylogenetic pattern: in one case specificity coincided with the subfamilies, in the other it was randomly distributed among them (Figure (Figure2,2, Additional Files 1 and 2).

Transcription factors of the LacI family regulate sugar catabolism and several other metabolic pathways in a wide variety of bacterial species. They bind DNA operator sequences responding to the effector molecule. We considered a subset of proteins, differing in their specificity to the effector and the operator sequence, that included ten ortholog rows CcpA, CytR, FruR, GalR, GntR, MalR, PurR, RbsR_EC, RbsR_PP, ScrR (Additional File 3). The RbsR_EC and RbsR_PP groups represent two groups of ribose repressors from different bacterial lineages (Enterobacteriales, Vibrionales and Pasteurellales, and Pseudomonadales, respectively) that share the ligand specificity but have different DNA binding motifs, thus being considered as separate groups in our study.

To benchmark SDPclust against other methods we used two datasets of 18 (Dataset 1) and 26 (Dataset 2) Pfam seed alignments. Dataset 1 contains Pfam families, in which all proteins have the same EC number, and Dataset 2 consists of the families that include enzymes from at least two EC categories differing in the last term. Additionally, we required that for each of these families, the 3 D structure of one of its members with bound ligand were available. These families are listed in Additional File 4 and described in detail elsewhere [18]. This dataset is different from the enzyme dataset described in [19] in that all the structures include a bound native ligand. So we believe it is more suitable for benchmarking a method for prediction of specificity determinants.

After applying SDPclust, one obtains two resulting predictions: the SDP set and the specificity groups. We apply the standard sensitivity and false positive measures to assess the prediction of SDPs.

The sensitivity is given by the formula TP/(TP + FN), and the false positive rate by FP/(FP + TN), where TP is the number of true positives (i.e. residues both belonging to the gold standard positive set and predicted as positives), FP is the number of false positives, TN is the number of true negatives and FN is the number of false negatives. To evaluate the predicted grouping, we use the MI-based metric given by the formula

$$\begin{array}{c}D({G}_{real},{G}_{pred})=\\ =1-MI({G}_{real},{G}_{pred})/H({G}_{real},{G}_{pred}),\end{array}$$

(12)

where *G*_{real }is the gold standard grouping, *G*_{pred }is the predicted grouping, and H and MI are the joint Shannon entropy and mutual information of the two distributions, respectively [20]:

$$\begin{array}{c}H({G}_{real},{G}_{pred})=-{\displaystyle \sum _{ij}{p}_{ij}}\mathrm{log}{p}_{ij},\\ MI({G}_{real},{G}_{pred})=\\ =H({G}_{real})+H({G}_{pred})-H({G}_{real}\text{,}{G}_{pred})=\\ ={\displaystyle \sum _{i,j}{p}_{ij}}\mathrm{log}\frac{{p}_{ij}}{{p}_{i}{p}_{j}},\end{array}$$

(13)

where *p*_{ij }denotes the probability of a sequence to be in the i-th group of *G*_{real }and j-th group of *G*_{pred}. Here we treat groupings as random variables over the space of sequences in the MSA. Defined so, this distance is a metric, ranged from 0 (for identical distributions) to 1, as shown in [20], and reflects proximity of two distributions, in our case, the gold standard and the predicted grouping of sequences.

In the case of generated families we have the standard of truth given artificially: the ten introduced SDPs, and the induced grouping.

For the LacI family, we used the results of extensive mutational analysis of LacI from *E. coli *[21] and defined true SDPs as all positions, whose mutation resulted in a weakening the function of the protein (groups IV to XV from [21]). We are aware of the fact that many functionally important positions probably account for the functionality that is common for all LacI proteins, and thus are likely to be conserved in the family. So, many positions that are defined here as 'positives' are in fact 'negatives', which leads to underestimation of the results. However, biochemical data on real specificity determinants that would cover a protein to a significant part of its length is largely non-existent, so we decided to allow for this shortcoming in the definitions, despite the fact that it may make the performance to appear worse than it might be.

The gold standard grouping was derived from the comparative genomics studies [22]. Briefly, a transcription factor was assumed to be specific to a certain effector, if its gene was found in the same locus as genes of the corresponding pathway, or if it shared a DNA regulatory motif with these genes.

As such functional data are not available for the enzyme datasets, we define true SDP as all residues that are located closer than 10Å to the ligand in the corresponding 3 D structure. This likely underestimates the method's sensitivity. We assess the quality of the grouping in the enzyme dataset using formulae (8)-(9) and considering only sequences with a known EC number as a subject for this assessment.

As a real-world example to test our approach, we selected a family of phosphodiesterases (PDEs). PDEs catalyze hydrolysis of cAMP and/or cGMP and are implicated in various diseases. PDEs comprise at least eleven subfamilies with different and partially overlapping specificity to the cyclic nucleotides. The human genome contains 21 genes encoding PDEs [23]. The sequences were selected from the Pfam entry PF00233 so that no two sequences were more than 95% identical, and all sequences were long enough to cover at least 70% of the alignment. The resulting alignment contained 249 sequences, 42 of which were annotated as belonging to a certain PDE subfamily in Swissprot. The alignment is presented in Additional File 5.

When analyzing contact in structures of LacI and PDE family members, we always assume 5Å to be the cutoff for two atoms to be contacting each other, and contacting residues are defined by the contact of their nearest atoms.

The sensitivity and false positive rate of the set of predicted SDPs and the MI-based distance between the gold standard and the predicted groupings are given in Table Table1.1. SDPclust performs correctly for both generated families, but demonstrates a lower sensitivity for the real-world example of the LacI family. This may be caused by our definition of true SDPs, as all residues, whose mutation resulted in alteration of function [21].

Additionally, we mapped the predicted SDPs for the LacI family onto the 3 D structure of PurR from *E. coli *(PDB ID 1BDH, Figure Figure3).3). As expected, the predicted SDPs were located in two functionally important regions of the protein: in the DNA-binding domain and in the effector-binding pocket. Seven and two amino acid residues directly contacted DNA and effector, respectively. Additional four residues were involved in intersubunit contacts.

The average values of sensitivity and false positive rate, and the average and median distance to the ligand are given in Table Table2.2. The statistical significance of the prediction was also calculated applying the Mann-Whitney test to the distances from the ligand to the predicted SDPs and to all residues from the structure. For 21 out of 44 considered families, the p-values were lower than 0.1, and for 10 families they were below 0.01. This indicates that SDPclust performs significantly better than random choice. Dataset 2, which corresponds to families that include proteins with different specificity, is enriched in the statistically significant predictions: 15 out of 21 with p-value below 0.1, and 7 out of 10 with p-value below 0.01 come from this set. Taken together, in cases, when there is indication of different specificities within a family, SDPclust proves to be a powerful tool for exploring both specificity groups and SDPs.

Phosphodiesterases (PDEs) catalyze hydrolysis of cAMP and/or cGMP, secondary messengers that regulate a variety of cellular processes, including response to hormones, neurotransmitters, cytokines, chemokines. This makes PDEs an attractive drug target. The human genome encodes 21 PDEs, which differ in their specificity both to the cyclic mononucleotides and to designed inhibitors. We applied SDPclust to predict the amino acid residues accounting for these differences and the specificity of unannotated members of the family.

SDPclust splits the PDE family into 37 specificity groups. PDE subfamilies PDE1, PDE3, PDE4, PDE6, PDE7, PDE8, PDE9, PDE10 form separate specificity groups (that may include some unannotated sequences thus providing potential annotation for them), and subfamilies PDE2, PDE5, PDE11 form two specificity groups each. 23 specificity groups do not contain any annotated sequences. The resulting grouping is available in Additional File 5.

SDPclust identifies 23 SDPs: 615W, 619F, 624C, 652 S, 655L, 658R, 660V, 665I, 677C, 683 H, 686F, 690L, 719A, 761T, 765L, 767A, 768I, 770K, 775Q, 779A, 782V, 783A, 805 M (numbered according to PDE5A from human). Prior to this study, among these SDPs, 775Q, 779A, 782V, 783A, 805 M were experimentally shown to be involved in rolipram resistance in PDE4B [24,25], and 767A and 775Q to be important for cyclic mononucleotide selectivity [26]. Mapped onto the 3 D structure of human PDE4 D (PDB ID 1TB7), SDPs form two spatial clusters: one comprising nine amino acid residues and located in the hydrophobic ligand-binding pocket, and the other comprising 13 residues located on the other side of the bimetallic cluster (Figure (Figure4A).4A). Analyzing 39 3 D structures of different PDEs, we found that 11 SDPs contact the ligand in at least one of them, while only one (782V) contacts it in all considered structures.

PDE4B and PDE5A have different specificity towards the cyclic nucleotide, however, both bind sildenafil (PDB ID 1TBF for PDE4B and PDB ID 1XOS for PDE5A), although PDE5A binds it with much higher affinity [27]. In these two structures, the substrate is bound in two different conformations. Interestingly, one of the predicted SDPs, 783A, can cause steric obstructions, preventing binding of sildenafil to PDE4B in the same conformations as to PDE5A ([27], Figure Figure4B4B).

We presented a novel method, SDPclust, for the prediction of protein specificity in large and potentially diverse families. Essentially, the resulting prediction consists of two parts: a set of potential groups that contain proteins with the same specificity (specificity groups), and a set of positions that account for differences in specificity among the proteins (SDPs). We compared the performance of SDPclust to other existing approaches using several benchmark datasets.

The first part of the prediction, the specificity groups, was compared to predictions by SDPsite [18], bete [28], giant component [29], FASS and S-method [12], Protein Keys [17]. We were unable to include the methods by Marttinen and co-workers [15], as there are no functional executables currently available for this method. In all cases, except the giant component analysis (where we had to implement the method in house due to its unavailability online), the executables provided by the authors with the default parameters were used to perform the prediction. We have the gold standard grouping for the artificially generated set and for the LacI family. The resulting MI-based distances are presented in Table Table3A.3A. SDPclust performs best in terms of selection of specificity groups, including the difficult case of the generated family 2, where other methods fail. The reason for this might be that SDPclust does not assume that specificity should by monophyletic. This allows for successful resolution in difficult cases of convergent evolution of specificity or uncertain branching in the phylogenetic tree.

We compared different methods that predict specificity groups for the enzyme dataset 2 (different EC numbers in the same family) (Table (Table3B).3B). We considered only families with at least four sequences with assigned EC, which left us with 21 families. One can see that SDPclust and SDPsite perform comparably well. There is one clear tendency in the SDPclust performance: all families, for which SDPclust performs significantly worse than SDPsite, contain 2 specificity groups (as defined by EC numbers) and a relatively small numver of sequences (<25). Generally, SDPclust tends to perform better on larger families, due to the fact that it favors splits to many specificity groups. Very rarely it puts sequences with different EC numbers together, but can put sequences with the same EC number into different clusters. On the contrary, SDPsite performs best when there are only two groups and few sequences. This suggests possible complementarity of these methods.

The predicted SDPs were compared to functionally important positions identified by SDPsite [18], FASS, MB-method and S-method [12], Trace Suite II (implementing the method described in [2]), Protein Keys [17]. Each of these methods produces a set of residues that are potentially important for functional differences between subfamilies of a given alignment. None requires prior grouping into subfamilies. We also computed statistical significance of the derived predictions for the LacI family applying the Mann-Whitney test to distances of the predicted SDPs to the functional site of the protein compared to all amino acid resudues of the regulator. The sensitivity and false positive rate values and the statistical significance for the artificially generated data and the LacI family are presented in Figure Figure5.5. For generated family 1, the sensitivity of all methods (except S-method) is 1, whereas only SDPclust has a false positive rate of 0. In contrast to this, for generated family 2, only Trace Suite II and SDPclust have the sensitivity of 1, and MB-method, of 0.3, while the remaining methods fail completely (probably, due to their subfamily extraction procedures). Again, SDPclust is the only method to show the false positive rate of 0. For the LacI family, Trace Suite II has the highest sensitivity (0.73), but also a very high false positive rate (0.54), which makes it impractical to use. SDPsite, MB-method and SDPclust have comparable sensitivities and false positive rates, but SDPclust is the only method, whose predictions are significant according to our statistical significance test that assesses proximity to the ligand (p-value = 8 × 10^{-5}). It must be also noted that the FASS, MB and S-methods turned out to be inapplicable to many instances from out benchmark dataset, due to restrictions imposed onto the alignment length and the number of sequences, while demonstrating good performance in the remaining cases.

The average sensitivity, false positive rate and statistical significance of different methods for the combined enzyme dataset are presented in Table Table4,4, and the complete statistics is given in Additional File 6. SDPclust shows a relatively high sensitivity and a relatively low false discovery rate for both datasets. A detailed analysis of the statistical significance is presented in Figure Figure6.6. The histogram shows the fraction of families from the enzyme dataset, for which the prediction of different methods have p-values below a certain point. Trace Suite II demonstrates low p-values, but, again, a high false positive rate. In other words, this method predicts so many positions (part of which are functionally important) that it barely narrows the set of potentially important residues, which makes it impractical in real-world studies. FASS, MB and S methods are inapplicable to a large fraction of families, which makes comparison to them uninformative. Rate4site, SDPsite, Protein Keys and SDPclust perform comparably well, SDPclust being slightly better in the case of the multi-EC dataset. This can be due to the refined grouping procedure. Noteworthy, SDPsite and SDPclust are complementary to rate4site, which predicts functionally important positions on the basis of their conservation, in the sense that they identify another set of functionally important residues, the ones accounting for differences in specificity. This is supported by the observation that rate4site performs better for dataset 1 (same specificity for all family members), whereas SDPclust and SDPsite perform better for dataset 2 (at least two different specificities within the family) (data not shown).

Sensitivity, false positive rate, average and median distances to the ligand for predictions obtained with different methods for the enzyme dataset.

The authors declare that they have no competing interests.

PVM participated in the design of the algorithms and data analysis, performed the programming and drafted the manuscript. MSG participated in the data collection and analysis and manuscript preparation. AAM and ARR participated in the design of the algorithms. ABR and RBR participated in the data collection. OVK participated in the design of the algorithms, data collection, and analysis and preparation of the manuscript. All authors have read and approved the final manuscript.

**Sequence alignment for generated sequences, specificity coincides with phylogeny**.

Click here for file^{(11K, TXT)}

**Sequence alignment for generated sequences, specificity does not correlate with phylogeny**.

Click here for file^{(10K, TXT)}

**Sequence alignment for the LacI family divided into specificity groups**.

Click here for file^{(49K, TXT)}

**Sequence alignment for the PDE family divided into predicted specificity groups**.

Click here for file^{(456K, TXT)}

Funding: OVK was supported by the EMBO Long Term Fellowship (ALTF 2007-119). This study was partially supported by grants from the Russian Foundation for Basic Research (09-04-92742, 09-04-92745, 10-04-00431, 09-04-92742), RAS program "Molecular and Cellular Biology", and state contracts 2.740.11.0101 and 02.514.12.4007.

- Rendell LA, Kira K. A practical approach to feature selection. Proceedings of the Ninth International Workshop on Machine Learning. 1992. pp. 249–256.
- Lichtarge O, Bourne HR, Cohen FE. An evolutionary trace method defines binding surfaces common to protein families. J Mol Biol. 1996;257(2):342–358. doi: 10.1006/jmbi.1996.0167. [PubMed] [Cross Ref]
- Livingstone GD, Barton GJ. Identification of Functional Residues and Secondary Structure from Protein Multiple Sequence Alignment. Methods Enzymol. 1996;266:497–512. full_text. [PubMed]
- Hannenhalli SS, Russell RB. Analysis and prediction of functional sub-types from protein sequence alignments. J Mol Biol. 2000;303(1):61–76. doi: 10.1006/jmbi.2000.4036. [PubMed] [Cross Ref]
- Gu X, Vander Velden K. DIVERGE: phylogeny-based analysis for functional-structural divergence of a protein family. Bioinformatics. 2002;18(3):500–501. doi: 10.1093/bioinformatics/18.3.500. [PubMed] [Cross Ref]
- Kalinina OV, Mironov AA, Gelfand MS, Rakhmaninova AB. Automated selection of positions determining functional specificity of proteins by comparative analysis of orthologous groups in protein families. Protein Science. 2004;13:443–456. doi: 10.1110/ps.03191704. [PubMed] [Cross Ref]
- Mihalek I, Res I, Lichtarge O. A family of evolution-entropy hybrid methods for ranking protein residues by importance. J Mol Biol. 2004;336(5):1265–82. doi: 10.1016/j.jmb.2003.12.078. [PubMed] [Cross Ref]
- Pei J, Cai W, Kinch LN, Grishin NV. Prediction of functional specificity determinants from protein sequences using log-likelihood ratios. Bioinformatics. 2006;22(2):164–171. doi: 10.1093/bioinformatics/bti766. [PubMed] [Cross Ref]
- Pirovano W, Feenstra KA, Heringa J. Sequence comparison by sequence harmony identifies subtype-specific functional sites. Nucleic Acids Res. 2006;34(22):6540–6548. doi: 10.1093/nar/gkl901. [PubMed] [Cross Ref]
- Ye K, Feenstra KA, Heringa J, IJzerman AP, Marchiori E. Multi-RELIEF: a method to recognize specificity determining residues from multiple sequence alignments using a Machine Learning approach for feature weighting. Bioinformatics. 2008;24(1):18–25. doi: 10.1093/bioinformatics/btm537. [PubMed] [Cross Ref]
- Pirovano W, Heringa J, Feenstra KA. A Feature Selection Algorithm for Detecting Subtype Specific Functional Sites from Protein Sequences for SMAD Receptor Binding. Proceedings of the 5th International Conference on Machine Learning and Applications (ICMLA'06) 2006. pp. v–viii.
- Carro A, Tress M, Juan D, Pazos F, Lopez-Romero P, Sol A, Valencia A, Rojas AM. TreeDet: a web server to explore sequence space. Nucleic Acids Res. 2006;34:110–115. doi: 10.1093/nar/gkl203. [PMC free article] [PubMed] [Cross Ref]
- Chakrabarti S, Bryant SH, Panchenko AR. Functional specificity lies within the properties and evolutionary changes of amino acids. J Mol Biol. 2007;373(3):801–810. doi: 10.1016/j.jmb.2007.08.036. [PMC free article] [PubMed] [Cross Ref]
- Feenstra KA, Pirovano W, Krab K, Heringa J. Sequence harmony: detecting functional specificity from alignments. Nucleic Acids Res. 2007;35:1–4. doi: 10.1093/nar/gkm406. [PMC free article] [PubMed] [Cross Ref]
- Mirny LA, Gelfand MS. Using orthologous and paralogous proteins to identify specificity-determining residues in bacterial transcription factors. J Mol Biol. 2002;321(1):7–20. doi: 10.1016/S0022-2836(02)00587-9. [PubMed] [Cross Ref]
- Marttinen P, Corander J, Törönen P, Holm L. Bayesian search of functionally divergent protein subgroups and their function specific residues. Bioinformatics. 2006;22(20):2466–2474. doi: 10.1093/bioinformatics/btl411. [PubMed] [Cross Ref]
- Reva B, Antipin Y, Sander C. Determinants of protein function revealed by combinatorial entropy optimization. Genome Biol. 2007;8(11):R232. doi: 10.1186/gb-2007-8-11-r232. [PMC free article] [PubMed] [Cross Ref]
- Kalinina OV, Gelfand MS, Russell RB. Combining specificity determining and conserved residues improves functional site prediction. BMC Bioinformatics. 2009;10:174. doi: 10.1186/1471-2105-10-174. [PMC free article] [PubMed] [Cross Ref]
- Capra JA, Singh M. Characterization and prediction of residues determining protein funstional specificity. Bioinformatics. 2008;24(13):1473–1480. doi: 10.1093/bioinformatics/btn214. [PMC free article] [PubMed] [Cross Ref]
- Kraskov A, Stögbauer H, Andrzejak RG, Grassberger P. Hierarchical Clustering Based on Mutual Information. 2008. http://arxiv.org/PS_cache/q-bio/pdf/0311/0311039v2.pdf
- Suckow J, Markiewicz P, Kleina LG, Miller J, Kisters-Woike B, Müller-Hill B. Genetic studies of the Lac repressor. XV: 4000 single amino acid substitutions and analysis of the resulting phenotypes on the basis of the protein structure. J Mol Biol. 1996;261(4):509–523. doi: 10.1006/jmbi.1996.0479. [PubMed] [Cross Ref]
- Laikova ON. The LacI family of transcriptional regulators and the evolution of sugar utilization regulons in bacteria. Proceedings of the 1st Moscow conference on computational molecular biology. 2003.
- Bender AT, Beavo JA. Cyclic nucleotide phosphodiesterases: molecular regulation to clinical use. Pharmacol Rev. 2006;58:488–520. doi: 10.1124/pr.58.3.5. [PubMed] [Cross Ref]
- Atienza JM, Susanto D, Huang C, McCarty AS, Colicelli J. Identification of inhibitor specificity determinants in a mammalian phosphodiesterase. J Biol Chem. 1999;274(8):4839–4847. doi: 10.1074/jbc.274.8.4839. [PubMed] [Cross Ref]
- Pillai R, Kytle K, Reyes A, Colicelli J. Use of a yeast expression system for the isolation and analysis of drug-resistant mutants of a mammalian phosphodiesterase. Proc Natl Acad Sci USA. 1993;90(24):11970–11974. doi: 10.1073/pnas.90.24.11970. [PubMed] [Cross Ref]
- Zhang KY, Card GL, Suzuki Y, Artis DR, Fong D, Gillette S, Hsieh D, Neiman J, West BL, Zhang C, Milburn MV, Kim SH, Schlessinger J, Bollag G. A glutamine switch mechanism for nucleotide selectivity by phosphodiesterases. Mol Cell. 2004;15(2):279–86. doi: 10.1016/j.molcel.2004.07.005. [PubMed] [Cross Ref]
- Card GL, England BP, Suzuki Y, Fong D, Powell B, Lee B, Luu C, Tabrizizad M, Gillette S, Ibrahim PN, Artis DR, Bollag G, Milburn MV, Kim SH, Schlessinger J, Zhang KY. Structural basis for the activity of drugs that inhibit phosphodiesterases. Structure. 2004;12(12):2233–2247. doi: 10.1016/j.str.2004.10.004. [PubMed] [Cross Ref]
- Sjolander K. Phylogenetic inference in protein superfamilies: analysis of SH2 domains. Proc Int Conf Intell Syst Mol Biol. 1998;6:165–174. [PubMed]
- Donald JE, Shakhnovich EI. Predicting specificity-determining residues in two large eukaryotic transcription factor families. Nucleic Acids Res. 2005;33(14):4455–4465. doi: 10.1093/nar/gki755. [PMC free article] [PubMed] [Cross Ref]

Articles from Algorithms for Molecular Biology : AMB are provided here courtesy of **BioMed Central**

PubMed Central Canada is a service of the Canadian Institutes of Health Research (CIHR) working in partnership with the National Research Council's national science library in cooperation with the National Center for Biotechnology Information at the U.S. National Library of Medicine(NCBI/NLM). It includes content provided to the PubMed Central International archive by participating publishers. |