Balancing exploration and exploitation in population-based sampling improves fragment-based de novo protein structure prediction

Evaluation of strategies to narrow the product chain-length distribution of microbially synthesized free fatty acids

The dominant strategy for tailoring the chain-length distribution of free fatty acids (FFA) synthesized by heterologous hosts is expression of a selective acyl-acyl carrier protein (ACP) thioesterase. However, few of these enzymes can generate a precise (greater than 90% of a desired chain-length) product distribution when expressed in a microbial or plant host. The presence of alternative chain-lengths can complicate purification in situations where blends of fatty acids are not desired. We report the assessment of several strategies for improving the dodecanoyl-ACP thioesterase from the California bay laurel to exhibit more selective production of medium-chain free fatty acids to near exclusivity. We demonstrated that matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-ToF MS) was an effective library screening technique for identification of thioesterase variants with favorable shifts in chain-length specificity. This strategy proved to be a more effective screening technique than several rational approaches discussed herein. With this data, we isolated four thioesterase variants which exhibited a more selective FFA distribution over wildtype when expressed in the fatty acid accumulating E. coli strain, RL08. We then combined mutations from the MALDI isolates to generate BTE-MMD19, a thioesterase variant capable of producing free fatty acids consisting of 90% of C₁₂ products. Of the four mutations which conferred a specificity shift, we noted that three affected the shape of the binding pocket, while one occurred on the positively charged acyl carrier protein landing pad. Finally, we fused the maltose binding protein (MBP) from E. coli to the N - terminus of BTE-MMD19 to improve enzyme solubility and achieve a titer of 1.9 g per L of twelve-carbon fatty acids in a shake flask.

Different methods, techniques and their limitations in protein structure prediction: A review

Because of the increase in different types of diseases in human habitats, demands for designing various types of drugs are also increasing. Protein and its structure play a very important role in drug design. Therefore researchers from different areas like mathematics, medicines, and computer science are teaming up for getting better solutions in the said field. In this paper, we have discussed different methods of secondary and tertiary protein structure prediction (PSP), along with the limitations of different approaches. Different types of datasets used in PSP are also discussed here. This paper also tells about different performance measures to evaluate the prediction accuracy of PSP methods. Different software's/servers are available for download, which are used to find the protein structures for the input protein sequence. These softwares will also help to compare the performance of any new algorithm with other available methods. Details of those softwares are also mentioned in this paper.

Cryo-EM structure of the human ELMO1-DOCK5-Rac1 complex

The dedicator of cytokinesis (DOCK) family of guanine nucleotide exchange factors (GEFs) promotes cell motility, phagocytosis, and cancer metastasis through activation of Rho guanosine triphosphatases. Engulfment and cell motility (ELMO) proteins are binding partners of DOCK and regulate Rac activation. Here, we report the cryo-electron microscopy structure of the active ELMO1-DOCK5 complex bound to Rac1 at 3.8-Å resolution. The C-terminal region of ELMO1, including the pleckstrin homology (PH) domain, aids in the binding of the catalytic DOCK homology region 2 (DHR-2) domain of DOCK5 to Rac1 in its nucleotide-free state. A complex α-helical scaffold between ELMO1 and DOCK5 stabilizes the binding of Rac1. Mutagenesis studies revealed that the PH domain of ELMO1 enhances the GEF activity of DOCK5 through specific interactions with Rac1. The structure provides insights into how ELMO modulates the biochemical activity of DOCK and how Rac selectivity is achieved by ELMO.

MMpred: a distance-assisted multimodal conformation sampling for de novo protein structure prediction

MOTIVATION

The mathematically optimal solution in computational protein folding simulations does not always correspond to the native structure, due to the imperfection of the energy force fields. There is therefore a need to search for more diverse suboptimal solutions in order to identify the states close to the native. We propose a novel multimodal optimization protocol to improve the conformation sampling efficiency and modeling accuracy of de novo protein structure folding simulations.

RESULTS

