Software  Open  Published:
Revealing divergent evolution, identifying circular permutations and detecting activesites by protein structure comparison
BMC Structural Biologyvolume 6, Article number: 18 (2006)
Abstract
Background
Protein structure comparison is one of the most important problems in computational biology and plays a key role in protein structure prediction, fold family classification, motif finding, phylogenetic tree reconstruction and protein docking.
Results
We propose a novel method to compare the protein structures in an accurate and efficient manner. Such a method can be used to not only reveal divergent evolution, but also identify circular permutations and further detect activesites. Specifically, we define the structure alignment as a multiobjective optimization problem, i.e., maximizing the number of aligned atoms and minimizing their root mean square distance. By controlling a single distancerelated parameter, theoretically we can obtain a variety of optimal alignments corresponding to different optimal matching patterns, i.e., from a large matching portion to a small matching portion. The number of variables in our algorithm increases with the number of atoms of protein pairs in almost a linear manner. In addition to solid theoretical background, numerical experiments demonstrated significant improvement of our approach over the existing methods in terms of quality and efficiency. In particular, we show that divergent evolution, circular permutations and activesites (or structural motifs) can be identified by our method. The software SAMO is available upon request from the authors, or from http://zhangroup.aporc.org/bioinfo/samo/ and http://intelligent.eic.osakasandai.ac.jp/chenen/samo.htm.
Conclusion
A novel formulation is proposed to accurately align protein structures in the framework of multiobjective optimization, based on a sequence orderindependent strategy. A fast and accurate algorithm based on the bipartite matching algorithm is developed by exploiting the special features. Convergence of computation is shown in experiments and is also theoretically proven.
Background
Proteins are macromolecules that regulate all biological processes in a living organism, and their structures are generally better conserved than sequences. Thus, identifying similarity of structures by comparing proteins could yield valuable clues to their function, and can be employed to fold family classification, motif finding, phylogenetic tree reconstruction and even protein docking. So far, many algorithms have been developed for the structure alignment problem [1–3] including distancebased methods and vectorbased methods, such as iterative dynamical programming [4, 5], fuzzy matching method [6], mean field equation approximation [7, 8], distance matrix alignment method Dali [9], combinatorial extension method CE [10] and genetic algorithm [11]. Despite the relative success, there is much room for improvement in terms of quality and computational efficiency of the alignment [3, 12]. On the other hand, from the viewpoint of optimization, there are two criteria for distancebased algorithms of structure comparison, i.e., maximizing the number of the aligned atoms and minimizing the matching distance between two protein's aligned atoms. Such two objectives clearly have a tradeoff relationship [7], i.e., minimizing the matching distance usually leads to decrease of the number of aligned atoms whereas maximizing the number of aligned atoms will lead large matching distance. In other words, the solutions of such an alignment problem form a Pareto set [13].
With this clue, this paper presents a novel method in the framework of multiobjective optimization [13], which is called SAMO (protein Structure Alignment tool based on Multiple Objective optimization). We define the structure alignment as a twoobjective optimization problem with both discrete and continuous variables, i.e., maximizing the number of aligned atoms and minimizing their root mean square distance (RMSD) in the same time. The discrete variables represent matching relation between atoms whereas the continuous variables include a translation vector and a rotation matrix with which one protein matches the other as a rigid body. In particular, in contrast to the conventional methods, we adopt a sequence orderindependent strategy in the formulation of structure alignment problem. This allows us to detect similarity between proteins in a more general way, e.g. revealing divergent evolution, detecting circular permutations and identifying activesites (or structural motifs). In other words, the similarity can be found not only between homologous structures but also between active sites of convergent structures, between different folding motifs, between the scaffolds of unrelated proteins and between recurring stable configurations in the interior of proteins. As shown in this paper, we succeeded in finding the similarity of divergently evolved proteins as well as that of convergent proteins [14].
Although a pairwise protein comparison can theoretically be formulated as a multiobjective optimization problem, numerically it is still a complicated computational problem, in particular for the comparison of largesize proteins. To alleviate such computation burden, we develop a decomposition technique to divide the original problem into two subproblems by exploiting the special features of the protein alignment problem, i.e., one linear programming subproblem (LPS) for the atom matching and one weighted least square subproblem (LSS) for coordinate transformation. A very efficient bipartite matching algorithm is proposed for optimizing the LPS, whereas the LSS is solved by the singular value decomposition (SVD) technique. By controlling a single distancerelated parameter, theoretically we can obtain a variety of optimal alignments corresponding to different optimal matching patterns, which all belong to the Pareto set. In other words, depending on how close we require to match a pair of proteins, we can obtain a set of optimal alignment solution, from a large portion matching to a small portion matching. The main features for this paper are summarized as follows.

We propose a novel formulation to align protein structures, reveal divergent evolution, detect circular permutations and identify structural motifs in the framework of multiobjective optimization.

