 Research article
 Open Access
 Published:
The distanceprofile representation and its application to detection of distantly related protein families
BMC Bioinformatics volume 6, Article number: 282 (2005)
Abstract
Background
Detecting homology between remotely related protein families is an important problem in computational biology since the biological properties of uncharacterized proteins can often be inferred from those of homologous proteins. Many existing approaches address this problem by measuring the similarity between proteins through sequence or structural alignment. However, these methods do not exploit collective aspects of the protein space and the computed scores are often noisy and frequently fail to recognize distantly related protein families.
Results
We describe an algorithm that improves over the state of the art in homology detection by utilizing global information on the proximity of entities in the protein space. Our method relies on a vectorial representation of proteins and protein families and uses structurespecific association measures between proteins and template structures to form a highdimensional feature vector for each query protein. These vectors are then processed and transformed to sparse feature vectors that are treated as statistical fingerprints of the query proteins. The new representation induces a new metric between proteins measured by the statistical difference between their corresponding probability distributions.
Conclusion
Using several performance measures we show that the new tool considerably improves the performance in recognizing distant homologies compared to existing approaches such as PSIBLAST and FUGUE.
Background
The ongoing sequencing efforts continue to discover the sequences of many new proteins, whose function is unknown. Currently, protein databases contain the sequences of about 1,800,000 proteins, of which more than half are partially or completely uncharacterized [1]. Typically, proteins are analyzed by searching for homologous proteins that have already been characterized. Homology establishes the evolutionary relationship among different organisms, and the biological properties of uncharacterized proteins can often be inferred from those of homologous proteins. However, detecting homology between proteins can be a difficult task.
Our ability to detect subtle similarities between proteins depends strongly on the representations we employ for proteins. Sequence and structure are two possible representations of proteins that hinge directly on molecular information. The essential difference between the representation of a protein as a sequence of amino acids and its representation as a 3D structure traditionally dictated different methodologies, different similarity or distance measures and different comparison algorithms. The power of these representations in detecting remote homologies differ markedly. Despite extensive efforts, current methods for sequence analysis often fail to detect remote homologies for sequences that have diverged greatly. In contrast, structure is often conserved more than sequence [2–4], and detecting structural similarity may help infer function beyond what is possible with sequence analysis. However, structural information is sparse and available for only a small part of the protein space.
One may argue that the weakness of sequence based methods is rooted in the underlying representation of proteins, the model used for comparison and/or the comparison algorithm, since in principle, according to the central dogma of molecular biology, (almost) all the information that is needed to form the 3D structure is encoded in the sequence. Indeed, in recent years better sequencebased methods were developed [5–8]. These methods utilize the information in groups of related sequences (a protein or domain family) to build specific statistical models associated to different groups of proteins (i.e. generative models) that can be used to search and detect subtle similarities with remotely related proteins. Such generative models assume a statistical source that generates instances according to some underlying distributions, and model the process that generates samples and the corresponding distributions.
When seeking a new similarity measure for proteins that departs from sequence and structure, a natural question is what is the "correct" encoding of proteins? Several works studied the mathematical representation of protein sequences based on sequence properties such as amino acid composition or chemical features [9–12]. However, these representations had limited success, since they did not capture the essence of proteins as ordered sequences of amino acids.
Recently, alternative representations of protein sequences based on the socalled kernel methods were proposed. These methods are drawn from the field of machine learning and strive to find an adequate mapping of the protein space onto the Euclidean space where classification techniques such as support vector machines (SVM) or artificial neural networks (ANN) can be applied. Under the kernel representation, each protein is typically mapped to a vector in a (highdimensional) feature space, and the resulting vector is termed feature vector. Subsequently, an inner product is defined in the feature space in order to estimate the (dis)similarity among different proteins. A major advantage of the kernel methods is that with an adequate choice of the kernel function, the feature vectors need not be computed explicitly in order to evaluate the similarity relationships. In addition, the users may build a specific feature space such that the kernel function directly estimates these relationships. However, string kernels do not easily lend themselves to this property, and therefore they need to be computed explicitly. The main difference between the different kernel methods reside in the definition of feature elements which are either related to the parameters of some generative process for each group of related proteins or some measure of similarity among the protein sequences.
For instance, the SVMFisher algorithm [13] uses the Fisher kernel which is based on hidden Markov models (HMMs). The components of the feature vector are the derivatives of the loglikelihood score of the sequence with respect to the parameters of a HMM that has been trained for a particular protein family. Tsuda et. al. [14] implemented another representation based on marginalized and joint kernels and showed that the Fisher kernel is in fact a special case of marginalized kernel. They also experimented with the marginalized count kernels of different orders, that are similar to the spectrum kernel which was first introduced by [15]. The spectrum kernel is evaluated by counting the number of times each possible klong subsequence of amino acids (kmer) occurs in one given protein. The marginalized count kernel takes into account both the observed frequency of different subsequences and the context (e.g. exon or intron for DNA sequences). The mismatchspectrum kernel [16] is a generalization of the spectrum kernel that considers also mutation probabilities between kmers which differ by no more than m characters. The homology kernel [17] is another biologically motivated sequence embedding process that measures the similarity between two proteins by taking into account their respective groups of homologous sequences. It can be thought of as an extension of the mismatchspectrum kernel by adding a wildcard character and distinguishing the mismatch penalty between two substrings depending on whether the sequences are grouped together or not.
The covariance kernel is another type of kernel that uses a framework similar to the one employed by our method. The covariance kernel approach is probabilistic and much work is focused on the implementation of the generative models. In [18], the covariance kernel is based on the mutual information kernel which measures the similarity between data samples and a certain generative process. The generative process is characterized by a mediator distribution defined between the (usually vague) prior and the posterior distribution. On the other hand, [19] focuses on the representation of biological sequences using the probabilistic suffix tree [20] as the generative model for different groups of related proteins. The proposed kernel generates a feature vector for protein sequences, where each feature corresponds to a different generative model and its value is the likelihood of the sequence based on that model. Finally, we mention another related work [21] that uses the notion of pairwise kernel. Under this framework, each protein is represented by a vector that consists of pairwise sequence similarities with respect to the set of input sequences. It is also worth mentioning the many related studies in the field of natural language processing and text analysis. For example, an approach that in some ways is similar to the pairwise and covariance kernels and in other ways is related to the spectrum kernel approach, is used in [22] to represent verbs and nouns in English texts, with nouns represented as frequency vectors over the set of verbs (based on their association with different verbs) and vice versa. The nouns and verbs are then clustered based on this representation. Studies that attempted to devise automatic methods for text categorization and webpage classification often use similar techniques, where the text is represented as a histogram vector over a vocabulary of words (e.g. [23]).
Here we study a general framework of protein representation called the distanceprofile representation, that utilizes the global information in the protein space in search of statistical regularities. The representation draws on an association measure between input samples (e.g. proteins and protein families) and can use existing measures of similarity, distance or probability (even if limited to a subset of the input space for which the measure can be applied). This representation induces a new measure of similarity for all protein pairs based on their vectorial representations. Our representation is closely related to the covariance and pairwise kernels described above. However, it is the estimation of pvalues through statistical modeling of the background process, coupled with the transformation to probability distributions, the noise reduction protocols and the choice of the distance function that result in a substantial impact on the performance, and we demonstrate how an adequate choice of the score transformation and the distance metric achieves a considerable improvement in detection of remote homologies.
This paper is organized as follows. We first introduce the notion of distanceprofile. We describe how to process the feature vectors through noise reduction, and pvalue transformation followed by normalization. We compare the performance of our new method against several standard algorithms by testing them on a large set of protein families.
Results
The distanceprofile representation
Our goal is to seek a faithful representation of the protein space that will reflect evolutionary distances even if undetectable by means of existing methods of comparison. We explore a technique based on the distanceprofile technique described in [25] and its derivative as applied to protein sequences in [26]. The power of the representation stems from its ability to recover structure in noisy data and boost weak signals [25, 26].
The distanceprofile representation is simple and can be applied to arbitrary spaces $X$, $Y$ if there exist an association measure between instances of $X$ and instances of $Y$ such as a distance function, similarity function or a probability measure. Given an instance X in the input space $X$, a reference set {Y_{1}, Y_{2}, ... Y_{ n }} of entities in $Y$ (e.g. proteins or protein families, sequences or generative models) and an underlying association measure, we associate with the instance X a position in a high dimensional space, where every coordinate is associated with one member of the reference set and its value is the similarity with that particular reference object. I.e., we map X to a vector of dimension n in the host space
This simple representation leads to the definition of a new distance or similarity measure among samples based on their vectorial representation, and when the reference set is identical to the input space ($X$ = $Y$), an iterative application of this representation can be used to form hierarchical clustering over the input samples [25]. In this paper we demonstrate the application of this method to the problem of homology detection between distantly related proteins.
One might observe the resemblance of our method with pairwise kernels and covariance kernels mentioned in the 'Background' section. However, it is the processing of the feature vectors and the choice of the metric, as is laid out next, which are the crucial ingredients that differentiate our method from the previous studies. As exemplified in this paper, under the proper transformations the distanceprofile representation has mathematical and statistical interpretations that have other implications, and it is these transformations that deem this method very effective for homology detection, database search and clustering.
The reference set
Remotely related proteins usually share little sequence similarity, however, they are expected to have similar structures. Therefore, as a reference set for our experiments we chose a nonredundant structure library consisting of domain structures that represent the current protein structure space. The set is derived from the SCOP database [27], release 1.57. Specifically, we used the Genetic Domain Sequence dataset that we downloaded from the Astral webpage [28]. The dataset is obtained from 14,729 entries in the Protein Data Bank (PDB) [29] and contains only protein domains with less than 40% identity between pairs of sequences. Our library consists of 3,964 distinct SCOP domains covering in total 644 folds, 997 superfamilies, and 1,678 families. For notation purpose, we denote this library of template proteins by SCOPDB.
The association measure
We rely on "structureaided" sequence alignment to bridge the gap between the sequence space and structure space. Given the library of structures $Y$ = {Y_{1}, Y_{2}, Y_{3}, ..., Y_{ n }}, every protein sequence P is mapped to a structurespecific ndimensional feature vector, as is described above, where the association measure S(P, Y_{ i }) is the similarity score of the sequencestructure alignment between the sequence P and the template structure Y_{ i }, computed with the FUGUE threading algorithm [30] (see Appendix). From this point on we discuss the application of the distanceprofile representation with threadingbased association measures. However, we note that the methods described in this paper can be used to process feature vectors using other association measures. In the 'Discussion' section we show that a similar approach applied to sequenceprofile alignment scores also produces a considerable improvement in detecting remote homologies.
Processing feature vectors: pvalue conversion and normalization
The choice of the underlying association function S(P, Y_{ i }) can have a drastic impact on the effectiveness of the representation and we tested several variations.
The score association measure
A possible choice is obviously the score reported by the algorithm that compares entities of $X$ with entities of $Y$. (for example, the zscore reported by the FUGUE threading algorithm). We denote feature vectors that are based on the score association measure by P^{score}.
The pvalue association measure
If the association measure is distributed over a wide range, the most significant scores will inevitably shadow other numerically less important but still significant matches, thus reducing the sensitivity of the representation. This is the case with most types of similarity scores, including the threading zscores assigned by the FUGUE program.
To address this problem we convert the zscores to their underlying cumulative distribution function (cdf) value, where the amplitude of outlier zscores is reduced to within a reasonable range. As was shown in [31], the zscores of local alignment scores follow the extreme value distribution (EVD), see Figure 1, whose cumulative function F(x) takes the form
F(x) = Prob(x' ≤ x) = e^{φ(x)} where φ(x) = e^{λ(xμ)}. (2)
Based on this background distribution we replace the original zscores with a new association measure such that S'(P, Y_{ i }) = F(S(P, Y_{ i })) where S(P, X_{ i }) is the similarity zscore reported by FUGUE. With this transformation, all coordinates are bounded between 0 and 1, with high zscores transformed to values close to 1. Note that the pvalue of a given zscore x is pvalue(x) = 1  F(x). We denote feature vectors that are based on the F(x) association measure by P^{pvalue}. It should also be noted that in practice F(x) = 1  pvalue(x) = 1 for large x because of machine precision limitations. Therefore, the pvalues that are associated to significant zscores (typically above 5) are approximated by their empirical distribution, thus allowing distinction between a pair of highly significant yet numerically disparate zscores, e.g. 10 versus 60.
The probability association measure
the third variation we tested is based on a simple normalization of each feature vector to form a probability distribution. This transformation enables us to explore distance measures that are suited for probability vectors, as described in section 'Metrics and score functions'. Indeed, in this representation, the normalized vector entries can be considered as the coefficients of a mixture model where the components models are the protein structures, each one inducing a different probability distribution over the protein sequence space. This interpretation emphasizes the similarity with covariance methods which also resort to a probabilistic representation of different protein families as described in the 'Background' section. We denote feature vectors that are based on this association measure by P^{prob}.
Reducing noise: sparse feature vectors
Our reference set is composed of proteins that belong to different protein families and folds (see section 'The reference set'). Within that data set no two proteins share more than 40% sequence identity. Therefore, for a given query protein we expect to observe only a few significant similarity values in the vector P. That is, the entries that correspond to the structural templates of protein families that are related to the query. In other words, the feature vectors contain many entries that are essentially random and meaningless. These random numbers will contribute to the differences between feature vectors, thus masking possibly significant similarities. To reduce noise due to unrelated proteins we eliminate all entries with zscore below a certain threshold τ, or pvalue above a certain threshold τ', to reflect the fact that the corresponding sequencestructure pair is considered irrelevant (Another alternative is to weight the differences by the significance of the measurements. However, to speed up the processing and comparison of feature vectors we adopted the threshold approach.) The parameter τ(or τ') is optimized to maximize performance, as described in section 'Parameter optimization'. Note that entries with low zscores that are filtered in this step (assigned 0 zscore) remain zero under the transformation to the cdf pvalue as described above. The processed feature vector is denoted by ${\widehat{P}}^{score}$.
The noise reduction is applied to the original feature vectors and is followed by the pvalue conversion and the normalization to yield new feature vectors P^{pvalue}and P^{prob}, respectively. To illustrate the impact of our procedures on the distance profiles, let us consider the example of two closely related proteins d 1qmva_(Thioredoxin peroxidase 2) and d 1hd 2a_ (Peroxiredoxin 5) that belong to family c.47.1.10 under the SCOP denomination. The sequences were threaded against the SCOP library of structural domains, and feature vectors were compiled from the zscores reported by FUGUE. In Table 1 we report the 2163th up to the 2169th entries of their original feature vectors as well as their transformations after noise reduction, pvalue conversion and normalization. As this example demonstrates, the zscore entries are noisy and spread over a wide numerical range. For instance, the 2167th entry of both vectors correspond to their threading score versus the structure of d 1prxa_ (HorF6 peroxidase), another protein that is in the same SCOP family c.47.1.10. While the zscore reaches 15.79 for d 1qmva_, it is only 6.38 for d 1hd 2a_. These large differences will inevitably result in large distances between the feature vectors despite the fact that they have significant zscore values in the same positions. The pvalue conversion and normalization (third and fourth rows in the table) resolve this problem by rescaling scores to within a fixed interval.
Metrics and score functions
Under the distanceprofile representation, the similarity (distance) between two protein sequences P and P' is defined as the similarity (distance) of their corresponding feature vectors
S(P, P') = f(P, P')
The function f can be a similarity function or a distance function and we considered several different variants. We tested the L_{2} norm (the Euclidean metric) and the L_{1} norm (the Manhattan distance). For probability distributions we also tested the JensenShannon (JS) measure of divergence [34]. Given two probability distributions p and q, for every 0 ≤ λ ≤ 1, their λJensenShannon divergence is defined as
where D^{KL}[pq] is the KullbackLeibler (KL) divergence [35] defined as ${D}^{KL}[pq]={\displaystyle {\sum}_{i}{p}_{i}{\mathrm{log}}_{2}\frac{{p}_{i}}{{q}_{i}}}$ and r = λ p + (1  λ)q can be considered as the most likely common source distribution of both distributions p and q, with λ as a prior weight (without a priori information, a natural choice is λ = 1/2). Unlike the KullbackLeibler measure, the JS measure is symmetric and bounded. It ranges between 0 and 1, where the divergence for identical distributions is 0. This measure has been used successfully in [7, 36, 37] to detect subtle similarities between statistical models of protein families and in [38] for automatic domain prediction from sequence information.
As an alternative approach to assess the similarity of a pair of proteins based on their distanceprofile representation we propose the pvaluedistance (PD) function. This function assesses the distance between two proteins by estimating the probability to observe a random protein with a feature vector inside the volume delimited by their two feature vectors. The smaller the volume is, the more similar are the two vectors. The function operates on the pvalues used to form the feature vectors P^{pvalue}. Given two feature vectors P and Q that correspond to proteins P and Q, we consider one coordinate i at a time and estimate the total probability mass of samples whose ith feature is bounded between the feature values p_{ i }and q_{ i }as is illustrated in Figure 2a. Since each representative in the reference set induces a complex highdimensional distribution over the protein sequence space, the onedimensional pvalue measure p_{ i }can only serve to approximate a certain perimeter in the sequence space of sequences that are as similar or more similar to the i th source than the protein P. Therefore, we use the least significant pvalue of p_{ i }and q_{ i }as an upper bound estimator of the volume of relevant instances, as illustrated in Figure 2b. The total volume is computed by taking the product over all coordinates.
Formally, consider the two pvalue feature vectors ${P}_{1}^{pvalue}=({p}_{1}^{1}\dots {p}_{n}^{1})$ and ${P}_{2}^{pvalue}=({p}_{1}^{2}\dots {p}_{n}^{2})$ that are obtained by mapping each zscore z_{ i }to its pvalue p_{ i }using the EVD background distribution as described in section 'Processing feature vectors'. Their pvalue distance is defined as
In practice, the PD score is evaluated through its logarithm:
(It should be noted that here the measure pvalue(z) is used directly to define the feature values, as opposed to F(z) = 1  pvalue(z) that was used before when compiling the feature vectors P^{pvalue}. However, to simplify notation we also refer to these feature vectors as P^{pvalue.)}
To distinguish all the measures discussed in this section from the association measures discussed in section 'Processing feature vectors', we refer to all of them from now on as distance metrics, although they are not necessarily metrics or distance functions.
Discussion
Dataset preparation
We use the SCOP classification of protein structures [27] as our benchmark. The SCOP database is built mostly based on manual analysis of protein structures and is characterized by a hierarchy with four main levels: class, fold, superfamily and family. Proteins that belong to the same family display significant sequence similarity that indicates homology. At the next level (superfamily), families are grouped into superfamilies based on structural similarity and weak sequence similarity (e.g. conserved functional residues). Proteins that belong to different families within the same superfamily are considered remotely related. It is this level that has been used in many studies to evaluate sequence comparison algorithms (e.g. [7, 39, 40]). The challenge is to automatically detect similarities between families within the same superfamily, that were established manually by the SCOP experts.
To determine the optimal parameters for the distanceprofile representation and compare its performance to other algorithms, we split the library SCOPDB into a training set and a test set. Since our purpose is to test the ability to find remotely related proteins at the superfamily and fold levels, we first discard all proteins that have fewer than 5 remote homologs in SCOPDB (i.e. are in superfamilies of size 5 or less). From the remaining 2,570 sequences we randomly select 100 for the training set, and the rest (2,470 sequences) are compiled into the test set.
Performance indices
To evaluate the performance of a given method for a specific query protein we compare the protein against SCOPDB, sort the results and assess the correlation of the sorted list with established homology relations. In our experiments we consider two proteins to be related (a positive pair) if they belong to the same SCOP superfamily. All other pairs are treated as negatives. We also consider a more relaxed definition, where proteins are deemed related if they belong to the same SCOP fold.
A popular measure of performance used in signal detection and classification is the ROCk measure [41]. This is the cumulative count of positive samples detected until k negative samples are met in the sorted list of results. We use four different indices to assess performance, all are variations on commonly used sensitivity and accuracy measures. These indices measure the ability of a given algorithm to recognize different levels of structural similarity between protein sequences and within neighborhoods of varying sizes:

