The biological assembly

The PDB defines the biological assembly as “the macromolecular assembly that has either been shown to be or is believed to be the functional form of the molecule” [13]. Many proteins do have a single clear functional unit which accounts for the majority of the folded species in cells. However, determining the biological assembly in crystals can be less clear-cut. Modifications in the protein construct to facilitate crystallization, such as removal of disordered loops or domains, can alter or remove interfaces, giving a different assembly than would be present in vivo. In such cases, rather than representing the functional form of the molecule, the best we can hope for is representing the complex that would remain were the crystal to be dissolved in a physiological-like buffer.

Weak interactions represent a further challenge. Many protein-protein interactions can be described as transient or weak, as measured by a high dissociation constant (K_d). The crystal environment may or may not capture those transient assemblies. EPPIC is targeted at predicting stable biological assemblies; in cases where the protein is likely to exist in equilibrium under physiological conditions, we consider both states to be correct biological assemblies and typically predict the smaller (more stable) assembly. However, this is not a major issue in practice, as all cases considered in the benchmark had a clear consensus as to the correct biological assembly.

Definitions

Let us first introduce a few definitions that will be used throughout the manuscript:

1. A molecular entity is a unique molecule (typically a polypeptide) with an unique sequence. Different instances (chains) of the entity can have slight differences in 3D conformation, as it is often the case with non-crystallographic symmetry (NCS) copies of the same molecule.
2. An interface type is a particular binding mode between two entities. Since the atomic details of an interface may differ between two instances of an interface type in a particular crystal, a clustering protocol over the set of inter-chain contacts is required to define equivalent interfaces.
3. An assembly is a set of chains from the unit cell (lattice). Chains are identified by a chain ID and a symmetry operator ID.
4. An interface between two given chains is engaged in an assembly if both partners of the interface belong to the assembly.
5. An interface can be considered induced if when disengaging it, the assembly remains connected. It can be seen as a “redundant” interface in the assembly. A minimum of 1 interface type is needed in a cyclic point group symmetry, or 2 interface types for other point groups (dihedral, octahedral, tetrahedral, icosahedral). All other interfaces can be considered induced. The choice of what is a constitutive interface and what is an induced interface is subjective. See for instance Fig 1b where the dihedral assembly is composed of 3 interface types, with 1 of them being induced.
6. A superassembly is a set of assemblies that completely cover the lattice.
7. The stoichiometry of an assembly is a positive integer vector containing the molecule counts for each entity in that assembly. For example, in a crystal with entities A,B,C an A₂ dimer would have stoichiometry [2, 0, 0].
8. Two assemblies are orthogonal if and only if they do not have any entities in common (i.e. the inner (scalar) product of their stoichiometries is zero).

Download:

• PPT
  PowerPoint slide
• PNG
  larger image
• TIFF
  original image

Fig 1. Visualizations of the biological assembly for GAD1 from Arabidopsis thaliana [PDB:3HBX], as presented by the EPPIC server.