We develop an efficient and accurate algorithm based on bipartite matching algorithm to solve the multiobjective programming, and the convergence of the algorithm is also theoretically guaranteed.
Although our algorithm can obtain an optimal alignment, the resulting solution may not be globally optimal due to the nonconvexity of the protein structure alignment problem. Generally, it is well known that the annealing technique is effective to alleviate the influence of initial conditions on the solution. This paper adopts an annealing procedure for expanding the searching region to improve quality of solution. Other features of the model include: according to information of the matching matrix, the algorithm has the ability to identify circular permutations [7, 8] and active sites; no heuristic parameter, such as gap penalty, is required in our formulation. To demonstrate the proposed method, we use several benchmark examples [7, 10, 6] from Protein Data Bank as well as SCOP database for numerical simulation. In addition to solid theoretical background, numerical experiments show significant improvement of our approach over the existing methods in terms of both quality and efficiency.
Implementation
The method presented in this paper is mainly based on the preliminary version in [15]. In this section, we formulate the pairwise structure alignment problem as a multiobjective optimization problem with the similar notation to that of [8, 15].
Preliminaries
Define n_{ x }and n_{ y }to be the number of atoms of two proteins X = (X_{1}, ..., ${X}_{{n}_{x}}$) and Y = (Y_{1}, ..., ${Y}_{{n}_{y}}$), where X_{ i }= (x_{i,1}, x_{i,2}, x_{i,3}) and Y_{ j }= (y_{j,1}, y_{j,2}, y_{j,3}) ∈ R^{3} (i = 1, ..., n_{ x }; j = 1, ..., n_{ y }) are the atom coordinates, which correspond to C_{ α }or C_{ β }atoms along the backbones. A square distance metric between the chain atoms is adopted, i.e. ${d}_{ij}^{2}={\left{X}_{i}{Y}_{j}\right}^{2}={\displaystyle {\sum}_{k=1}^{3}{\left({x}_{i,k}{y}_{j,k}\right)}^{2}}$ is the square distance between the atom i in X and the atom j in Y. We view each protein chain as a rigid geometric body in this paper. The coordinate transformation of a rigid body is generally expressed by a translation vector A ∈ R^{3} and a rotation matrix R ∈ R^{3 × 3}, i.e., ${\widehat{X}}_{i}$ = A + RX_{ i }for the atom i of the chain X, where there are six independent variables for the translation vector and the rotation matrix due to the rigid body transformation. For a pairwise structure alignment, we fix the coordinates of Y, which is assumed to be longer than X. Therefore, after coordinate transformation, a square distance between the atom i in X and the atom j in Y is defined as follows
= A + RX_{ i } Y_{ j }^{2} (1)
A matching matrix S with binary elements s_{ ij }is defined to describe matching of two atoms for i = 1, ..., n_{ x }; j = 1, ..., n_{ y }:
${s}_{ij}=\{\begin{array}{ll}1\hfill & \text{ifatom}i\text{inthechain}X\text{matchesatom}j\text{inthechain}Y\hfill \\ 0\hfill & \text{otherwise}\hfill \end{array}\left(2\right)$
Clearly S is an n_{ x }× n_{ y }matrix with only binary elements. With allowing existence of gaps, each atom in one chain must match at most one atom in the other. Therefore, we have the following conditions.
$\sum _{i=1}^{{n}_{x}}{s}_{ij}}\le 1\text{for}j=1,\mathrm{...},{n}_{y}\left(3\right)$
$\sum _{j=1}^{{n}_{y}}{s}_{ij}}\le 1\text{for}i=1,\mathrm{...},{n}_{x}\left(4\right)$
We show a simple example in Figure 1 to illustrate a matching matrix S with n_{ x }= 5 and n_{ y }= 7, where a row or a column with all zeros means a gap. Then, the total square distances T and the total number m for the aligned atoms between the two proteins are respectively expressed as:
$T(S,A,R)={\displaystyle \sum _{i=1}^{{n}_{x}}{\displaystyle \sum _{j=1}^{{n}_{y}}{s}_{ij}}}{\leftA+R{X}_{i}{Y}_{j}\right}^{2}\left(5\right)$
$m(S)={\displaystyle \sum _{i=1}^{{n}_{x}}{\displaystyle \sum _{j=1}^{{n}_{y}}{s}_{ij}}}\left(6\right)$
Multiobjective optimization for structure comparison
For structure alignment problem, there is generally a tradeoff relation [7, 8] between the distance and the number of aligned atoms. Therefore, a pairwise structure alignment problem can be formulated as a twoobjective optimization problem [13] with discrete variables S and continuous variables (A, R):
minimize T(S, A, R) for S, A, R (7)
maximize m(S)
subject to (3)–(4) s_{ ij }∈ {0,1}
where the first objective is to minimize the total square distances of the aligned atoms, and the second objective is to maximize the total number of aligned atoms for the two proteins. Notice that there is no heuristic gap penalty term in the formulation.
All of the optimal solutions for the twoobjective optimization problem form a Pareto set [13]. The problem can be solved by transforming the two objectives of (7) into a single objective. One typical technique is the εmethod [13], which alternates a positive scalar parameter λ to obtain the Pareto set, with the following formulation.
$\begin{array}{ll}\text{minimize}{\displaystyle \sum _{i=1}^{{n}_{x}}{\displaystyle \sum _{j=1}^{{n}_{y}}{s}_{ij}}}\left({\leftA+R{X}_{i}{Y}_{j}\right}^{2}{\lambda}^{2}\right)\hfill & \text{for}S,A,R\hfill \\ \text{subjectto}\left(3\right)\left(4\right)\hfill & {s}_{ij}\in \left\{0,1\right\}\hfill \end{array}\left(8\right)$
From the definition of T(S, A, R) and m(S), the objective is minimizing T(S, A, R)  λ^{2}m(S). We can theoretically obtain all optimal solutions belonging to the Pareto set, by changing the parameter λ in the singleobjective optimization problem (8). Clearly, λ transforms the number m into equivalent square distance, and controls the balance of T and m [15]. It should be noted that A + RX_{ i } Y_{ j }^{2}  λ^{2} = ${d}_{ij}^{2}$  λ^{2} implies that λ has the same physical meaning and scale as the distance of d_{ ij }. This paper exploits this property to drastically simplify the computation of the problem. If λ is small, the optimal alignment has a smaller set of aligned atoms (m) but with a tight matching (T). In contrast, for a big λ, we can have a bigger set of aligned atoms but with a rough matching. Therefore, rather than one solution, we can obtain a set of optimal solutions for different pairs of (T, m) by changing λ. In addition to the accurate form without any heuristic parameters of gaps in the model, the objective function is a linear form of S, and in formulation (8) the number m directly pairs with the square distance T. Comparing SAMO with the conventional superimpositionalignment approach, such as iterative dynamic programming [4], there are mainly two differences. One is that many of the conventional superimpositionalignment approaches use the heuristic objective function (e.g. using heuristic parameters in the similarity criterion) or the heuristic gap penalty terms in the formulation, which cause not only the poor quality of alignment but also the poor convergence. Another one is about the searching space, which usually is locally restricted depending on the coordinate transformation or superimposition strategy for the conventional methods, whereas our algorithm theoretically has the ability for implicit complete exploration of the entire space of alignments.
Decomposing structure comparison problem
We exploit the special features of the formulation to decompose the optimization problem of the protein structure comparison. Clearly, (8) is a mixed integer programming for a given λ and has a special structure, i.e., all of the terms in the constraints (3)–(4) are not related to the continuous variables (A, R). Because of such a special feature, (8) can be decomposed into two subproblems, i.e., a weighted least square subproblem (LSS) that is to find the best transformation of coordinates for the protein X, and an integer linear programming subproblem (LPS) that is to find the best superposition for the protein pairs. The procedure of SAMO is an iterative computation of LSS and LPS in succession. Next, we give detail explanation for each subproblem and the solving technique.
Weighted Least Square Subproblem (LSS)

