A central tenet of structural biology is that related proteins of common function share structural similarity. This has key practical consequences for the derivation and analysis of protein structures, and is exploited by the process of “molecular sieving” whereby a common core is progressively distilled from a comparison of two or more protein structures. This paper reports a novel web server for “sieving” of protein structures, based on the multiple structural alignment program MUSTANG.
“Sieved” models are generated from MUSTANG-generated multiple alignment and superpositions by iteratively filtering out noisy residue-residue correspondences, until the resultant correspondences in the models are optimally “superposable” under a threshold of RMSD. This residue-level sieving is also accompanied by iterative elimination of the poorly fitting structures from the input ensemble. Therefore, by varying the thresholds of RMSD and the cardinality of the ensemble, multiple sieved models are generated for a given multiple alignment and superposition from MUSTANG. To aid the identification of structurally conserved regions of functional importance in an ensemble of protein structures, Lesk-Hubbard graphs are generated, plotting the number of residue correspondences in a superposition as a function of its corresponding RMSD. The conserved “core” (or typically active site) shows a linear trend, which becomes exponential as divergent parts of the structure are included into the superposition.
The application addresses two fundamental problems in structural biology: First, the identification of common substructures among structurally related proteins—an important problem in characterization and prediction of function; second, generation of sieved models with demonstrated uses in protein crystallographic structure determination using the technique of Molecular Replacement.
Citation: Konagurthu AS, Reboul CF, Schmidberger JW, Irving JA, Lesk AM, Stuckey PJ, et al. (2010) MUSTANG-MR Structural Sieving Server: Applications in Protein Structural Analysis and Crystallography. PLoS ONE5(4): e10048. https://doi.org/10.1371/journal.pone.0010048
Editor: Narcis Fernandez-Fuentes, Leeds Institute of Molecular Medicine, United Kingdom
Received: December 18, 2009; Accepted: March 16, 2010; Published: April 6, 2010
Copyright: © 2010 Konagurthu et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: Australian Research Council, National Health and Medical Research Council, Victorian Partnership for Advanced Computing, the Victorian Bioinformatics Consortium, Monash eResearch Centre, the State Government of Victoria (Australia), National ICT Australia (NICTA) is funded by: the Australian Government's Department of Communications, Information Technology and the Arts; the Australian Research Council through Backing Australia's Ability and ICT Centre of Excellence program. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
Prediction of protein function
Understanding structural similarity between proteins within a homologous family as well as between distant or even unrelated proteins is a common task in molecular biology. In addition, the prediction of protein function remains a serious challenge, but the observation that the active sites of proteins are often the best preserved regions in a divergent family offers a robust method of classifying proteins of unknown function by structural alignment. This has been exploited by a “sieving” procedure that iteratively identifies matching residues in a multiple structural alignment that fit below a threshold root-mean-square-deviation (RMSD , ). Examination of residues remaining after sieving allows the identification of functional residues in proteins of unknown function.
Sieved models in crystal structure determination
The most common method of protein structure determination is molecular replacement (MR). This technique involves using the structure of a protein that shares significant sequence similarity with the protein of unknown structure as a starting point in the structure determination (otherwise known as solving the phase problem). The process generally involves four steps: (1) Using sequence-based searching methods such as PSI-BLAST  to identify suitable structures that can be used for MR; (2) modification of structures to yield search models; (3) Finding the orientation and position of the search model in the unit cell of the target crystal; (4) Refinement of the model.
Where the sequence similarity between the unknown target and the search model is high (sequence identity >40%) the success rate of MR is very good, even without optimisation of the search model. However, in cases where sequence similarity is low (identity <30%) MR, and subsequent structure refinement becomes non-trivial, and emphasis must be placed on the optimisation of the search model. Here, MR solutions are commonly challenging to refine (the so called “model bias” trap). This situation occurs where errors in regions of the starting model cannot be adequately identified and corrected due to model bias. However it is possible to remove model bias by removing regions of the structure that are predicted to be different in the search model and target, typically loops. However, this process is a subjective one and relies on sequence alignments, which are often incorrect, particularly at low sequence identity. Thus it is often unclear which loops should be removed and how much of the loop should be removed, and each model must be tested.
Sieving presents a robust solution to this method, because it produces search models with structurally divergent regions removed in an objective fashion. The ideal starting model (e.g. one with least model bias) is difficult to obtain a priori, however it is possible to test multiple sieved models and assess the refinement process using statistically robust validation, providing a generally applicable method for model bias reduction.
Standardized structural comparisons
RMSD values are often used as a measure of structural similarity between homologous proteins, however a reported value will deviate considerably as a function of the number of residues considered. Hence, the resulting values may vary with the alignment program used, and/or the choice of parameters active in the calculation. The curves generated by the sieving procedure can be used to report multiple comparisons at a common threshold: the number of residues aligned at a specified RMSD, as a measure of the extent of residue-residue correspondence; or the RMSD at a specified number of aligned residues, representing the average extent of residue-residue deviation squared.
In this work we describe a novel web server for “sieving” of protein structures, based on the multiple structural alignment program MUSTANG. We show how this application can be used to produce standardized structural comparisons, identify common substructures among structurally related proteins, as well as generate sieved models for use in protein crystallographic structure determination using the technique of Molecular Replacement.
MUSTANG-MR web server benefits from an intuitive interface to MUSTANG  and a specially designed sieving procedure. “Sieved” models are produced from MUSTANG-generated multiple structural alignment (MSA) and superpositions by iteratively filtering out noisy residue-residue correspondences, until the resultant correspondences in the models are optimally ‘superposable’ under a threshold of RMSD. This residue-level sieving is also accompanied by iterative elimination of the poorly fitting structures from the input ensemble. Therefore, by varying the thresholds of RMSD and the cardinality of the ensemble, multiple sieved models are generated for a given multiple alignment and superposition from MUSTANG.
MUSTANG-MR is a project fork on MUSTANG with sieving incorporated into it. MUSTANG-MR is implemented in C++ and is available under an open-source license. A user-friendly web interface is written in JSP/Java. Figure 1 illustrates the working of the sieving server. Multiple PDB files can be uploaded and processed rapidly. The server through its interface allows direct visual analysis of the results by giving access to a range of automated tools (Figure 2). Exhaustively sieved models can be displayed interactively. Graphical representations of alignments and superpositions of sieved structures are provided using Jmol (www.jmol.org), Jalview  and BioJava . Superimposed structural coordinates and residue-level alignment can be accessed in PDB and FASTA formats respectively.
To aid the identification of structurally conserved regions of functional importance in an ensemble of protein structures, Lesk-Hubbard graphs  are generated, plotting the number of residue correspondences (NCORE) in a superposition as a function of its corresponding RMSD (Figure 3). The conserved “core” (or typically active site) shows a linear trend, which becomes exponential as divergent parts of the structure are included into the superposition.
Eukaryotic proteases (3EST, 1TON, 3RP2, 5CHA) are in blue, prokaryotic (1SGT, 2SGA, 3SGB, 2ALP) in red. The boxes highlight superpositions of sieved structures with their corresponding RMSD. At 0.6 Å, the catalytic triad and its wireframe surface are displayed in dark blue.
Results and Discussion
A data set of 8 trypsin-like serine proteases (see Table 1) from 2 different SCOP  families was used to demonstrate the utility of the server for identification of structurally conserved “core”. MUSTANG generated alignment and superposition (NCORE = 143; RMSD = 2.7 Å) were sieved by varying RMSD thresholds from 0.2 Å to 2.7 Å. Figure 3 shows the Lesk-Hubbard plot for the serine proteases data set. In the part showing the exponential, the eukaryotic enzymes share an almost identical curve, while the prokaryotic enzymes behave in a heterogeneous fashion. This reflects a more extensive ‘superposable’ region amongst the eukaryotic proteins when compared to the prokaryotic enzymes, and greater structural diversity amongst the prokaryotic proteins outside the core region. Using the interactive components of the sieving tool, the semi-linear regions of these plots (0.2 Å to 0.8 Å) are found to correspond with a shared structural core between the two families. The catalytic triad His-Asp-Ser, typical of serine proteases, is present in the identified core above the sieving RMSD of 0.6 Å, considerably below the MUSTANG alignment and superposition RMSD.
Altogether this demonstrates that the functional residues of different families can be found within the best-conserved “cores”, and underlines the value of the “sieving” approach to substructure identification.
To further assess the validity of the sieving method we have performed an exhaustive benchmarking against the SISYPHUS database, which contains a set of 149 manually curated MSAs classified into 3 categories . Comparison of MUSTANG-MR and SISYPHUS MSAs were performed by computing the PREFAB Q score . SISYPHUS alignments were used as the reference in our comparisons, whose results are presented in figure 4. The ordinate gives the ‘Q score’ (or proportion of correctly aligned residue pairs) between SISYPHUS and ‘sieved’ alignments. The abscissa gives the value ‘NCORE/NCORE unsieved’ for all MSAs (at all sieving levels), where ‘NCORE’ is the number of aligned columns within an MSA at a sieving RMSD threshold, and ‘NCORE unsieved’ the number of aligned columns obtained from the initial MUSTANG alignment (prior to the start of sieving). The fraction ‘NCORE/NCORE unsieved’ has the advantage of providing a standardized representation for all the alignments and ranges between maximum sieving (i.e with low RMSD threshold) to the minimum sieving (i.e with high RMSD threshold). From figure 4, one can observe that a vast majority of points lie above and around the y = x diagonal, showing the method is able to identify an increasing number of relevant residue pairs as the number of residues taken into account increases. It should be noted that in most cases MUSTANG-MR alignment at some sieving level would yield lower Q scores than the unsieved (initial) alignment when compared with SISYPHUS benchmark. This is because the residue-residue alignments at various sieving levels have an incomplete number of correspondences compared to the full set of correspondences in the SISYPHUS alignment. This explains the linear trend in the graph. At the very end of the NCORE scale, some points are spread under the diagonal (top right corner) indicating that more peripheral or “noisy” residues are indentified in the MSA. However, the spread on the top left corner of the plot means that even when the MSA corresponds only to a small portion of the final alignment, a high score could be obtained. This illustrates the good performance of the sieving process in identifying structurally conserved residues when only small portions of the alignment are considered.
Q scores were computed using the program QSCORE. Colors correspond to the 3 category groups in the SISYPHUS database: Homologous (black), Fold (green) and Fragments (red). We did not observe any clear relationship between Q scores, sieving level and the three classes.
We have also compared the performance of the MUSTANG alignment under what Sippl & Wiederstein  refer to as “difficult structural alignments”, in the sense that structures are assigned to different SCOP or CATH folds or topologies. The difficult alignment test sets are taken from Table 1 of their publication (ADP-ribosylating toxins (SCOP folds d.166.1.1) and Poly-ADP-ribose polymerase (d.166.1.2). The results are made available as a web link to our server (see supplementary material; superposition corresponding to Case (B) being an alternative superposition of Case (A) is not produced). We found that MUSTANG was able to produce similar alignments as the authors, except in Case (F) where similarity is at a local level and numerous peripheral elements to the core (as identified by TopMatch ) prevented MUSTANG from recognizing and aligning the structures.
Finally, to evaluate whether the ‘sieving’ method was able to identify residues of functional relevance for “difficult” alignments, it was applied to two FAD binding domains, d1gt8a4 and d1mo9a1 (Case (D), SCOP folds c.22.214.171.124 and c.3.1.5 respectively). While MUSTANG alignment results in a 3.6 Å RMSD superposition (figure 5b), two conserved specific side-chain mediated hydrogen bonds responsible for FAD binding are identified at a sieving level as low as 0.5 Å (E218/D73 – FAD O2B/O3B; D481/D353 - FAD O3′). Conserved backbone-mediated hydrogen bonds are also identified from 0.5 Å (A198/A54 & D481/D353 bind to the phosphate group) and 1.1 Å (T489/M361 – FAD O2, figure 5a) sieved structures. Other hydrogen bonds are found specific to each domain and the way they bind FAD, they are not aligned within TopMatch and MUSTANG. This provides another example of the value of the ‘sieving’ approach in highlighting common structural features.
A) Plot of number of residue correspondences vs. RMSD in each structure (d1gt8a4 is in green, d1mo9a1 in cyan). Both domains exhibit an identical curve. The boxes highlight superpositions of sieved structures with their corresponding RMSD. Van der Waals representations of residues are, for d1gt8a4 and d1mo9a1 respectively: D481/D353 in red, A198/A54 in yellow, E128/E73 in magenta and T489/M361 in orange. FAD molecules are represented as sticks in dark blue (d1gt8a4) and pale blue (d1mo9a1); B) Structural alignment of the domains with bound FAD as generated by MUSTANG.
Sieved structures as phase models in MR probes
To demonstrate the utility of sieved models in MR calculations (mode bias removal) we use the TTHA0727 protein from Thermus thermophilus HB8 (PDB ID 2CWQ; ). TTHA0727 belongs to the AhpD-like family (SCOPid 69118), with three copies of the monomer in the ASU. This structure was determined using Multiwavelength Anomalous Dispersion (MAD) phasing, since suitable homologues were not available for MR at the time. We have chosen this model because homologues now exist but are sufficiently dissimilar in sequence that they represent a challenging MR test case. The FFAS Server  identified a range of AhpD-like homologues with sequence identities between 16–20%. ‘Mixed’ models of the top six hits (non-conserved residues converted to alanines) were used in addition to testing a range (0.8 to 2.6 Å) of RMSD inputs within PHASER .
The highest resulting Z score achieved was 6.3, below the threshold of a statistically significant result. When ‘sieving’ was applied to the ‘mixed’ models however (with the same RMSD screen), numerous solutions resulted with Z scores above 7. The best of these (Z score of 10) refined well in maximum-likelihood refinement using REFMAC  Rfree of 47% after 20 cycles) and the output built to near completion (342 residues of 411 possible) and an Rfree of 25% using ARP/wARP . This result indicates clearly the potential of sieving in molecular replacement.
For substructure identification, our server provides a simple method of rapidly sieving aligned structures such that conserved substructure can be identified. It also provides a basis for standardized structural comparison, as well as identification of biologically functional residues. In the case of model bias removal, testing several sieved models in a typical post-MR refinement protocol showed variability in crystallographic Rfree values, which allowed models with lowest Rfree, and thus lowest model bias to be identified and chosen as the most promising starting models for structure refinement.
Availability and Future Directions
Mustang-MR Sieving server is freely available at http://pxgrid.med.monash.edu.au/mustangmr-server. In the short term we are adding interface improvements in order to improve usability, as well as adding working examples of actual uses for the server. In the longer term we are working on improving various aspects of usability, specifically the ability to run several alignment jobs concurrently, with the provision of session identifiers such that users can quickly retrieve results of runs, as well as email notifications of run completion. The storage of and retrieval of previous alignments via user accounts is also planned. Regarding new functionality, the MUSTANG algorithm in general is being extended to handle non-linear (in the order of residues in the chain) multiple structural alignments and superpositions, which will automatically be merged into the server. We also aim to provide domain-refined alignment for multi-domain proteins.
We thank Randy Read for helpful discussions, and Michelle Dunstone and Corrine Porter for testing and advice. We also thank the anonymous referee for their valuable comments and suggestions.
Conceived and designed the experiments: ASK CFR AMB. Performed the experiments: ASK CFR JWS. Analyzed the data: ASK CFR JWS AMB. Contributed reagents/materials/analysis tools: ASK CFR JWS JAI AL PJS JCW. Wrote the paper: ASK CFR AMB. Edited the paper: AL JCW.
- 1. Irving JA, Whisstock JC, Lesk AM (2001) Protein structural alignments and functional genomics. Proteins 42: 378–382.JA IrvingJC WhisstockAM Lesk2001Protein structural alignments and functional genomics.Proteins42378382
- 2. McPhalen CA, Vincent MG, Picot D, Jansonius JN, Lesk AM, et al. (1992) Domain closure in mitochondrial aspartate aminotransferase. J Mol Biol 227: 197–213.CA McPhalenMG VincentD. PicotJN JansoniusAM Lesk1992Domain closure in mitochondrial aspartate aminotransferase.J Mol Biol227197213
- 3. Altschul SF, Madden TL, Schaffer AA, Zhang J, Zhang Z, et al. (1997) Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res 25: 3389–3402.SF AltschulTL MaddenAA SchafferJ. ZhangZ. Zhang1997Gapped BLAST and PSI-BLAST: a new generation of protein database search programs.Nucleic Acids Res2533893402
- 4. Konagurthu AS, Whisstock JC, Stuckey PJ, Lesk AM (2006) MUSTANG: a multiple structural alignment algorithm. Proteins 64: 559–574.AS KonagurthuJC WhisstockPJ StuckeyAM Lesk2006MUSTANG: a multiple structural alignment algorithm.Proteins64559574
- 5. Clamp M, Cuff J, Searle SM, Barton GJ (2004) The Jalview Java alignment editor. Bioinformatics 20: 426–427.M. ClampJ. CuffSM SearleGJ Barton2004The Jalview Java alignment editor.Bioinformatics20426427
- 6. Holland RC, Down TA, Pocock M, Prlic A, Huen D, et al. (2008) BioJava: an open-source framework for bioinformatics. Bioinformatics 24: 2096–2097.RC HollandTA DownM. PocockA. PrlicD. Huen2008BioJava: an open-source framework for bioinformatics.Bioinformatics2420962097
- 7. Murzin AG, Brenner SE, Hubbard T, Chothia C (1995) SCOP: a structural classification of proteins database for the investigation of sequences and structures. J Mol Biol 247: 536–540.AG MurzinSE BrennerT. HubbardC. Chothia1995SCOP: a structural classification of proteins database for the investigation of sequences and structures.J Mol Biol247536540
- 8. Andreeva A, Prlic A, Hubbard TJ, Murzin AG (2007) SISYPHUS–structural alignments for proteins with non-trivial relationships. Nucleic Acids Res 35: D253–259.A. AndreevaA. PrlicTJ HubbardAG Murzin2007SISYPHUS–structural alignments for proteins with non-trivial relationships.Nucleic Acids Res35D253259
- 9. Edgar RC (2004) MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res 32: 1792–1797.RC Edgar2004MUSCLE: multiple sequence alignment with high accuracy and high throughput.Nucleic Acids Res3217921797
- 10. Sippl MJ, Wiederstein M (2008) A note on difficult structure alignment problems. Bioinformatics 24: 426–427.MJ SipplM. Wiederstein2008A note on difficult structure alignment problems.Bioinformatics24426427
- 11. Sippl MJ (2008) On distance and similarity in fold space. Bioinformatics 24: 872–873.MJ Sippl2008On distance and similarity in fold space.Bioinformatics24872873
- 12. Ito K, Arai R, Fusatomi E, Kamo-Uchikubo T, Kawaguchi S, et al. (2006) Crystal structure of the conserved protein TTHA0727 from Thermus thermophilus HB8 at 1.9 A resolution: A CMD family member distinct from carboxymuconolactone decarboxylase (CMD) and AhpD. Protein Sci 15: 1187–1192.K. ItoR. AraiE. FusatomiT. Kamo-UchikuboS. Kawaguchi2006Crystal structure of the conserved protein TTHA0727 from Thermus thermophilus HB8 at 1.9 A resolution: A CMD family member distinct from carboxymuconolactone decarboxylase (CMD) and AhpD.Protein Sci1511871192
- 13. Jaroszewski L, Rychlewski L, Li Z, Li W, Godzik A (2005) FFAS03: a server for profile–profile sequence alignments. Nucleic Acids Res 33: W284–288.L. JaroszewskiL. RychlewskiZ. LiW. LiA. Godzik2005FFAS03: a server for profile–profile sequence alignments.Nucleic Acids Res33W284288
- 14. McCoy AJ, Grosse-Kunstleve RW, Storoni LC, Read RJ (2005) Likelihood-enhanced fast translation functions. Acta Crystallogr D Biol Crystallogr 61: 458–464.AJ McCoyRW Grosse-KunstleveLC StoroniRJ Read2005Likelihood-enhanced fast translation functions.Acta Crystallogr D Biol Crystallogr61458464
- 15. Murshudov GN, Vagin AA, Dodson EJ (1997) Refinement of macromolecular structures by the maximum-likelihood method. Acta Crystallogr D Biol Crystallogr 53: 240–255.GN MurshudovAA VaginEJ Dodson1997Refinement of macromolecular structures by the maximum-likelihood method.Acta Crystallogr D Biol Crystallogr53240255
- 16. Morris RJ, Perrakis A, Lamzin VS (2003) ARP/wARP and automatic interpretation of protein electron density maps. Methods Enzymol 374: 229–244.RJ MorrisA. PerrakisVS Lamzin2003ARP/wARP and automatic interpretation of protein electron density maps.Methods Enzymol374229244