(a) 3D lattice graph of a full unit cell (http://eppic-web.org/ewui/ewui/latticeGraph?id=3hbx&interfaces=*). The nodes are placed at the centroids of each chain, with edges indicating all interfaces. Many edges extend outside the unit cell due to the periodic nature of the lattice. (b) 2D graph of the hexameric biological assembly, formed by engaging three interface types (interfaces 1-3, 4-6 and 8-13). In both diagrams, nodes are labeled with chain ID and symmetry operator and colored by molecular entity. Edges are numbered sequentially by buried surface area and colored by interface type.

https://doi.org/10.1371/journal.pcbi.1006104.g001

Symmetry and closeness

In their seminal paper, Monod, Wyman and Changeux [14] exposed the basics of protein association into oligomers by presenting a very clear argumentation on the possible ways in which homomers can associate. They argue that only two types of associations are possible between two protein chains of the same entity:

1. Isologous or face-to-face: two protomers meet through a 2-fold symmetry axis. The same surface patch is used for the association.
2. Heterologous or face-to-back: two different surface patches from each side mediate the association.

In isologous associations the interacting interface patches are mutually satisfied and capped. There is no further association possible through the interfaces. However in heterologous association the interacting interface patches are exposed to the solvent and will continue associating to other protomers indefinitely. The only way that this indefinite association can stop is by the protomers cycling around and associating back to the first protomer, forming a cyclic C_n symmetry. Thus in both cases, in order to have stable oligomeric complexes in solution, symmetry must occur. Specifically, point group symmetry is necessary: cyclic (C), dihedral (D), tetrahedral (T), octahedral (O), or icosahedral (I). Cyclic is the only point group that is composed by only heterologous interfaces, while the others are combinations of both isologous and heterologous interfaces.

The same argument can be extended to heteromers with two or more copies of each monomer. The heteromer is reduced to the homomer case by simply fusing the heteromeric entities into one and then treating the super entity as a homomer. Symmetry is thus a necessary condition for stable protein oligomers and we found our subsequent analysis and the assembly rules on that assumption.

The necessity and prevalence of symmetry has been since widely studied in the literature. The review by Goodsell and Olson [15] is a comprehensive overview of the topic. There are mechanisms that can lead to non-symmetric assemblies, for instance pseudo-symmetry or self-occlusion producing steric hindrance on an heterologous interaction [16]. However those exceptions are rare and the vast majority of known protein oligomers are symmetric. We discuss some of the exceptions in the section Exceptions to the rules below.

The lattice graph

The crystal lattice can be represented by a periodic graph with protein chains as nodes and interfaces between them as edges. Graphs that represent lattices are widely used in crystallography (especially for small molecules) and are also known as crystal nets. The excellent book by Sunada [17] contains an in-depth account of the mathematics of crystal nets. Here, we apply them to whole macromolecules rather than individual atoms and bonds, as is more typical in small molecule crystallography.

We label nodes and edges to identify the molecular entities and the distinct mode of interactions between them, see Fig 1b. A node is identified by a chain identifier and a symmetry operator identifier (e.g. A_1), while an edge is identified by a numerical interface identifier. Additionally, all nodes corresponding to the same molecular entity are given an entity label and all edges corresponding to the same interface type are given an interface type identifier label. Although the graph is depicted in one unit cell only, it does represent all possible connections in the crystal including those across neighboring unit cells.

The crystal translations associated to the interfaces are also required to fully describe the graph and are essential in finding closed cycles with 0 net translation. We represent these as an integer vector for each edge giving the difference in Miller indices for the two chains participating in the interface, with respect to a given choice of unit cell operators.

Diagrams similar to our 2D graph representation of the lattice graph have been used previously in the context of quaternary structure studies, see for instance [18] and [19]. The EPPIC website includes a visualization of the lattice graph using a custom graph layout generated by a stereographic projection of the subunits along an axis of symmetry, giving graphs with geometrically consistent node positions.

Assembly rules

Given the definitions introduced in the section above, we now establish the rules for a superassembly to be valid, from which the algorithm to find all assemblies result:

1. Full Coverage: Every chain belongs to exactly one assembly from the superassembly (implied from the definition).
2. Uniform Composition: All instances of an interface type are either engaged or disengaged in the superassembly.
3. Isomorphism: All assemblies should have isomorphic graphs with respect to the molecular entities and interface types. Isomorphism must hold only if the assemblies are not orthogonal in stoichiometry.
4. Closed Symmetry: No combination of engaged interface operators can lead to a non-zero pure translational operator.

The first two rules ensure consistency in the decomposition of the superassembly into assemblies. The third rule is motivated by the assumption that co-crystallization of multiple biological assemblies involving the same entities does not occur. Co-crystallization implies that the complex exists at equilibrium in the crystallization conditions, making the correct biological assembly ambiguous. By disallowing co-crystallization we effectively favor the dissociated form as the correct assembly for proteins with weak or transient interactions. Finally, the fourth rule is motivated by the hypothesis that infinite assemblies are never biological (discussed later).

From the rules it follows that a) valid assemblies are point group symmetric, and b) heteromeric assemblies must have even stoichiometry. We then implement an algorithm that follows the above rules, described in detail below.