(9)
is the LSS for solving (A, R) with fixed (S, λ)
$\text{minimize}{\displaystyle \sum _{i=1}^{{n}_{x}}{\displaystyle \sum _{j=1}^{{n}_{y}}{s}_{ij}}}{\leftA+R{X}_{i}{Y}_{j}\right}^{2}\left(9\right)$
which is a weighted least square problem of two 3D chains and can actually be solved analytically [7, 6, 16]. Notice that for the LSS, in addition to (3)–(4), ${\lambda}^{2}{\displaystyle {\sum}_{i=1}^{{n}_{x}}{\displaystyle {\sum}_{j=1}^{{n}_{y}}{s}_{ij}}}$ is constant due to the fixed (S, λ), which has no effect on the optimization and is eliminated from the objective function in (8). Numerically, R and A can also be obtained by singular value decomposition (SVD) as shown in Appendix A.1 of [7]. There are six independent variables for LSS. LSS pulls the protein X closer to the protein Y by computing the optimal rotation matrix R and translation vector A. Note that LSS is not affected by those coordinate pairs (X_{ i }, Y_{ j }) with s_{ ij }= 0, which are actually known before the computation of each iteration. Such a property is exploited in next section to drastically improve the efficiency of LPS computation.
Integer Linear Programming Subproblem (LPS)

(10)
is the LPS for solving S with fixed (A, R, λ)
$\begin{array}{c}\text{maximize}{\displaystyle \sum _{i=1}^{{n}_{x}}{\displaystyle \sum _{j=1}^{{n}_{y}}{s}_{ij}}}\left({\leftA+R{X}_{i}{Y}_{j}\right}^{2}{\lambda}^{2}\right)\\ \begin{array}{cc}\text{subjectto}\left(3\right)\left(4\right)& {s}_{ij}\in \left\{0,1\right\}\end{array}\end{array}\left(10\right)$
which is an integer linear programming problem because of the binary variables S. But it can be exactly solved in polynomial time. As a matter of fact, (10) is a maximum weighted bipartite matching problem [17] which has the integrality property, i.e. the optimal solution is ensured to be integers even without the constraint s_{ ij }∈ {0,1}. Hence, the discrete optimal solution of LPS can be obtained by directly using any linear programming algorithm such as simplex algorithm or interiorpoint method by relaxing the binary variables as continuous variables 0 ≤ s_{ ij }≤ 1. However, there exists a more effective algorithm based on Hungarian method [17] to solve the maximum weighted bipartite matching problem. It is easy to show that the computational complexity of LPS with such a method is O($\overline{n}$($\widehat{n}$ + $\overline{n}$log$\overline{n}$)) where $\overline{n}$ = n_{ x }+ n_{ y }and $\widehat{n}$ = n_{ x }× n_{ y }.
Hungarian method is an efficient algorithm, but for largescale problems, such as proteins with several hundreds amino acids, O($\overline{n}$($\widehat{n}$ + $\overline{n}$log$\overline{n}$)) is still too high for fast structure alignment. The algorithm for LPS can be further improved by exploiting its special feature. Notice that the objective function of (10) is to $\text{maximize}{\displaystyle {\sum}_{i=1}^{{n}_{x}}{\displaystyle {\sum}_{j=1}^{{n}_{y}}{s}_{ij}}}\left({d}_{ij}^{2}{\lambda}^{2}\right)$ for the fixed (d_{ ij }, λ). Therefore for i = 1, ..., n_{ x }and j = 1, ..., n_{ y }, if d_{ ij }≥ λ, then s_{ ij }= 0 must hold at the optimal solution. In other words, λ corresponds to the radius of the search region in the optimization process, and we can eliminate all s_{ ij }corresponding to d_{ ij }≥ λ from both the objective function and the constraints of (10). We can show that such a manipulation significantly simplifies LPS, and reduces total variables $\widehat{n}$ from n_{ x }× n_{ y }to {d_{ ij }: d_{ ij }<λ} = O(λ^{2}min{n_{ x }, n_{ y }}). An procedure for solving LPS based on Hungarian method with the reduced variables can be found in [15], and the algorithm ensures an integer solution without any approximation.
Computational procedure for SAMO
Basically, (8) is optimized by solving LSS and LPS iteratively. In such a spirit, the algorithm of SAMO is summarized straightforward for a given λ.