A distance-assisted multimodal optimization sampling algorithm, MMpred, is proposed for de novo protein structure prediction. The protocol consists of three stages. In the first modal exploration stage, a structural similarity evaluation model DMscore is designed to control the diversity of conformations, generating a population of diverse structures in different low-energy basins. In the second modal maintaining stage, an adaptive clustering algorithm MNDcluster is proposed to divide the populations and merge the modal by adjusting the annealing temperature to locate the promising basins. In the last stage of modal exploitation, a greedy search strategy is used to accelerate the convergence of the modal. Distance constraint information is used to construct the conformation scoring model to guide sampling. MMpred is tested on 320 non-redundant proteins, where MMpred obtains models with TM-score ≥ 0.5 on 268 cases, which is 20.3% higher than that of Rosetta guided with the same distance constraints. In addition, on 320 benchmark proteins, the average TM-score of the enhanced version of MMpred (E-MMpred) is 0.732 on the best model, which is comparable to trRosetta (0.730).

AVAILABILITY

The source code and executable are freely available at https://github.com/iobio-zjut/MMpred.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Protein Structure Prediction Using Population-Based Algorithm Guided by Information Entropy

Ab initio protein structure prediction is one of the most challenging problems in computational biology. Multistage algorithms are widely used in ab initio protein structure prediction. The different computational costs of a multistage algorithm for different proteins are important to be considered. In this study, a population-based algorithm guided by information entropy (PAIE), which includes exploration and exploitation stages, is proposed for protein structure prediction. In PAIE, an entropy-based stage switch strategy is designed to switch from the exploration stage to the exploitation stage. Torsion angle statistical information is also deduced from the first stage and employed to enhance the exploitation in the second stage. Results indicate that an improvement in the performance of protein structure prediction in a benchmark of 30 proteins and 17 other free modeling targets in CASP.

Two-Stage Distance Feature-based Optimization Algorithm for De novo Protein Structure Prediction

De novo protein structure prediction can be treated as a conformational space optimization problem under the guidance of an energy function. However, it is a challenge of how to design an accurate energy function which ensures low-energy conformations close to native structures. Fortunately, recent studies have shown that the accuracy of de novo protein structure prediction can be significantly improved by integrating the residue-residue distance information. In this paper, a two-stage distance feature-based optimization algorithm (TDFO) for de novo protein structure prediction is proposed within the framework of evolutionary algorithm. In TDFO, a similarity model is first designed by using feature information which is extracted from distance profiles by bisecting K-means algorithm. The similarity model-based selection strategy is then developed to guide conformation search, and thus improve the quality of the predicted models. Moreover, global and local mutation strategies are designed, and a state estimation strategy is also proposed to strike a trade-off between the exploration and exploitation of the search space. Experimental results of 35 benchmark proteins show that the proposed TDFO can improve prediction accuracy for a large portion of test proteins.

Enhancing fragment-based protein structure prediction by customising fragment cardinality according to local secondary structure

BACKGROUND

Whenever suitable template structures are not available, usage of fragment-based protein structure prediction becomes the only practical alternative as pure ab initio techniques require massive computational resources even for very small proteins. However, inaccuracy of their energy functions and their stochastic nature imposes generation of a large number of decoys to explore adequately the solution space, limiting their usage to small proteins. Taking advantage of the uneven complexity of the sequence-structure relationship of short fragments, we adjusted the fragment insertion process by customising the number of available fragment templates according to the expected complexity of the predicted local secondary structure. Whereas the number of fragments is kept to its default value for coil regions, important and dramatic reductions are proposed for beta sheet and alpha helical regions, respectively.

RESULTS

The evaluation of our fragment selection approach was conducted using an enhanced version of the popular Rosetta fragment-based protein structure prediction tool. It was modified so that the number of fragment candidates used in Rosetta could be adjusted based on the local secondary structure. Compared to Rosetta's standard predictions, our strategy delivered improved first models, + 24% and + 6% in terms of GDT, when using 2000 and 20,000 decoys, respectively, while reducing significantly the number of fragment candidates. Furthermore, our enhanced version of Rosetta is able to deliver with 2000 decoys a performance equivalent to that produced by standard Rosetta while using 20,000 decoys. We hypothesise that, as the fragment insertion process focuses on the most challenging regions, such as coils, fewer decoys are needed to explore satisfactorily conformation spaces.