Pairwise interface classification

Interface classification in EPPIC is described in our previous paper [12]. However, there have been some improvements to the interface scoring and classification.

When calculating the sequence entropy at each position, we now use a 6-letter reduced alphabet to represent the 20 amino acids [20]. The alphabet was proposed by Mirny et al. [21]:

1. {ACILMV}, {DE}, {FHWY}, {GP}, {KR}, {NQST}

In addition, the core surface scores are now pure Z-scores where m residues are sampled 10,000 times from the whole protein surface. An average sequence entropy is calculated for each of those samples and then the mean and standard deviation of the whole distribution is used for the Z-score of the m residues composing the interface core.

Finally, we have introduced a probabilistic scoring for interface classification, based on a logistic regression classifier that uses 2 of our 3 previous indicators: geometry (gm) and core-surface (cs) scores [22]. The model was trained using the Many dataset [4] with R generalized linear model (glm) functions. The equation that describes the probability of an interface being biologically relevant (p) is:

(1)

A ROC curve with the performance of the new method can be found in Supplementary S1 Fig and is directly comparable to the curves in [4].

Assembly enumeration algorithm

We denote interface types by numerical identifiers 1, …, n, sorted from largest to smallest area. An assembly is created when engaging a subset of those interfaces, e.g. {1, 3} is the assembly where only interfaces 1 and 3 are engaged, or {} is the empty assembly where no interfaces are engaged.

Given the set of all interface types S = {1, …, n}, enumerating all possible assemblies is a matter of traversing the tree of its power set . A total of 2ⁿ assemblies are possible in principle, making the full enumeration prohibitive when n becomes large. For every set, the assembly is tested against our rules to see if it represents a valid assembly. An important observation makes the problem more tractable: if a given set is invalid, all of its children (i.e. any other set that contains the same engaged interfaces plus any other) will also be invalid. This dramatically prunes the tree, making it possible to quickly do the exhaustive enumeration for almost all cases.

As a further optimization, heteromers with many protein entities are reduced to equivalent homomeric lattice graphs by combining entities, leading to considerably simpler graphs. Interfaces that join different entities are selected in a greedy manner. The edge corresponding to the interface is then contracted, merging the two entities into a single node. This process is iterated until a single meta-entity remains. Graph contraction preserves the structure of the graph with respect to the validity properties and relative score, while allowing considerably faster superassembly enumeration.

The test of validity for a given superassembly boils down to two tests: graph isomorphism and finding closed cycles in the graph. To find the cycles we use the Paton algorithm [23] as implemented in the JGraphT library.

The EPPIC software package implements all of the described algorithms in its new version 3. The software is written in Java, using BioJava [24] as the underlying software library to handle the biological data.

Predicting assemblies from pairwise interface classification

In order to predict the most likely biologically relevant assembly we use a combination of the probabilistic scores calculated for the pairwise interfaces. By the uniform composition rule all interfaces of a type must be engaged together, so interfaces of the same type are considered together as a binary event that can either occur or not in biological conditions. An assembly is just a subset of the interface types in the crystal occurring in biological conditions, with the remaining interface subsets not occurring. Each assembly is characterized by a boolean vector s₁, s₂, …, s_n with s_i indicating type i is engaged in the assembly. The probability p_i of interface type i being biologically relevant is calculated as the average of its interfaces (Eq 1). To estimate the probability of an assembly occurring in biological conditions is to estimate the joint probability of events coming from all interfaces in the crystal: (2) To perform the estimation, we assume that the pairwise interfaces can be treated as independent. As EPPIC interface scores depend critically on the estimation of residue burial, this assumption is valid for the score in Eq 1 so long as the total buried surface area of the assembly is well approximated by the sum of the pairwise buried surface areas. This assumption may be violated for proteins where three or more subunits interact in a confined region, such that the calculation of buried surface area would change significantly depending on whether the third chain is included in the calculation or not. In this case the assembly cannot be decomposed into pairwise interfaces. However, this is rare and only affects small interfaces, so it is not considered by EPPIC.