Step0: Setting initial conditions:

Assuming n_{ x }≤ n_{ y }, fix the coordinates of Y, and move X to their common center of mass by translation ${\sum}_{i=1}^{{n}_{y}}{Y}_{i}/{n}_{y}{\displaystyle {\sum}_{i=1}^{{n}_{x}}{X}_{i}}}/{n}_{x$. Set λ, annealing coefficients γ and $\overline{\lambda}$, and convergence criterion ε, which are all positive numbers. Set all initial values of variables s_{ ij }, and let the iteration index t = 1.

Step1: Solving LSS:

Solve (9) for (A, R) with the fixed S by the SVD algorithm (see [7]).

Step2: Solving LPS:

Solve (10) for S with the given (A, R) in Step1 by the procedure based on Hungarian method. Reduce variables based on λ as explained in Section LPS.

Step3: Checking convergence:

When T^{(t)} T^{(t1)} ≤ ε is satisfied, terminate the computation and output rms and m. Otherwise, let t ← t + 1.

Step4: Annealing process:

Let λ^{(t)}= λ + $\overline{\lambda}$γ^{t}where λ is the target value, $\overline{\lambda}$ ≥ 0 and 1 > γ > 0 (a cooling coefficient for annealing). Then go to Step1 with the updated S.
For Step0, the original centers of mass for proteins X and Y are $\overline{X}={\displaystyle {\sum}_{i=1}^{{n}_{x}}{X}_{i}}/{n}_{x}$ and $\overline{Y}={\displaystyle {\sum}_{i=1}^{{n}_{y}}{Y}_{i}}/{n}_{y}$ respectively. rms or RMSD is defined as $\sqrt{T/m}$, where T and m are expressed in (5)–(6). Step4 of Algorithm is for the annealing. That is, first a large initial λ^{(0)} = λ + $\overline{\lambda}$ is set so that the algorithm performs a global search on a large region to find a better matching in the earlier iterations. Then, reduce λ^{(t)}= λ + $\overline{\lambda}$γ^{t}by γ to narrow the searching region during each iteration until convergence. Although introducing the annealing process requires additional computation cost, it enlarges the searching region which results in the improvement of alignment quality. Such an annealing process is only activated when the quality of the alignment is not satisfied. For the computation without annealing, simply set $\overline{\lambda}$ = 0.
Parameter selection
As discussed in previous sections, s_{ ij }is possibly 1 at the optimal solution only if d_{ ij }<λ. If the distance of any two atoms i and j is bigger than λ, no matching for such two atoms is considered in LPS. In other words, only atom pairs with the distance less than λ are further considered in LSS for the translation and rotation operation because of s_{ ij }= 0 for any atom pairs with d_{ ij }> λ. As a result, the aligned rms in LSS is less than λ. We can use this property to obtain an alignment for a specific rms by setting an appropriate λ but without searching the Pareto set completely. Empirically, we can obtain an optimal solution with rms = r if setting λ = 2r ~ 3r, where rms is expected to be r = 0 ~ 3 because an alignment for rms > 3 is not generally considered as a good matching. In other words, we can give a list of solutions that covers all the reasonable alignments with λ changing from 0 to 9 because the range of rms for those solutions generally in [0, 3]. In the implement of the software SAMO, we set the default value of the parameter λ as 6.0 according to this rule. Actually, in most cases it always gives satisfactory alignment results. Considering that the distance is approximately 3.8Å for two consecutive C_{ α }atoms or C_{ β }atoms in a protein chain, the reduced LPS generally has variables less than min{n_{ x }, n_{ y }}(λ + 3.8)^{2}/3.8^{2}, which is a much smaller Linear Programming (LP) than the original LP with variables n_{ x }× n_{ y }. For example, the number of variables is approximately less than 400 × (6 + 3.8)^{2}/3.8^{2} ≈ 2660 for a pair of proteins both with 400 amino acids and λ = 6, while there are 400 × 400 = 160000 variables in the original LP.
Convergence analysis
The decomposition of the algorithm actually ensures the local convergence. We next prove the convergence of the proposed algorithm. Let A^{k}and R^{k}be the solution of LSS (9) at the kth iteration with an assignment S^{k1}. Then
$\sum _{i=1}^{{n}_{x}}{\displaystyle \sum _{j=1}^{{n}_{y}}{s}_{ij}^{k1}}}\left({\left{A}^{k}+{R}^{k}{X}_{i}{Y}_{j}\right}^{2}{\lambda}^{2}\right)\le {\displaystyle \sum _{i=1}^{{n}_{x}}{\displaystyle \sum _{j=1}^{{n}_{y}}{s}_{ij}^{k1}}}\left({\left{A}^{k1}+{R}^{k1}{X}_{i}{Y}_{j}\right}^{2}{\lambda}^{2}\right)$
Using A^{k}and R^{k}, we solve LPS (10), and let the solution be S^{k}. Then there is
$\sum _{i=1}^{{n}_{x}}{\displaystyle \sum _{j=1}^{{n}_{y}}{s}_{ij}^{k}}}\left({\left{A}^{k}+{R}^{k}{X}_{i}{Y}_{j}\right}^{2}{\lambda}^{2}\right)\le {\displaystyle \sum _{i=1}^{{n}_{x}}{\displaystyle \sum _{j=1}^{{n}_{y}}{s}_{ij}^{k1}}}\left({\left{A}^{k}+{R}^{k}{X}_{i}{Y}_{j}\right}^{2}{\lambda}^{2}\right)$
which shows that the value of the objective function T(S^{k}, A^{k}, R^{k}) always decreases with the iteration of the computation. Noticing that the objective function has a special structure and the solution space of S^{k}is a finite set, decrease of the objective function implies that A^{k}+ R^{k}X_{ i }will be in a bounded neighborhood of the point Y_{ i }. Therefore, there will be a subsequence of the solution sequence that converges to a cluster so that the termination condition will be satisfied to end the computation.
Note that although our algorithm can obtain an optimal alignment for any specified λ, the resulting solution may not be globally optimal because of the nonconvexity of the protein structure alignment problem. In other words, depending on initial condition, the algorithm may result in a different solution, as the same as most of deterministic optimization techniques do. To improve the quality of the solution, we can further adopt annealing technique to enlarge the searching space [15]. Specifically, in our program we set $\overline{\lambda}$ = 10λ, and γ = 0.4 the annealing procedure when the rms is undesirably large. In other words, the radius of initial searching region with the annealing is enlarged by 11 times.
Numerical simulations indicate that alignment of a protein pair typically requires 4–10 iterations, and the convergence is always achieved from the numerical computation viewpoint.
Figure 2 is a typical example of the alignment process for a pair of proteins 1DHFa and 8DFR with translation, rotation and matching of atoms. As shown in (a)–(d) of Figure 2, the protein 1DHF_{ a }rotates and translates by approaching to 8DFR very fast with only four iterations, (d) is the converged result, and $\overline{\lambda}$ = 0 means that there is no annealing process in the computation. Note that the coordinate of 8DFR is fixed due to its longer amino sequence according to the algorithm.
Results
The algorithm was implemented in C++ language. The simulation for each structure alignment of a pair of proteins generally requires a few minutes (most of them are less than 10 seconds) on Pentium 4 CPU, which is considered fast. For example, alignment of proteins 1DHFa and 8DFR which have lengths 182 and 186 respectively can find a long segment with length 182 and RMSD 0.72 in only 6 seconds. The alignment results can be presented in various output styles and saved for further analysis. The detailed residue correspondence is provided and can be saved in PDB file format for the purpose of the visualization. The software SAMO [see Additional file 1,2,3] is available upon request from authors or from [18]. We have conducted the comparison experiments using dozens proteins (benchmark examples) from major protein families and folds, as shown in Table 1. The comparisons are carried out both in same family, fold, and in different family, fold. These results of comparison can be roughly summarized as three categories according to their comparison scores.
The first category is composed of the protein pairs with lower RMSD value and larger number of matched aminoacid pairs, which conserve the sequential orders (even though no sequential order constraints are used). The result of the proposed method indicates global similarity between two whole structures. Because the geometric match corresponds to a sequential order, protein pairs in this category may imply evolutionary divergence. In the section "Revealing Divergent Evolution", we will compare our method (SAMO) with the conventional methods and further clarify the results.
In this paper, we analyze the convergent and divergent evolutions by structure comparisons. Divergent evolution is the process of two or more related species becoming more and more dissimilar from a common ancestor. Similarities in sequence and structure indicate that the two species have a common ancestor. As they adapted to different environments, the structures of the two species diverged. In convergent evolution, on the other hand, unrelated species from different ancestors become more and more similar in appearance or structure (not necessarily in sequence) as they possibly adapt to the same kind of environment. Convergent evolution takes place when species of different ancestry begin to share analogous traits because of a shared environment or other selection pressure. Although it is generally difficult to distinguish such two evolutions, our method in this paper can provide some insight about this problem.
The second category is composed of the protein pairs with higher RMSD value and smaller number of matched aminoacid pairs. The result of the proposed method mainly demonstrates local similarity between substructures. These matches contain fewer matched aminoacid pairs than the first category, and do not necessarily conserve the sequential order. Proteins with such substructural similarity may imply evolutionary convergence. At first sight, it seems that it is a random match of small segments plus isolated residues. However close inspection reveals that many of the matched aminoacid pairs perform some common biological functions. Since our comparison is conducted in a structural level without any sequential order constraint, the match is completely 3D. We define these recurring detected substructures as structure motifs or activesites in this paper. They are "real" 3D motifs, which are different from the conventional concept of motifs defined by the multiple sequence alignment. In the section "Identifying Active Sites", we will report the ability of our method (SAMO) to find similarity of active sites or 3D structural motifs. The third category corresponds to spurious matches between unrelated and dissimilar structures. These may contain equivalences of single αhelix, βstrands, or randomly matched isolated residues. The protein pairs in this category have higher RMSD and smaller number of matched aminoacid pairs, which are not located in a local area. Those pairs can be regarded as the negative samples identified by our method (SAMO), which means that the two proteins are not similar biologically, and can be excluded from the results by checking biologically meaningful similarity of the matched residues.
Circular permutation is a special phenomenon in structure database formed by mutation in the sequential order. It provides challenge for the structure alignment methods with sequential order constraint. We show the advantage of our method (SAMO) in finding circular permutation due to the sequence orderindependent strategy in the section "Detecting Circular Permutations". In addition, other features of our method (SAMO) are also reported in the section "Results", such as stable convergence and high computation efficiency.
Revealing divergent evolution
In this paper, we compare the 3D protein structures in the multiobjective optimization framework without the sequential order constraint. This allows us to detect similarity between protein molecules, and find out whether those amino acids are on the surfaces or in the interior. This truly 3D comparison approach overcomes a limitation inherent in other conventional structure alignment techniques which require that the linear order of the amino acid sequences be conserved. In this section, we will compare SAMO with the conventional methods, such as Dali, CE and Lund.
First we emphasize that one of the basic roles of protein comparison is to provide insight into evolution. i.e. address the question of divergence or convergence of proteins [14]. Originally, interest in automated structural comparison methods arose from the need to superimpose the structures of divergently evolved proteins. In such comparisons, a strict sequential order conservation has been enforced. In this paper, we show that both SAMO and the conventional methods perform well for the comparison of divergently evolved proteins (in the first category).
However, SAMO can deduce additional evidence of divergent evolution when the results of a pure 3D structural comparison reveal that sequential order is conserved. In other words, SAMO "rediscovers" the dual sequencestructure homology in divergent species. We will clarify this point in the following examples. We adopt the same benchmark examples as those of [10, 7, 6] from Protein Data Bank [19] as a basic set for numerical simulation by comparing with the several existing methods, i.e. Dali [9, 20], CE [10, 21], and Lund [6]. There is no post processing in our simulation, and C_{ α }representation is adopted for each protein chain. The convergence criterion is ε = 0.01 for all examples.
The simulation results are shown in Table 1, where Dihydrofolate reductases and Globins are considered easy for alignment while other ten protein pairs are thought to be very difficult to align [10]. For any protein pair, SAMO gives a list of solutions corresponding to different λ from small value to large value, which all belong to the Pareto set. Since a different λ gives an optimal solution with different m and rms for the proposed method, we listed those results with the corresponding λ, which are comparable to others. According to Table 1, all of the aligned results by SAMO are almost consistently better than others. The comparison results in Reductases and Globins family show that both SAMO and the conventional methods can obtain good matches. All of the rms are lower than 2.5 and almost all the residues are matched. The difference lies in that our results are obtained without the sequential order constraint. In particular, for the ten most difficult protein pairs [10], our algorithm performs effectively and typically produces alignments with much lower rms distances or longer chains. Since most of the matched aminoacid pairs by SAMO conserve sequential order, the protein pairs for "Reductases", "Globins" and "Ten difficult structures" of Table 1 belong to the first category, which indicates that those pairs are evolutionarily divergent, and are originally from the same family.
In addition, we also aligned protein pairs for different folds and different classes, and compared the results with other methods. The results indicated that our algorithm can obtain an alignment with a larger matching portion with a better RMSD for those protein pairs. "" in the table means that method does not give a result or the result is not available. Simple analysis indicates that the conventional methods perform well for proteins belonging to the same family or fold, but it is difficult for them to detect similarities of proteins belonging to different folds and classes unless there are sufficiently large fragments of consecutive residues in both proteins. In contrast, our approach overcomes these limitations. In particular, in addition to aligning protein structures for the first category (typically with a lower rms and more aligned pairs), it is able to obtain matches of isolated residues not belonging to contiguous fragments or belonging to nonsecondary structure elements, in particular, structure motifs. To demonstrate that the aligned 3D structure motif by SAMO has biological meaning, we give several examples of detecting similarity for active sites in subsection "Identifying Active Sites", which belong to the second category. Furthermore, in the last part of Table 1, two circular permutation examples are given. The results show that SAMO also outperforms other methods. At the same level of rms, the number of matched aminoacid pairs in SAMO experiments is almost double. More examples for finding circular permutation are discussed in details in subsection "Detecting Circular Permutations".
Detecting circular permutations
A circularly permuted protein arises from protein duplication and subsequent deletion of N and Cterminal regions in the corresponding duplicated units. The motivation of emphasis on comparing such proteins is partly originated in that circularly permuted proteins are common in the protein structure database. As reported in [22], there are 47% of all protein domains are superimposable to at least one other protein domain in the database after their sequences are circularly permuted by a systematic search for all protein pairs in the SCOP domain database. Especially some of them are nonsymmetric proteins, which become structurally superimposable to other protein only after a circular permutation of the sequence. In such a way, their remote homology can be detected. Also discovery of circular permutation at genome wide scale will enable systematic studies of its contribution to the generation of novel protein function and novel protein fold.
Currently there are mainly two classes of the available circularly permuted detecting methods. One is sequence alignmentbased methods [23]. Its drawback lies in that it can miss many circularly permuted proteins, because either one or both fragments may escape detection by local alignment if the two proteins are distantly related. The second class is structure alignmentbased methods. As shown in Table 1, the conventional methods such as, Dali and CE fail to detect circular permutation due to sequential order constraint in computation. One feasible way is to use structure alignment in an orderindependent manner [7, 24], which is promising to uncover many more ancient permutation events. In this subsection, we will focus on detecting circularly permuted proteins by comparing with the method of [24] on a larger set of examples. These results are listed in Table 2. With the parameter A taking the default value 6.0, SAMO outperforms the method in [24] both in naturally occurring and human made examples of permuted proteins. The match between naturally occurring pair 1RIN and 2CNA is illustrated in Figure 3.
Identifying active sites
Recognition of common substructural features (the pure structure motif) that do not generally conserve the aminoacid sequential order entails application of the sequence orderindependent methods. Examples of such features may include similarities between active sites of convergent structures, between different folding motifs, between scaffolds of unrelated proteins, and between recurring stable configurations in the interior of proteins. In contrast to the concept of motifs defined by the multiple sequence alignment, we aim to identify structural motifs or active sites which are "real" 3D motifs. As shown in this section, SAMO succeeded in detecting the similarities of active sites or structural motifs.
The structural similarity between the active sites of proteins only can be recognized by visual inspection. Similar to the results in [14], SAMO succeeded in finding the rough similarity around the active sites of proteins automatically, without any prior knowledge of their existence and the information of side chains. For example in Figure 4, we give the comparison result of proteins βtrypsin (1TPO) and actinidin (2ACT). At first sight, it seems that it is a random match of small segments plus isolated residues (subfigure (a) of Figure 4, active sites are highlighted in different colors). However close inspection reveals that most of the matched pairs are located in the active sites. The subfigures (b) and (c) of Figure 4 show the detailed match of the detected activesites by removing the aligned isolated residues which are not biological meaningful. Clearly the residues composing the active site come from different regions of the protein chain. The similarity is evaluated from pure structural viewpoint and can only be detected in a sequence orderindependent strategy. Our findings are similar to the results in [14] (ref. Fig. 3) but have more matched aminoacid pairs. In addition, for another example (βtrypsin (1TPO) and proteinase K (2PRK)) in [14], we also obtain better results.
The comparison with the orderindependent structure comparison method in [14] was conducted and the results are listed in Table 3. The protein pairs are taken from the Table 1 of [14], where some entries are removed due to the structure data update of PDB database. Another criterion (Score in Table 3) proposed in [14] is introduced to assess the quality of protein structure comparison. The Score is defined as: Score = m/((n_{ x } m) + (n_{ y } m) + m) = m/(n_{ x }+ n_{ y } m), where m is the number of matched aminoacid pairs between two proteins; n_{ x }and n_{ y }are the number of amino acids of the two proteins X and Y respectively. Clearly, the number of matched aminoacid pairs is divided by the sum of the number of unmatched residues in protein X, the number of unmatched residues in protein Y and the number of matched aminoacid pairs. This score is designed to take into account the number of matched aminoacid pairs and to penalize the difference in sizes between two proteins. The comparison results show that SAMO performs better when considering all three criteria together: m (number of matched aminoacid pairs), rms (root mean square distance) and Score.
Discussion
As demonstrated in the paper, SAMO has the following features in addition to structure alignment: 1) detect spatial similarity between evolutionary convergent or divergent structures; 2) identify active sites (structural motifs) and circular permutations; 3) reduce the computational complexity and improve the comparison quality.
For evolutionarily related proteins, the alignment results by SAMO show the strict sequential order. Hence, our method (SAMO) not only can detect this kind of structure similarity, but also can provide stronger evidence in favor of divergent evolution comparing with the conventional structure alignment methods. Also SAMO has the ability to find circular permutations by structure comparison.
By matching isolated residues, one of major benefits for SAMO is that it can find the similar three dimensional motifs (structural motifs) between proteins which belong to different families or different folds, although many of these motifs have not be generally found and their biological functions are not well identified. Another potential application is to use SAMO to detect similarity for pockets or mouths in protein surfaces that are closely related to protein functions [25]. In fact, one reason to develop the method is because the detection of similar protein surface patterns with different underlying primary sequence order can not be addressed by the current structure alignment method. The need to develop such a method is further illustrated in [25]. For example, when convergent evolution occurs, nature discovers the same functional surfaces multiple times, as is the case of the catalytic triad in serine protease. It is likely that there may be many such examples where proteins with similar functional surfaces have different underlying protein core architectures, and in particular, the key residues important for function may have different order in primary sequences. Our method currently can detect such similarity and can be used in assessing similarity of orderindependent surface patterns. The comparison for protein pockets by SAMO and the results assessment are currently in progress.
Although the proposed algorithm can find the structural motifs by comparing protein pairs, the aligned residues may not always represent biologically meaningful substructures or regions. One reason is that the aligned atom pairs may be distributed in a wide area or may not be always restricted in a local area of a protein. To exclude such cases (in the third category), manual inspection is needed to find biologically meaningful match of residues.
As reported in this paper, another major contribution of the new method is its concise in mathematics and cheap in computation. We expect that our method will enable routine comparisons of any picked structure against the large database of 3D structures and provide web service by exploiting current information technology in the similar manner to the comparison of a query DNA sequence with the sequence database. It will further provide a wealth of information and an insight into evolutionary and functional aspects of biological macromolecules. The implication of the availability of such a tool can provide applications ranging from protein folding problem to computeraided drug design because it is the structure that plays a critical role in carrying out the necessary biological functions. The software SAMO is available at the website [18].
Conclusion
In this paper we developed SAMO which is able to align protein structures, reveal divergent evolution, detect circular permutations and identify structural motifs in an accurate and efficient manner. The proposed algorithm is general and treats the structure alignment in a more accurate way with implicit complete exploration of the entire space. The original protein alignment problem is formulated as a multiobjective optimization problem with mixed variables, and further decomposed into LPS and LSS. A very efficient algorithm with a numerically stable convergent process is developed for solving LPS and LSS successively. We show that the size of variables linearly increases with respect to the number of atoms of the protein pairs. By controlling a single distancerelated parameter, theoretically we can obtain a variety of optimal alignments corresponding to different optimal matching patterns, i.e., from a large matching portion to a small matching portion. Numerical results further support that SAMO can not only detect close spatial similarity between evolutionarily divergent structures and circular permutations but also identify remote convergent relationships by the similarity of active sites.
Availability and requirements