The ROC1 superfamily index (ROC1S).

The ROC1fold index (ROC1F).

The topsuperfamilysuperfamily index (TSS).

The topfoldfold index (TFF).
Given the sorted list of results for a query protein p, the ROC1S index totals the number of proteins in the same superfamily as p that are observed from the top of the sorted list until the first false match (i.e. different superfamily) appears. Likewise, the ROC1F index is defined by counting the number of proteins in the same fold as p from the top of the sorted list until the first match that involves two proteins with different folds. The last two indices are characterized by the following generic definition: the topXY index for a protein p counts the total number of proteins sharing the same Y SCOP denomination among the n_{ X }closest sequences of p, where n_{ X }is the total number of sequences in the library that have the same X SCOP denomination as p itself (For example, to compute the topfoldfold index for a query protein that belongs to a SCOP fold containing n proteins, we look at the top n proteins in the sorted list and count how many of them are actually in the same fold as the query protein). Selfsimilarity is ignored in the assessment of all performance indices.
Note that all these indices are closely related to sensitivity measures at different levels, however, the relevant neighborhood is calibrated on a persuperfamily/fold basis. And while the two ROC indices stop as soon as one false match is encountered, the topXY indices credit a method that detects many true positives at the top even if mixed with a few false positives. Therefore, a method yielding a lower ROC1 index but higher TSS (or TFF) should be still considered successful since it clusters the query close to a larger number of related objects.
To obtain the overall performance of a method with respect to a set of queries, we simply take the sum of all their corresponding performance indices as the global result. I.e. given a query set Q = {q_{1}, ..., q_{ n }}, the performance of a method M, using index I is
where I(M, q_{ i }) is the performance of the method M for the protein q_{ i }(for example, TFF(FUGUE, q_{ i }) is the TFF performance of FUGUE on protein q_{ i }).
Normalized performance indices
The global performance indices might be affected by the specific make up of the query set, since superfamilies and folds vary greatly in size. In order to reduce a potential bias due to large superfamilies/folds that perform very well, we use also normalized performance indices. To compute these, we divide each index by its upper bound, i.e. the total number of proteins in the SCOPDB library that are classified to the same superfamily/fold as the query (except itself). For example, for a query protein q that belongs to a fold F of size n_{ F }the normalized TFF measure is given by
TFF^{N}(M, q) = TFF (M, q)/(n_{ F } 1)
This ratio is essentially the sensitivity of the method M on the query q, over a match list of size n_{ F }. The size of the relevant match list changes with each query.
The resulting ratios are then averaged at the superfamily level so as to obtain a representative average performance index per protein superfamily that is bounded between 0 and 1. Finally, the final index is computed by averaging over all the representative indices. I.e. given a query set Q = {q_{1}, ..., q_{ n }} that are classified to k different superfamilies F_{1}, ..., F_{ k }with n_{ i }queries in superfamily F_{ i }, then the overall performance of a method M, using the normalized index I^{N}is given by
Parameter optimization
Our method depends on three parameters: the noise reduction level (the zscore cutoff threshold), the association measure and the distance metric. We consider all possible combinations among five zscore cutoff values (τ= 2.5 to 4.5 by increment of 0.5), three association measures that are P^{score}(zscore), P^{pvalue}(pvalue) and P^{prob}(prob), and four distance metrics: L_{1}, L_{2}, the JS divergence measure and the new pvaluedistance (PD) measure. Note that the JS measure is only applicable to normalized vectors since it requires the input vector to represent a probability distribution and the PD measure is only applicable to the pvalue vectors.
To find the best parameters we first establish the feature vectors for each sequence in SCOPDB. Each combination of an association function (zscore, pvalue, prob) and a noise threshold τ leads to a different set of feature vectors. Next, we compute the distance between the feature vector of each training sequence and the vectors of all sequences in SCOPDB, using one of the distance metrics of section 'Metrics and score functions'. Each combination of feature vectors and a distance metric results in a different set of "match lists". These sets are then evaluated using the performance indices described above. The results are reported in Table 2. For clarity, the best combination of parameters is printed in boldface for each index. To determine the optimal set of parameters, we first examine the effect of the association function. The results are unanimous with all five performance indices: the pvalue association measure achieves the best performance, followed by the prob association measure. However, the pvalue association measure is only effective when coupled with the PD distance metric, while the prob association measure seems to produce good results with all distance metrics and especially with L_{1} and the JS divergence measure. As for the distance metric, its influence depends on the association function. The PD measure is applicable only to the pvalue vectors but it produces excellent results, much better than the traditional L_{1} and L_{2} metrics. Under the prob association measure, L_{ I }and JS metrics produce the best results while L_{2} leads to significantly worse performance. With the two other association measures L_{1} and L_{2} metrics yield similar results. Finally, the optimal value of τ is approximately around 3.5 for most combinations.
In conclusion, these results suggest that the best performance is achieved with the pvalue association measure, the pvaluedistance (PD) metric and a zscore cutoff threshold τ= 3.5. The same conclusions are reached when using the normalized performance indices. It should be noted that although the prob association measure is not as good as the pvalue measure (combined with the PD metric), it still produces very good performance overall (with the JS or the L_{1} metrics), further justifying the statistical interpretation of our representation and its equivalence with the coefficients of a mixture model over independent sources (as discussed in section 'Conclusions').
Figure 3a,b illustrate the distribution of the pairwise L_{1}distances between proteins under the representations P^{score}and P^{prob}, respectively. We observe that the pairwise distance between feature vectors P^{score}spreads over a very large range and it is difficult to set a natural threshold below which feature vectors can be considered similar. In contrast, for P^{prob}, about 95% of the pairwise distances are equal to 2, the maximum L_{1} distance. This is the distance between pairs of normalized feature vectors (probability distributions) whose set of nonzero features do not overlap. The distribution shown in Figure 3b only focuses on those pairwise distances smaller than 2. The combination of noise reduction, pvalue conversion and normalization procedures effectively delimits the range of the pairwise distances, and any distance smaller than 2 indicates common features between the feature vectors.
Figure 3c shows the empirical distribution of the PD measure between feature vectors P^{pvalue}. The distribution is multimodal (see Appendix for a more detailed discussion). This emirical distribution is used to estimate the significance of the PD measure.
Performance Comparison
We compare the performance of our algorithm against several existing algorithms, namely FUGUE [30], BLAST [42] and PSIBLAST [5]. Table 3 reports the results for all algorithms based on the training sequences. The DP algorithm was run with the optimal parameters that were determined in the previous section. With BLAST, we simply compare the query sequence with all sequences in SCOPDB. With FUGUE, we thread the query sequence into each one of the structural templates of the proteins in SCOPDB. For reference, we also list the results obtained with the structure comparison algorithm URMS [43]. The URMS results provide a rough upper bound on the expected performance since the algorithm is directly using the structural information which underlies many of the homology relationships in SCOP.
As Table 3 shows, FUGUE improves the ROC1S and ROC1F indices by 6 and 9% over PSIBLAST while the TSS and TFF indices are increased by a magnitude of 24 to 60%. The distanceprofile method DPFUGUE improves over PSIBLAST by more than 60% on all indices. With respect to FUGUE, it increases by 62 and 94% the ROC1S, ROC1F indices and about 30% for both the TSS and TFF indices. This margin of improvement over FUGUE is also maintained over the test set (Table 4). Quantitatively, the ROC1S and ROC1F are improved by about 90% and the TSS, TFF indices by about 42%. This is a substantial improvement that is larger than the relative improvement of PSIBLAST with respect to BLAST or that of FUGUE with respect to PSIBLAST, thus indicating that the statistical fingerprints of the distanceprofile representation encode more information and are more sensitive than a direct comparison of the objects they operate on.
Figure 4 displays the ROC50 curve for each algorithm. As opposed to the previous indices that are computed per query and then averaged, these ROC curves are generated by aggregating all pairwise similarities computed with a given method and sorting the list in descending order of significance. Each curve plots the cumulative number of positives versus the cumulative number of negatives until 50 negatives are observed (where positives are set at the superfamily level). The results agree with the previous indices, and the distanceprofile method significantly outperforms all other methods as the amount of positives detected reaches almost 12,500 (compared to 8,000 with FUGUE and 7,000 with PSIBLAST) when the number of negatives reaches 50. A similar ROC50 curve is observed at the fold level as well. The results above demonstrate that our method can effectively detect remote homologies. However, an interesting question that one might raise is: under what scenarios the distanceprofile representation can improve the results over the original method from which it is derived. To answer this question, we contrast the performance of DPFUGUE and FUGUE for individual queries. Specifically, for each query in the test set we plot the normalized TSS index of DPFUGUE vs. the TSS index of FUGUE for the same query. As the graph shows, in most cases the improvement occurs when the TSS index of the original method is above 20%, and on average one may expect an improvement if it is above 10% (i.e. if as little as 10% of the superfamily are observed in the proximity of the query within a neighborhood as big as the superfamily).
The distanceprofile representation over sequenceprofile metrics
To test the effectiveness of the distanceprofile method on other types of input we applied it to feature vectors that were generated with PSIBLAST, a sequence to profile alignment algorithm [5]. The feature values are set to the log (evalue) of the similarity score, as reported by PSIBLAST after four iterations, unless the program converged before (as Table 3 demonstrates, the performance plateaus after four iterations). The PSIBLAST evaluebased feature vectors are processed in a similar fashion to the FUGUE zscorebased feature vectors. Each evalue e is mapped to its corresponding pvalue pvalue(e) = 1  exp(e) as in [44] and the value of the corresponding feature is defined as 1  pvalue(e) = exp(e). If the evalue is greater than a given threshold τ' then we reset the value of the feature. Finally, the normalization converts the resulting feature vectors to probability distributions.
The parameters are optimized using a similar procedure to the one described in section 'Parameter optimization'. The optimal parameters are sought among the combinations of 4 evalue cutoff thresholds (τ' = 0.01, 0.1, 1, 10), two association measures (P^{pvalue}(pvalue), P^{prob}(prob)) and three possible metrics (L_{1}, L_{2} and JS divergence measure). In this case, the best combination based on the training set is (τ' = 10, L_{1}, prob).
Table 5 compares the performance indices associated to PSIBLAST after 4 iterations with DPPSIBLAST with parameters (τ' = 10, L_{1}, prob). The distanceprofile representation clearly improves the performance compared to PSIBLAST (increases the indices by about 20% to 38%) and even to FUGUE in some cases, but is not as powerful as the distanceprofile representation when applied to FUGUE (compare to the results of Table 3). It is also interesting to note that the overall improvement of DPPSIBLAST over PSIBLAST seems smaller than that of DPFUGUE over FUGUE. As we showed at the end of the previous section, the magnitude of improvement depends on the initial success of the association measure among the queries and the reference set. Since PSIBLAST yields less instances with performance that exceeds the minimal threshold (i.e. cases that can be improved using the DP representation), it follows that the overall improvement of DP representation on PSIBLAST is less significant compared to that over FUGUE. Detailed examples are discussed in the Appendix.
The effect of multiple sequence alignment on the performance
All our experiments were performed in a singlequery mode. I.e. in each test case a single query sequence is compared against the database. However, there are multiple reports [40, 45, 46] that suggest that significant performance gain can be obtained when using a multiple sequence alignment (MSA) or a sequence profile as a query.
To test the effect of MSA on the performance we had the change our experimental setup. We tested the impact of the new setting on PSIBLAST and FUGUE based on 7 SCOP families that were randomly chosen from all families for which the performance of PSIBLAST and FUGUE was poor. For each family we generated a MSA of all sequences in the family using CLUSTALW [47]. Each MSA was also converted to a position specific scoring matrix (profile). These MSA were used as queries for FUGUE (instead of the individual sequences) and the profiles as input for PSIBLAST, in search for related sequences in SCOPDB. To fairly compare the results of PSIBLAST and FUGUE in the MSA mode to the DP method we had to run our method under a similar setup. The "MSA" mode of the DP method utilizes the information from all the sequences in a protein family in the same spirit a MSA does so, by combining the distance profiles associated to each member of the SCOP family. For each sequence in SCOPDB, we take the average of its distance versus each member of the family in question in order to compute the "familyspecific" distances with respect to SCOPDB.
In Table 6, we summarize for each of the SCOP families the performance of FUGUE, PSIBLAST and DPFUGUE under the MSAquery mode. Family members are not counted since they were already used to build the MSA. The adjusted indices thus indicate how many remote homologs are discovered in the MSAquery mode. For comparison we also report the average performance under the singlequery mode. As the results demonstrate, the MSA mode improves over the standard single mode, and in most cases our method performs better than FUGUE and PSIBLAST, in particular in terms of the TSS index (reflecting how well remote homologs are clustered at the top of the ranked list). It should be noted that when we analyzed FUGUE in a similar manner to DPFUGUE (i.e. by averaging over the individual family members) the results improved over the MSA mode of FUGUE, but not as much as DPFUGUE in MSA mode.
We should comment that the MSA setup differs from our original idea of using the DP representation to perform unsupervised clustering of objects based on their distance profile. In the unsupervised learning mode we do not have information on the family association of each sequence, and therefore it is difficult to define the exact set of related sequences from which to generate a multiple sequence alignment.
Superfamily and fold prediction with the distanceprofile method
We tested the power of our method on a new set of protein sequences that were added to SCOP after we compiled our benchmark. Our goal was to test if the method can classify new sequences to their correct class. The new set consists of proteins in release 1.67 of SCOP that were not included in our SCOPDB dataset (based on release 1.57 of SCOP) and either belong to new families within existing superfamilies, new superfamilies within known folds or completely new folds. For instance, the family b.2.3.4 did not exist in the SCOP 1.57 database. This family is part of the b.2.3 superfamily that in release 1.57 contains the families b.2.3.1, b.2.3.2, b.2.3.3 and a total of 5 representatives in our reference set.
In total we found 624 sequences belonging to 453 new families within known superfamilies, 267 sequences associated to 182 new superfamilies within known folds and 375 sequences in 245 new folds, all with less than 40% identity between pairs of sequences. Each one of these new sequences was compared against all the sequences in SCOPDB using all of the methods evaluated in this paper, and the matches were sorted based on the score or distance, as before. To apply the distanceprofile method the sequences were first processed and mapped to feature vectors as described in section 'Results'.
Table 7 summarizes the results using our four performance indices. We note that only the ROC1F and TFF indices are reported for sequences belonging to new superfamilies within known folds (since none of these new sequences have superfamily members in the reference set). As the table demonstrates, for sequences belonging to new families, our method consistently improves homology detection. The improvement over FUGUE is significant with the ROC1S and ROC1F indices increasing by more than 100% (40% with normalized measures) while the TSS and TFF indices are improved by more than 30% (15% in normalized form). For sequences belonging to new superfamilies DPFUGUE also improves over the three other methods, however, the improvement is smaller. As for the sequences in new folds, our experiment indicates that in most cases DPFUGUE cannot improve the results, the reason being that FUGUE itself typically is unable to detect any significant match with members of our reference set. Finally, we conducted another experiment to study the performance of our method in detecting distant homologs that share little sequence identity. In order to do so, we selected from the new SCOP sequences those having less than 20% sequence identity with respect to the proteins in our reference set. We obtained 277 such sequences associated to new families and 103 to new superfamilies. Table 8 again shows that our method outperforms BLAST, PSIBLAST and FUGUE, with the exception of the TFF index over sequences that belong to new superfamilies within known folds, where a slight decrease is observed. This can be explained by the fact that FUGUE itself does not perform satisfactorily (the normalized TFF is only about 2.4%).
Conclusion
We study a new method for remote homology detection that utilizes global information on the proximity of entities in the protein space. Our method relies on the distanceprofile representation of proteins and protein families that maps each query protein to a highdimensional feature space, where the coordinates are determined by some association measures with respect to a reference set. These vectors are then processed and transformed to sparse feature vectors that are treated as statistical fingerprints of the query proteins. We experimented with several different types of association measures and demonstrated how an adequate choice of distance metric combined with a proper transformation of the feature vectors through noise reduction, pvalue conversion and normalization can greatly increase the performance of homology recognition (or prediction) compared to the existing approaches.
Interestingly, excellent performance is obtained with normalized feature vectors that correspond to probability distributions. The success of the distanceprofile method in general and especially when using probability distributions suggests a relation to mixture models [48]. Specifically, one can consider this representation as the coefficients of a mixture model or of a functional expansion, similar to the Taylor polynomial expansion. Given a set of basis functions such as polynomial functions one can span the complete space of continuous wellbehaved functions with the right coefficients. The same principle applies here as our reference set essentially defines a set of basis functions. In statistical terms, each element of the reference set induces a different probability distribution over the protein sequence space. In our experiments the reference set is composed of protein structures, each one can be perceived as a different generative model. The likelihood of generating a sequence according to a model can be estimated by computing the probability that the sequence will fold into the corresponding structure, as measured with the pvalue association measure over the threading similarity score. Although these probability distributions (that correspond to different elements in the reference set) do not necessarily meet the requirement of orthogonality to be considered "basis functions", a sufficiently diverged set of proteins is expected to have the desired properties. It has yet to be defined more precisely what sufficiently diverged means and the minimal required diversity.
One intriguing aspect that has not been fully addressed is the interaction between the association function, the distance metric and the zscore cutoff value. In some cases the coupling is not surprising. For example, when the prob association function is used, the L_{2} metric clearly underperforms compared to L_{1} and JS metrics, as expected, since the vectors compared correspond to probability distributions. With the other association measures, L_{1} and L_{2} perform similarly. Study of the theoretical aspect of this phenomenon will help understand how to take further advantage of these feature vectors to cluster the protein sequences more accurately.
A word of caution is in order here regarding the evaluation. While SCOP is considered the gold standard, it is not perfect and often one can find misclassifications [7, 24, 49]. While it is hard to estimate the exact rate of errors, it is unlikely that they exceed thousands and we do not anticipate the results to change drastically even if these misclassification were corrected.
We should also mention that the DP representation is not effective for detailed, atomresolution prediction of 3D structure or for sitespecific functional annotation, since it cannot produce alignments. Another weakness is that the distanceprofile representation and the new pvaluedistance measure may fail to distinguish two proteins if they have almost identical "preferences" for the known structures but different preferences for other, unknown structures that are yet to be determined. However, given the current size of the protein structure space, it is expected that for most proteins the available structural information (as embodied in our reference set) is sufficient to estimate their proximity. Indeed, only 20% of the new SCOP 1.67 sequences were assigned to new folds, Clearly, as more structures are determined and integrated into the reference set, the distanceprofile representation is expected to improve.
One potential contribution of this work is the possibility of combining the transformations described in section 'Processing feature vectors' to the feature vectors used by existing kernel methods. These techniques can effectively reduce noise and increase the accuracy of classification of the feature space. In addition, since the feature vectors are typically sparse after noise reduction, an efficient computation of the kernel function can be implemented in a highdimensional feature space.
Finally, a major advantage of the distanceprofile representation is in its great flexibility. The underlying association measure can be based on sequence, structure, predicted function, threading, or any other similarity measure. Clearly, more distinctive association measures will create better representations. Indeed, the FUGUE zscore is clearly a better choice than the PSIBLAST evalue since FUGUE exploits sequencestructure alignment information rather than just sequence alignment information. If the association measure can report a significance value (such as zscore or evalue) that emphasizes extremes and pinpoint the interesting cases, the statistical measure will be preferred over the raw score. This is especially useful when the raw score is meaningless by itself. In these cases one needs a yardstick or a scale to tell what is close and what is far and the statistical estimates provide such a scale. Nevertheless, it is important to note that the distanceprofile representation and the induced similarity measure are quite robust and work well even with raw association scores, noisy or corrupted data, and weak signaltonoise ratio [25]. All our data, including the FUGUE results, the PSIBLAST results and the feature vectors are available at [50].
Appendix
The sequencestructure association measure
Historically, sequencestructure threading [4] was proposed as an alternative approach to predict the structural fold of polypeptide chains. In contrast to ab initio strategies that exploit secondary structure prediction, energy minimization and molecular dynamics to predict the structure of a protein sequence, sequencestructure threading consists of finding nativelike folding structure(s) for a query protein from a database of known structures. Its motivation originates from the observation that proteins adopt a limited number of spatial architectures and that larger proteins are frequently composed of modules that can be found in other proteins.
To perform sequencestructure threading of a query sequence, the process typically starts by obtaining a set of structural conformations from a database of known structures. The amino acid sequence of the query protein is aligned to each conformation in search of an alignment that would produce the minimal total energy (that depends on the structural environment of each reside, or the types of neighboring residues as determined by the sequencestructure alignment). The most likely candidate conformations are the ones yielding the lowest energy. If the energy values are significantly low compared for example to those obtained for shuffled sequences, then these structural conformations can be considered as compatible with the query sequence.
Many different approaches and implementations of threading algorithms have been proposed in the past [30, 51–54]. The exact details of the alignment algorithm and the computation of the total energy vary from one method to another. Unfortunately, most of them are not publicly available to allow an extensive comparison of sequences and structures. Of the few that are available, we chose FUGUE for our study. FUGUE [30] is a sequencestructure alignment algorithm that uses environmentspecific substitution tables and structuredependent gap penalties to evaluate the alignment score. It switches between local and global alignment based on the ratio between the length of the query sequence and that of the structural profile. Previous experimental results have shown that FUGUE outperforms other methods in fold recognition such as PSIBLAST [5], SAMPSIBLAST [32], HMMERPSIBLAST [33], THREADER [51] and GenTHREADER [53]. It is worth mentioning that FUGUE should be considered as a structurebased sequence alignment algorithm rather than a sequencestructure alignment algorithm per se, since it does not involve the definition and the minimization of any energy function to measure the goodness of fit of the query sequence to the template structure. However, its use of substitution tables and structuredependent parameters provides additional information which is unavailable to pure sequencebased methods. In FUGUE, the compatibility of each sequencestructure pair is assessed through the zscore, which measures the departure of the observed threading score value from its mean, normalized by the standard deviation (where the mean and standard deviation are computed based on the distribution of alignment scores over shuffled sequences. Zscores of meaningful matches are then shifted such that the minimal zscore starts at 0. It is claimed that a zscore less than 2 typically implies an uncertain match between the template structure and the query amino acid sequence, and a zscore larger than six implies an almost certain match between the protein and the template folding structure [30].
It should be noted that threading measures are asymmetric. Given two proteins, A and B with known structures, then S(B, A) does not necessarily equal to S(A, B). Actually, for most protein pairs the equality S(B, A) = S(A, B) does not hold, as different protein structures have different "sequence capacities". These capacities affect the ability of an arbitrary sequence to conform with the given structure, and therefore also the probability that the structure will be energetically favorable for the given sequence. However, the asymmetry may be a fundamental feature of the protein space that we may want to preserve and study later on in our analysis.
The statistical significance of the PD measure
We computed the distribution of pvaluedistances (PD) between pairs of feature vectors P^{pvalue}of unrelated protein sequences. The distribution is a complex one, and features multiple modes (Figure 6a). Each mode corresponds to the occurrence of one additional term in the summation contributing to the final value of the PD measure as described in Eq (4), i.e. the two feature vectors share one additional entry where the pvalues are both significant. One may characterize the PD measure as the sum of a random number of EVD random variables. Unfortunately, analysis of such a distribution is generally intractable and therefore we can only estimate the significance level of our PD measure based on the empirical distribution.
In Figure 6b, we plot the distribution of the PD measure over its full range (up to 900) in log scale. We observe that the frequency of occurrence of large PD values (typically above 100) decreases exponentially, i.e. linearly in log scale (the increasingly dispersed pattern at large PD value > 600 is mainly due to data sparsity). This phenomenon can be explained by examining again the definition of the PD measure given in (4). If we consider a zscore as a random variable, its associated pvalue is a random variable uniformly distributed between 0 and 1. Based on the assumption that ${p}_{i}^{1}$ and ${p}_{i}^{2}$ are independent (which is true if the two feature vectors are randomly drawn from our database), max(${p}_{i}^{1}$, ${p}_{i}^{2}$) follows a triangular distribution and log max(${p}_{i}^{1}$, ${p}_{i}^{2}$) is an exponential random variable. Therefore, log PD can be viewed as a sum of exponential random variables. From the statistical literature, we know that the sum of k independent and identically distributed exponential random variables with parameter α can be modeled by the Gamma function.
For large x, we have
where ε is an additive constant. Hence, log f_{ G }(x; k, α) approximately decreases with x in a linear fashion. In our case, clearly the summands in (4) are not independent of each other since the reference set is composed of groups of related sequences. Nonetheless, one may expect that the dependency is not too strong because these sequences share less than 40% sequence identity. The plot indeed suggests that the distribution of the PD measure follows this trend.
Examples of homology detection
Table 9 reports the results for four specific queries. For simplicity, proteins are designated by their SCOP family name followed by a number indicating their relative position in the original SCOP file. For instance, the first protein in the SCOP file belonging to the family a.1.1.1 is denoted by a.1.1.1.1, and so on. The queries were picked so as to demonstrate that the best performance for a given combination of a query protein and a performance index can be obtained with any of the methods we tested. However, on average the distanceprofile method is significantly more sensitive and cases like c.37.1.3.6 are rare.
Tables 10 and 11 list the closest neighbors of the protein queries d 2tgf__ (Transforming growth factor alpha (designated g.3.11.1.8) and d 1hdoa_ (Biliverdin IX beta reductase) (designated c.2.1.2.26) with each one of the five competing methods. As these demonstrate, a significantly larger number of proteins that are biologically related to the query sequence are placed at the top of the neighbor list with the distanceprofile method. For example, the protein domain g.3.11.1.8 belongs to the superfamily g.3.11 which contains 26 entries in the SCOPDB database. Both PSIBLAST and BLAST detect 4 true positives (TP) before encountering the first false positive (FP) d.158.1.1.1 (SCOP domain d 1a6q__), whereas DPPSIBLAST extends the ROC1S index to 6. FUGUE starts with 7 TP at the top of the sorted list and our DPFUGUE method further improves the index to 10 TP. The differences for the protein domain c.2.1.2.26 are even more substantial, with BLAST, PSIBLAST and DPPSIBLAST reporting only two TP before the first FP, FUGUE reporting 5 TP, while DPFUGUE reporting 28 TP, thus significantly enhancing the clustering of the members of the superfamily c.2.1. We observe that the performance of the DP method depends on the configuration of the sorted list obtained using the initial association measure. Our method works best when some true positives can be found among the top ones on the list, even if proceeded by or mixed with false positives; it refines the results by clustering even closer the similar elements while pushing further away the false positives. Our method does not improve the results in the case of c.37.1.13.6. However, we note that this is a difficult case of homology detection since there are more than 86 members in the superfamily c.37.1 while all methods detect only a very few true positives at the top of the sorted list. There are several cases where FUGUE lists a FP at the top of the list but a couple of TPs are among the closest ones. In these cases, DP can enhance the mapping and improve over FUGUE, as is also demonstarted in Figure 5. However, when there is only one TP at the top of the list, our method does not always improve over FUGUE. This is most difficult when the top true positive match is only marginally higher than the first false positive.
References
 1.
Biozon Database Release 2.0[http://biozon.org/]
 2.
Pearson WR: Identifying distantly related protein sequences. Comp Appl Biosci 1997, 13: 325–332.
 3.
Brenner SE, Chothia C, Hubbard TJP: Assessing sequence comparison methods with reliable structurally identified distant evolutionary relationships. Proc Natl Acad Sci USA 1998, 95: 6073–6078. 10.1073/pnas.95.11.6073
 4.
Sippl MJ: Calculation of conformational ensembles from potentials of mean force. An approach to the knowledgebased prediction of local structures in globular proteins. J Mol Biol 1990, 213: 859–883.
 5.
Altschul SF, Madden TL, Schäffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ: Gapped BLAST and PSIBLAST: a new generation of protein database search programs. Nucleic Acids Res 1997, 25: 3389–3402. 10.1093/nar/25.17.3389
 6.
Karplus K, Barrett C, Cline M, Diekhans M, Grate L, Hughey R: Predicting protein structure using only sequence information. Proteins 1999, 121–125. Publisher Full Text 10.1002/(SICI)10970134(1999)37:3+<121::AIDPROT16>3.0.CO;2Q
 7.
Yona G, Levitt M: Within the twilight zone: a sensitive profileprofile comparison tool based on information theory. J Mol Biol 2002, 315: 1257–1275. 10.1006/jmbi.2001.5293
 8.
Sadreyev R, Grishin N: COMPASS: a tool for comparison of multiple protein alignments with assessment of statistical significance. J Mol Biol 2003, 326: 317–336. 10.1016/S00222836(02)013712
 9.
van Heel M: A new family of powerful multivariate statistical sequence analysis techniques. J Mol Biol 1991, 220: 877–887. 10.1016/00222836(91)90360I
 10.
Ferran EA, Pflugfelder B, Ferrara P: SelfOrganized Neural Maps of Human Protein Sequences. Protein Sci 1994, 3: 507–521.
 11.
Hobohm U, Sander C: A sequence property approach to searching protein database. J Mol Biol 1995, 251: 390–399. 10.1006/jmbi.1995.0442
 12.
Wu C, Whitson G, Mclarty J, Ermongkonchai A, Chang T: Protein classification artificial neural system. Protein Sci 1992, 1: 667–677.
 13.
Jaakkola T, Diekhans M, Haussler D: Using the Fisher kernel method to detect remote protein homologies. Proc Int Conf Intell Syst Mol Biol 1999, 1149–1158.
 14.
Tsuda K, Kin T, Asai K: Marginalized kernels for biological sequences. Bioinformatics 2002, 18: S268–275.
 15.
Leslie C, Eskin E, Noble WS: The spectrum kernel: a string kernel for SVM protein classification. Pac Symp Biocomput 2002, 564–575.
 16.
Leslie CS, Eskin E, Cohen A, Weston J, Noble WS: Mismatch string kernels for discriminative protein classification. Bioinformatics 2002, 20: 467–476. 10.1093/bioinformatics/btg431
 17.
Eskin E, Snir S: The homology kernel: a biologically motivated sequence embedding into Euclidean space. In Technical report. University of California, San Diego; 2004.
 18.
Seeger M: Covariance kernels from Bayesian generative models. Neural Inf Proc Syst 2002, 14: 905–912.
 19.
Cuturi M, Vert JP: A mutual informatio kernel for sequences. Proceedings of the International Joint Conference on Neural Networks 2004, 3: 1905–1910.
 20.
Ron D, Singer Y, Tishby N: The power of amnesia: learning probabilistic automata with variable memory length. Machine Learning 1996, 25: 117–150. 10.1023/A:1026490906255
 21.
Liao L, Noble WS: Combining pairwise sequence similarity and support vector machines for detecting remote protein evolutionary and structural relationship. J Comp Biol 2003, 10: 857–868. 10.1089/106652703322756113
 22.
Pereira F, Tishby N, Lee L: Distributional Clustering of English Words. Proceedings of the 31st Annual Meeting of the Association for Computational Linguistics, 22–26 June 1993 183–190.
 23.
Joachims T, Cristianini N, ShaweTaylor J: Composite Kernels for Hypertext Categorisation. Proceedings of the International Conference on Machine Learning, Williams College, June 28–July 1, 2001 250–257.
 24.
Karplus K, Karchin R, Barrett C, Tu S, Cline M, Diekhans M, Grate L, Casper J, Hughey R: What is the value added by human intervention in protein structure prediction? Proteins 2001, 86–91. 10.1002/prot.10021
 25.
Dubnov S, ElYaniv R, Gdalyahu Y, Schneidman E, Tishby N, Yona G: A new nonparametric pairwise clustering algorithm based on iterative estimation of distance profiles. Machine Learning 2002, 47: 35–61. 10.1023/A:1013631728342
 26.
Yona G, Levitt M: Towards a complete map of the protein space based on a unified sequence and structure analysis of all known proteins. Proc Int Conf Intell Syst Mol Biol 2000, 395–406.
 27.
Murzin AG, Brenner SE, Hubbard T, Chothia C: SCOP: a structural classification of proteins database for the investigation of sequences and structures. J Mol Biol 1995, 247: 536–540. 10.1006/jmbi.1995.0159
 28.
Chandonia JM, Hon G, Walker NS, Lo Conte L, Koehl P, Levitt M, Brenner SE: The ASTRAL compendium in 2004. Nucleic Acids Res 2004, 32: D189D192. 10.1093/nar/gkh034
 29.
Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, Shindyalov IN, Bourne PE: The Protein Data Bank. Nucleic Acids Res 2000, 28: 235–242. 10.1093/nar/28.1.235
 30.
Shi J, Blundell TL, Mizuguchi K: FUGUE: sequencestructure homology recognition using environmentspecific substitution tables and structuredependent gap penalties. J Mol Biol 2001, 310: 243–257. 10.1006/jmbi.2001.4762
 31.
Pearson WR: Empirical statistical estimates for sequence similarity searches. J Mol Biol 1998, 276: 71–84. 10.1006/jmbi.1997.1525
 32.
Karplus K, Barrett C, Hughey R: Hidden Markov models for detecting remote protein homologies. Bioinformatics 1998, 14: 846–856. 10.1093/bioinformatics/14.10.846
 33.
Eddy SR: Profile hidden Markov models. Bioinformatics 1998, 14: 755–763. 10.1093/bioinformatics/14.9.755
 34.
Lin J: Divergence measures based on the Shannon entropy. IEEE Trans on Information Theory 1991, 37: 145–151. 10.1109/18.61115
 35.
Kullback S: Information Theory and Statistics. John Wiley and Sons, New York; 1959.
 36.
Chung R, Yona G: Protein family comparison using statistical models and predicted structural information. BMC Bioinformatics 2004, 5: 183–200. 10.1186/147121055183
 37.
Edgar RC, Sjolander K: A comparison of scoring functions for protein sequence profile alignment. Bioinformatics 2004, 20: 1301–1308. 10.1093/bioinformatics/bth090
 38.
Nagarajan N, Yona G: Automatic prediction of protein domains from sequence information using a hybrid learning system. Bioinformatics 2004, 20: 1335–1360. 10.1093/bioinformatics/bth086
 39.
Gribskov M, Mclachlen AD, Eisenberg D: Profile analysis: detection of distantly related proteins. Proc Natl Acad Sci USA 1987, 84: 4355–4358.
 40.
Lindahl E, Elofsson A: Identification of related proteins on family, superfamily and fold level. J Mol Biol 2000, 295: 613–625. 10.1006/jmbi.1999.3377
 41.
Egan JP: Signal Detection Theory and ROC Analysis. Academic Press, New York; 1975.
 42.
Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ: Basic local alignment search tool. J Mol Biol 1990, 215: 403–410. 10.1006/jmbi.1990.9999
 43.
Yona G, Kedem K: The URMSRMS hybrid algorithm for fast and sensitive local protein structure alignment. J Comp Biol 2005, 12: 12–32. 10.1089/cmb.2005.12.12
 44.
Altschul SF, Gish W: Local alignment statistics. Methods Enzymol 1996, 266: 460–480.
 45.
Park J, Karplus K, Barrett C, Hughey R, Haussler D, Hubbard T, Chothia C: Sequence comparisons using multiple seuqences detect three times as many remote homologues as pairwise methods. J Mol Biol 1998, 284: 1201–1210. 10.1006/jmbi.1998.2221
 46.
Flannick J, Batzoglou S: Using multiple alignments to improve seeded local alignment algorithms. Nucleic Acids Res 2005, 33: 4563–4577. 10.1093/nar/gki767
 47.
Thompson JD, Higgins DG, Gibson TJ: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, positionspecific gap penalties and weight matrix choice. Nucleic Acids Res 1994, 22: 4673–4680.
 48.
Valentini G, Masulli F: Ensembles of learning machines. In Neural Nets WIRN Vietri2002, Series Lecture Notes in Computer Sciences. Edited by: Marinaro M, Tagliaferri R. SpringerVerlag, Heidelberg, Germany;
 49.
Sauder JM, Arthur JW, Dunbrack RL Jr: Largescale comparison of protein sequence alignment algorithms with structure alignments. Proteins 2000, 40: 6–22. 10.1002/(SICI)10970134(20000701)40:1<6::AIDPROT30>3.0.CO;27
 50.
Data used for the distanceprofile representation[http://biozon.org/ftp/data/papers/distanceprofile/]
 51.
Jones DT, Taylor WR, Thorton JM: A new approach to protein fold recognition. Nature 1992, 358: 86–89. 10.1038/358086a0
 52.
Huber T, Torda AE: Protein sequence threading, the alignment problem, and a twostep strategy. J Comput Chem 1999, 20: 1455–1467. Publisher Full Text 10.1002/(SICI)1096987X(19991115)20:14<1455::AIDJCC1>3.0.CO;2D
 53.
Jones DT: GenTHREADER: an efficient and reliable protein fold recognition method for genomic sequences. J Mol Biol 1999, 287: 797–815. 10.1006/jmbi.1999.2583
 54.
Russell AJ, Torda AE: Protein sequence threading: averaging over structures. Proteins 2002, 47: 496–505. 10.1002/prot.10088
Acknowledgements
We thank Dr. Kenji Mizuguchi for providing us with the FUGUE program for our study, and the Astral team for making their data available. We also thank the anonymous reviewers for their very helpful comments and suggestions. The work is supported by the National Science Foundation under Grant No. 0133311 to Golan Yona.
Author information
Affiliations
Corresponding author
Additional information
Authors' contributions
CK implemented the model, ran experiments, compared to other models, analyzed the result sets and wrote parts of the manuscript. GY conceived of the study, designed the model and the experiments, analyzed results and drafted the manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is published under license to BioMed Central Ltd. This is an Open Access article is distributed under the terms of the Creative Commons Attribution License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Ku, CJ., Yona, G. The distanceprofile representation and its application to detection of distantly related protein families. BMC Bioinformatics 6, 282 (2005). https://doi.org/10.1186/147121056282
Received:
Accepted:
Published:
Keywords
 Feature Vector
 Query Protein
 Association Measure
 Homology Detection
 Remote Homology