Using the probabilities for each interface p_i, we can assign a probability of occurring in biological conditions to each assembly of the crystal: (3) where is the indicator function ( if s_i else 0).

Note that interface types are not weighted according to the number of interfaces. While one does expect some cooperative effects due to avidity, including this in the assembly probability calculation (e.g. by taking the product over individual interfaces rather than interface types) would bias the scores towards high-order cyclic assemblies. For this reason it was decided to model the probability of the complete assembly as the product of the engaged interface types.

Some combinations of engaged interfaces will correspond to invalid assemblies according to the rules above. These assemblies have a probability of occurrence of 0, so summing P(S) over all valid assemblies in the crystal may be less than one. Thus, a final normalization step can be applied to redistribute the probability mass of interface events leading to invalid assemblies into the valid assemblies.

Special care has to be taken with induced interfaces, which can be omitted from an assembly without changing the quaternary structure. Superassemblies which differ only by an induced interface can be easily detected by comparing the stoichiometry of their constituent assemblies. This allows all superassemblies which differ only by induced interfaces to be combined together. The superassembly with the highest number of engaged interfaces is reported along with the total probability of all equivalent superassemblies.

The reported probability for an assembly is the confidence that the EPPIC call is correct. It is important not to confuse these probabilities with strength of the assembly or transitivity properties.

Biological assemblies dataset

We compiled a new dataset of biological assemblies using the annotations of deposited structures in the PDB. We started with 96,594 crystal structures with higher than 3 Å resolution and lower than 0.3 R-free value from the PDB. Structures were then grouped into 60,034 unique sequences and 36,843 70% sequence identity clusters for each of their chains. These were further filtered to clusters with at least three structures and where all structures had the same biological assembly annotation. Randomly selecting a representative from each of the remaining clusters yielded 1,481 proteins. This new dataset of biological assemblies from PDB1 annotations represents a diverse sample of the PDB: 53% of oligomers, from which 11% are heteromers, covering macromolecular sizes up to 24 partner subunits.

Improvements in the web server