Project name: SAMO

Project home page: http://zhangroup.aporc.org/bioinfo/samo/ or http://intelligent.eic.osakasandai.ac.jp/chenen/samo.htm

Operating system(s): Windows, Linux

Programming language: C++

Other requirements: None

License: FreeBSD

Any restrictions to use by nonacademics: licence needed
Abbreviations
 PDB:

protein data bank
 RMSD:

root mean square distance
 3D:

three dimensional
 LP:

linear programming
 SAMO:

protein Structure Alignment tool based on Multiple Objective optimization
 LSS:

weighted Least Square Subproblem
 LPS:

integer Linear Programming Subproblem
References
 1.
Orengo CA, Taylor WR: SSAP: Sequential Structure Alignment Program for Protein Structure Comparison. Methods Enzymol 1996, 266: 617–635.
 2.
Bryant SH, Altschul SF: Statistics of Sequencestructure Threading. Current Opinion in Structure Biology 1995, 5: 236–244. 10.1016/0959440X(95)800824
 3.
Kolodny R, Linial N: Approximate Protein Structural Alignment in Polynomial Time. Proceedings of the National Academy of Sciences 2004, 101(33):12201–12206. 10.1073/pnas.0404383101
 4.
Gerstein M, Levitt M: Using Iterative Dynamic Programming to Obtain Accurate Pairwise and Multiple Alignments of Protein Structures. ISMB'96, AAAI Press; 1996:59–66.
 5.