CONCLUSIONS

Taking advantage of the high accuracy of sequence-based secondary structure predictions, we showed the value of that information to customise the number of candidates used during the fragment insertion process of fragment-based protein structure prediction. Experimentations conducted using standard Rosetta showed that, when using the recommended number of decoys, i.e. 20,000, our strategy produces better results. Alternatively, similar results can be achieved using only 2000 decoys. Consequently, we recommend the adoption of this strategy to either improve significantly model quality or reduce processing times by a factor 10.

A structural homology approach for computational protein design with flexible backbone

Motivation

Structure-based Computational Protein design (CPD) plays a critical role in advancing the field of protein engineering. Using an all-atom energy function, CPD tries to identify amino acid sequences that fold into a target structure and ultimately perform a desired function. Energy functions remain however imperfect and injecting relevant information from known structures in the design process should lead to improved designs.

Results

We introduce Shades, a data-driven CPD method that exploits local structural environments in known protein structures together with energy to guide sequence design, while sampling side-chain and backbone conformations to accommodate mutations. Shades (Structural Homology Algorithm for protein DESign), is based on customized libraries of non-contiguous in-contact amino acid residue motifs. We have tested Shades on a public benchmark of 40 proteins selected from different protein families. When excluding homologous proteins, Shades achieved a protein sequence recovery of 30% and a protein sequence similarity of 46% on average, compared with the PFAM protein family of the target protein. When homologous structures were added, the wild-type sequence recovery rate achieved 93%.

Availability and implementation

Shades source code is available at https://bitbucket.org/satsumaimo/shades as a patch for Rosetta 3.8 with a curated protein structure database and ITEM library creation software.

Supplementary information

Supplementary data are available at Bioinformatics online.

Sequential search leads to faster, more efficient fragment-based de novo protein structure prediction

Motivation

Most current de novo structure prediction methods randomly sample protein conformations and thus require large amounts of computational resource. Here, we consider a sequential sampling strategy, building on ideas from recent experimental work which shows that many proteins fold cotranslationally.

Results

We have investigated whether a pseudo-greedy search approach, which begins sequentially from one of the termini, can improve the performance and accuracy of de novo protein structure prediction. We observed that our sequential approach converges when fewer than 20 000 decoys have been produced, fewer than commonly expected. Using our software, SAINT2, we also compared the run time and quality of models produced in a sequential fashion against a standard, non-sequential approach. Sequential prediction produces an individual decoy 1.5-2.5 times faster than non-sequential prediction. When considering the quality of the best model, sequential prediction led to a better model being produced for 31 out of 41 soluble protein validation cases and for 18 out of 24 transmembrane protein cases. Correct models (TM-Score > 0.5) were produced for 29 of these cases by the sequential mode and for only 22 by the non-sequential mode. Our comparison reveals that a sequential search strategy can be used to drastically reduce computational time of de novo protein structure prediction and improve accuracy.

Availability and implementation

Data are available for download from: http://opig.stats.ox.ac.uk/resources. SAINT2 is available for download from: https://github.com/sauloho/SAINT2.

Contact

saulo.deoliveira@dtc.ox.ac.uk.

Supplementary information

Supplementary data are available at Bioinformatics online.

Fragger: a protein fragment picker for structural queries

Protein modeling and design activities often require querying the Protein Data Bank (PDB) with a structural fragment, possibly containing gaps. For some applications, it is preferable to work on a specific subset of the PDB or with unpublished structures. These requirements, along with specific user needs, motivated the creation of a new software to manage and

query 3D protein fragments. Fragger is a protein fragment picker that allows protein fragment databases to be created and queried. All fragment lengths are supported and any set of PDB files can be used to create a database. Fragger can efficiently search a fragment database with a query fragment and a distance threshold. Matching fragments are ranked by distance to the query. The query fragment can have structural gaps and the allowed amino acid sequences matching a query can be constrained via a regular expression of one-letter amino acid codes. Fragger also incorporates a tool to compute the backbone RMSD of one versus many fragments in high throughput. Fragger should be useful for protein design, loop grafting and related structural

bioinformatics tasks.