Together with the command line interface (downloadable at http://eppic-web.org/ewui/#downloads), we provide a web server with a graphical user interface to the EPPIC 3 software. There has been numerous improvements compared to what we described earlier.

A new view provides the full enumeration of all valid assemblies found in the crystal structure with links to its constituent interfaces. The assemblies are visualized by thumbnail images of the assembled proteins and by 2-dimensional diagrams of their corresponding graphs.

New lattice graph visualizations are provided. First in 2D with the help of the vis.js library [25]. An optimal 2D graph layout is achieved by performing a stereographic projection of the 3D molecule. A 3D lattice graph representation is also provided with NGL [26] by overlaying custom made spheres and cylinder objects on top of a semi-transparent cartoon representation of the unit cell.

In EPPIC 2, the 3D visualization was based in the Jmol molecular viewer. The server now uses NGL [26] as the molecular visualization software. NGL is written in JavaScript and runs natively in the browser with very good performance thanks to WebGL technologies. Its advanced features allow for showing sequence entropy surface color representation within the browser.

Benchmarking and comparison with PISA

We validated our assembly assignment method against the dataset of 1,481 PDB entries with consensus quaternary structure annotations (PDB1 dataset). Fig 2 shows the confusion matrix of the assembly size for EPPIC predictions, with an overall precision of 85%. While the precision is constant across the different macromolecular sizes, the recall is lower for larger assemblies. The consequence is the reduction of non-biological large macromolecular assembly predictions (top-left of the matrix in Fig 2), at the expense of predicting some partial assemblies (bottom-right of the matrix in Fig 2).

Download:

• PPT
  PowerPoint slide
• PNG
  larger image
• TIFF
  original image

Fig 2. EPPIC assembly predictions as a confusion matrix of macromolecular sizes.

Tiles are colored as the fraction of predictions (i.e. row normalized). The method achieves 85% precision on the dataset. PDB1 refers to the 1st biological assembly annotation provided by the PDB, in here considered as the true biological assembly.

https://doi.org/10.1371/journal.pcbi.1006104.g002

As a further validation, we provide a comparison to the popular PISA method, the de-facto standard in the field. Despite very similar overall precision in the assemblies dataset, EPPIC and PISA predictions show many differences, as it can be appreciated in Fig 3. The most important difference is that PISA makes the opposite trade-off in the prediction of large macromolecular size assemblies, achieving better accuracy for larger assemblies at the expense of predicting some non-biological large assemblies. Table 1 gives the overview of over and under predictions, whilst Table 2 contains more detailed statistics divided into 3 categories: monomers, dimers and higher oligomers.

Download:

• PPT
  PowerPoint slide
• PNG
  larger image
• TIFF
  original image

Fig 3. Comparison of assembly predictions from EPPIC and PISA on the benchmarking dataset.

On the top right, a pie chart shows the global agreement between EPPIC and PISA. On the bottom left, the confusion matrix of actual (PDB1 annotations) and predicted macromolecular sizes. Tiles colored as a fraction of each EPPIC (blue) and PISA (red) macromolecular size prediction (i.e. row normalized). On the bottom right, the agreement and precision of the methods for each PISA macromolecular size prediction. On the top left, the total number and recall for each macromolecular size in the dataset.

https://doi.org/10.1371/journal.pcbi.1006104.g003

Download:

• PPT
  PowerPoint slide
• PNG
  larger image
• TIFF
  original image

Table 1. Over and under predictions of EPPIC and PISA in the PDB1 and PiQSi datasets.

https://doi.org/10.1371/journal.pcbi.1006104.t001

Download:

• PPT
  PowerPoint slide
• PNG
  larger image
• TIFF
  original image

Table 2. Prediction statistics for different oligomeric sizes.

https://doi.org/10.1371/journal.pcbi.1006104.t002

The agreement of the two methods greatly increases the confidence of a prediction. As observed in Fig 4, when EPPIC and PISA agree, in 78% of the cases, the error rate is only 5%. On the other hand, when the methods disagree, in the remaining 22% of the structures, the error rate of each method is around 50%. Therefore, each method corrects roughly the same amount of assignments of the other. Furthermore, at least one of the two methods is correct in 95% of the cases. These results suggest that a meta-method combining EPPIC and PISA could be successful, with a potential precision of up to 95%. Indeed a recent publication [27] reports a meta-predictor method (QSbio) combining the predictions from QSalign [27], PISA and EPPIC version 2, achieving higher precisions than either method alone.

Download:

• PPT
  PowerPoint slide
• PNG
  larger image
• TIFF
  original image

Fig 4. EPPIC and PISA predictions on the protein assembly dataset as a Venn diagram.

PDB1 refers to the 1st biological assembly annotation provided by the PDB.

https://doi.org/10.1371/journal.pcbi.1006104.g004

Additionally to the benchmark with our dataset we have also measured the performance with the PiQSi dataset [6], composed of 1315 biological assemblies curated with a combination of manual community annotation and automatic methods. The precision values for the PiQSi benchmark are 73% for EPPIC and 79% for PISA. It should be noted that the PiQSi dataset is less representative of the PDB compared to our dataset, for instance having fewer monomers and more very large oligomers than average in the PDB.

Interesting assemblies in the PDB

In most cases, the quaternary structure interpretation of a crystal is unambiguous to a trained crystallographer. The unit cell shows clear blocks of symmetrically packed molecular entities. However, in more difficult cases the interpretation of the crystal is far from obvious and requires very careful observation.

A good example is the crystal structure of the fimbrial adhesin FimH protein (PDB 2VCO [28]). The crystal contains two FimH molecules in the asymmetric unit interacting via a heterologous interface. All other interfaces in the crystal are also heterologous, except for the very weak isologous interface 6 (as identified by EPPIC, see http://eppic-web.org/ewui/#interfaces/2vco). No combination of the interfaces produces a closed cycle (assembly rule 4 is not satisfied). Thus the only valid assembly in the crystal is monomeric (see http://eppic-web.org/ewui/#id/2vco). However, the PDB annotation for this case engages interfaces 1 and 3 to form a tetramer. The global symmetry of the tetramer, as calculated by the RCSB PDB website [29], is C₂, indicating that the tetramer is not point group symmetric (the only possible point groups for an A₄ stoichiometry are C₄ or D₂). The assembly might seem reasonable since in the crystal it shows as an independent block repeated throughout (see Fig 5a). Fig 5b helps explain this with a simple 2D schematic representation of a crystal packing with heterologous interfaces. The PISA software predicts in this case a different tetrameric assembly than the one annotated in PDB, formed by engaging interfaces 1 and 6. Again this assembly does not contain point group symmetry. This example also shows how a simple search for stoichiometry-symmetry imbalance (i.e. A_n stoichiometry should have C_n or D_n/2 point group symmetry) would uncover similar cases of potentially erroneous annotations in the PDB.

Download:

• PPT
  PowerPoint slide
• PNG
  larger image
• TIFF
  original image

Fig 5. Example of an asymmetric assembly with a heterologous interface.

(a) The crystal lattice of PDB 2VCO as shown by the EPPIC server (http://eppic-web.org/ewui/ewui/latticeGraph?id=2vco&interfaces=1,3). The highlighted tetrameric assembly is the one annotated in the PDB. (b) Schematic 2D representation of a lattice that contains an asymmetric dimer through a heterologous interface but which does not form infinite fibers in the crystal.

https://doi.org/10.1371/journal.pcbi.1006104.g005

Another similar example is lipoteichoic acid synthase LtaP from Listeria monocytogenes (PDB 4UOP), which corresponds quite closely to the schematic representation of Fig 5b: 2 molecules in the asymmetric unit interact through a heterologous interface, with the heterologous interface capped in the crystal by other molecules. The PDB annotates the asymmetric dimer in the AU as the biological assembly based on a PISA prediction. However, the protein is known to be a monomer in solution based on size exclusion chromatography [30]. Since the dimeric assembly is not symmetric, EPPIC considers it invalid following the assembly rules.

A second example of a subtle lattice that is difficult to analyze manually would be that of the crystal structure of the putrescine receptor PotF from E. Coli (PDB 1A99 [31]; see Fig 6a). There are 4 PotF molecules in the asymmetric unit. Two different isologous interfaces relate the 4 molecules in the AU, interfaces 5 (D+C) and 6 (B+A). The PDB annotates a dimeric assembly through one of the interfaces in the asymmetric unit (interface id 6). In principle, the assembly is valid since it has C₂ point group symmetry. However, a more careful analysis of the crystal shows that not all monomers in the lattice participate in this kind of interaction: the C and D chains do not interact in the same way throughout the crystal. Considering this assembly as a dimer would break the full coverage rule (rule 1), while considering it a co-crystal dimer + monomer breaks the isomorphism rule (rule 3). This shows why isomorphism is important: a stable assembly in solution can not occur only in some parts of the lattice and not in others. The schematic 2D view of Fig 6b helps visualize the problem. By following the assembly rule, EPPIC finds here only a monomeric assembly (see http://eppic-web.org/ewui/#id/1a99). In this case PISA predicts a disjoint assembly formed by a A₂ B₂ tetramer and separate monomers of chains C and D.

Download:

• PPT
  PowerPoint slide
• PNG
  larger image
• TIFF
  original image

Fig 6. Example of a non-isomorphic assembly in the crystal.

(a) The crystal lattice of PDB 1A99, highlighting the C₂ dimer wrapping around the unit cell (http://eppic-web.org/ewui/ewui/latticeGraph?id=1a99&interfaces=7). (b) Schematic 2D representation of a lattice that contains a valid C₂ assembly, but which is not isomorphic throughout the crystal.

https://doi.org/10.1371/journal.pcbi.1006104.g006

Exceptions to the rules

Non-symmetric assemblies are very rare but still a possibility. In fact as of June 2017, 96% of PDB structures are annotated with symmetric biological assemblies. A comprehensive study of asymmetric assemblies in heteromers [16] found a similar fraction of asymmetric cases for heteromers (9.8% of all heteromers have uneven stoichiometry). In their in-depth study, a thorough review of all cases unearthed a number of quaternary structure assignment errors, further lowering the asymmetric fraction.

Different mechanisms can lead to breakage of symmetry. One major cause of exceptions is the existence of pseudosymmetry in heteromers with uneven stoichiometry (e.g. PDB 4FI3 [32]), whereby one entity can bind several copies of its partner at distinct but structurally similar binding sites. Other exceptions include steric hindrance (e.g. PDB 3Q66 [33]) and extreme conformational flexibility (e.g. PDB 1YGY [34]). An additional source of exceptions is filamentous proteins and amyloids, which violate rule 4 by definition. However, since these properties make them resistant to crystallization, such cases are rare.

A prominent example of a pseudosymmetric case is that of the B12 vitamin transporter [32]. This large membrane protein complex is composed of 5 subunits, with 3 distinct molecular components (Fig 7a). Two BtuD chains form a symmetric C₂ dimer in the cytoplasmic domain, while the transmembrane domain is composed of two BtuC chains arranged along the same C₂ axis. Capping the complex on the periplasmic side is a single BtuF chain that binds to the BtuC dimer in a symmetric way. The 1:2 symmetric binding is made possible by the internal pseudosymmetry of the BtuF chain (see Fig 7b).

Download:

• PPT
  PowerPoint slide
• PNG
  larger image
• TIFF
  original image

Fig 7. Example of an asymmetric assembly with internal pseudo-symmetry in one of the chains.

(a) The ABC transporter (PDB 4FI3). (b) The BtuF periplasmic domain with internal C₂ pseudo-symmetry highlighted, including the 2-fold axis of symmetry. The internal symmetry calculation was performed with CE-Symm [35].

https://doi.org/10.1371/journal.pcbi.1006104.g007

Conclusions

We have presented an approach to enumerate and predict quaternary assemblies from protein crystal structures. This new method should prove very useful to the crystallographer, considerably easing the assembly interpretation of protein crystals. The automated exhaustive enumeration of assemblies represents a great improvement in the quaternary interpretation of structures, which to a large extent still requires human subjective interpretation.

Our ideas are centered in the necessity of symmetry based on the simple arguments established by Monod, Wyman and Changeux [14]. Symmetry is essential for stable soluble proteins. Our method can thus help in avoiding mistaken asymmetric interpretation of assemblies. It can also serve as a validation tool for atomic models that lack symmetric or isomorphic assemblies, providing hints on possibly uninterpreted regions of electron density that need to be added to the model in order to complete it. Additionally existing methods to predict quaternary assemblies [8] are not always strict in the symmetry constraint, providing sometimes misleading interpretations of the crystal.

Importantly, our assembly scoring uses evolution as the ultimate arbiters to the biological relevance of the assemblies, making this method complementary to existing methods based on thermodynamic estimations. Also, the newly introduced confidence values provide a clear guide to interpreting the predictions. At the same time, confidence estimations provide a means to more reliably estimate biological assembly annotation errors in the Protein Data Bank, as well as aiding the crystallographer in deciding when additional oligomeric experimental evidence for a particular assembly might be needed. Confidence values also allow for fully automated analyses of oligomeric complexes at the PDB wide level.

Some new avenues of research are possible based on this new resource. For instance, the assembly graphs allow for more detailed study of different crystal lattices and their relationships across the PDB.

We also recognize that our strict enforcement of point group symmetry is not always ideal, since, as shown in the Results section, exceptions to symmetry do occur. In future work we plan to address the problem by relaxing some of the conditions in cases where interface scoring indicate an invalid assembly could be biological.

Recent publications indicate that the evolutionary approach to protein assembly prediction and classification can be significantly improved in the future. Two research lines are promising: co-evolution of inter-subunit residues in protein-protein interactions [36, 37] and the evolutionary constraints of highly symmetric assemblies to avoid supramolecular assembly formation [38]. We believe that these additional sources of information can improve the performance of the classifier and confidence estimates, as we continue to advance the method.