Akutsu T: Protein Structure Alignment Using Dynamic Programming and Iterative Improvement. IEICE Trans Inf Syst 1996, 12: 1629–1636.
 6.
Blankenbecler R, Ohlsson M, Peterson C, Ringnér M: Matching Protein Structures with Fuzzy Alignments. Proceedings of the National Academy of Sciences 2003, 100(21):11936–11940. 10.1073/pnas.1635048100
 7.
Chen L, Zhou T, Tang Y: Protein Structure Alignment by Deterministic Annealing. Bioinformatics 2005, 21: 51–62. 10.1093/bioinformatics/bth467
 8.
Zhou T, Chen L, Tang Y, Zhang XS: Aligning Multiple Protein Structures by Deterministic Annealing. Journal of Bioinformatics and Computational Biology 2005, 3(4):837–860. 10.1142/S0219720005001351
 9.
Holm L, Sander C: Protein Structure Comparison by Alignment of Distance Matrices. Journal of Molecular Biology 1993, 233: 123–138. 10.1006/jmbi.1993.1489
 10.
Shindyalov IN, Bourne PE: Protein Structure Alignment by Incremental Combinatorial Extension (CE) of the Optimal Path. Protein Engineering 1998, 11: 739–747. 10.1093/protein/11.9.739
 11.
Szustakowski JD, Weng Z: Protein Structure Alignment Using a Genetic Algorithm. Proteins: Structure, Function and Genetics 2000, 38(4):428–440. Publisher Full Text 10.1002/(SICI)10970134(20000301)38:4<428::AIDPROT8>3.0.CO;2N
 12.
Hiroike T, Toh H: A Local Structural Alignment Method that Accommodates with Circular Permutation. ChemBio Informatics Journal 2001, 1(3):103–114. 10.1273/cbij.1.103
 13.
Holzman A: Mathematical Programming for Operations Researchers and Computer Scientists. Marcel Dekker; 1981.
 14.
Fischer D, Wolfson H, Lin S, Nussinov R: Threedimensional, Sequence Orderindependent Structural Comparison of a Serine Protease Against the Crystallographic Database Reveals Active Site Similarities: Potential Implications to Evolution and to Protein Folding. Protein Sci 1994, 3(5):769–778.
 15.
Chen L, Wu LY, Wang R, Wang Y, Zhang S, Zhang XS: Comparison of Protein Structures by MultiObjective Optimization. Genome Informatics 2005, 16(2):114–124.
 16.
Arun K, Huang TS, Blostein S: Leastsquares Fitting of Two 3D Point Sets. IEEE Trans. on Pattern Analysis and Machine Intelligence 1987, PAMI9(5):698–701.
 17.
Schrijver A: Combinatorial Optimization: Polyhedra and Efficiency. Springer; 2003.
 18.
SAMO http://zhangroup.aporc.org/bioinfo/samo or http://intelligent.eic.osakasandai.ac.jp/chenen/samo.htm
 19.
 20.
 21.
 22.
Jung J, Lee B: Circularly Permuted Proteins in the Protein Structure Database. Protein Science 2001, 10(9):1881–1886.
 23.
Uliel S, Fliess A, Amir A, Unger R: A Simple Algorithm for Detecting Circular Permutations in Proteins. Bioinformatics 1999, 15(11):930–936. 10.1093/bioinformatics/15.11.930
 24.
Binkowski TA, DasGupta B, Liang J: Order Independent Structural Alignment of Circularly Permuted Proteins. IEEE EMBS 2004 Conference 2004.
 25.
Binkowski TA, Adamian L, Liang J: Inferring Functional Relationship of Proteins from Local Sequence and Spatial Surface Patterns. Journal of Molecular Biology 2003, 332: 505–526. 10.1016/S00222836(03)008829
Acknowledgements
This work is partly supported by Important Research Direction Project of CAS "Some Important Problems in Bioinformatics", and National Natural Science Foundation of China under Grant No. 10471141 and 60503004. Many thanks to Michael J. Hirsch for helpful comment on the decomposition method in this paper. The authors are grateful to the editor and anonymous referees for comments and helping to improve the earlier version.
Author information
Additional information
Authors' contributions
LC proposed the main idea. LYW and YW designed and implemented the algorithm. SZ and XSZ improved the model and gave valuable suggestions. All authors write and approve the manuscript.
Authors’ original submitted files for images
Rights and permissions
About this article
Received
Accepted
Published
DOI
Keywords
 Structure Alignment
 Protein Pair
 Optimal Alignment
 Divergent Evolution
 Circular Permutation