Non‐recombinogenic roles for Rad52 in translesion synthesis during DNA damage tolerance

DNA damage tolerance relies on homologous recombination (HR) and translesion synthesis (TLS) mechanisms to fill in the ssDNA gaps generated during passing of the replication fork over DNA lesions in the template. Whereas TLS requires specialized polymerases able to incorporate a dNTP opposite the lesion and is error‐prone, HR uses the sister chromatid and is mostly error‐free. We report that the HR protein Rad52—but not Rad51 and Rad57—acts in concert with the TLS machinery (Rad6/Rad18‐mediated PCNA ubiquitylation and polymerases Rev1/Pol ζ) to repair MMS and UV light‐induced ssDNA gaps through a non‐recombinogenic mechanism, as inferred from the different phenotypes displayed in the absence of Rad52 and Rad54 (essential for MMS‐ and UV‐induced HR); accordingly, Rad52 is required for efficient DNA damage‐induced mutagenesis. In addition, Rad52, Rad51, and Rad57, but not Rad54, facilitate Rad6/Rad18 binding to chromatin and subsequent DNA damage‐induced PCNA ubiquitylation. Therefore, Rad52 facilitates the tolerance process not only by HR but also by TLS through Rad51/Rad57‐dependent and ‐independent processes, providing a novel role for the recombination proteins in maintaining genome integrity.     

Pitfalls of using lucigenin in endothelial cells: Implications for NAD(P)H dependent superoxide formation

Since an increased endothelial superoxide formation plays an important role in the pathogenesis of endothelial dysfunction its specific detection is of particular interest. The widely used superoxide probe lucigenin, however, has been reported to induce superoxide under certain conditions, especially in the presence of NADH. This raises questions as to the conclusion of a NAD(P)H oxidase as the major source of endothelial superoxide. Using independent methods, we showed that lucigenin in the presence of NADH leads to the production of substantial amount of superoxide (～ 15-fold of control) in endothelial cell homogenates. On the other hand, these independent methods revealed that endothelial cells without lucigenin still produce superoxide in a NAD(P)H-dependent manner. This was blocked by inhibitors of the neutrophil NADPH oxidase diphenyleniodonium and phenylarsine oxide. Our results demonstrate that a NAD(P)H-dependent oxidase is an important source for endothelial superoxide but the latter, however, cannot be measured reliably by lucigenin.     

A conservation and rigidity based method for detecting critical protein residues

Background

Certain amino acids in proteins play a critical role in determining their structural stability and function. Examples include flexible regions such as hinges which allow domain motion, and highly conserved residues on functional interfaces which allow interactions with other proteins. Detecting these regions can aid in the analysis and simulation of protein rigidity and conformational changes, and helps characterizing protein binding and docking. We present an analysis of critical residues in proteins using a combination of two complementary techniques. One method performs in-silico mutations and analyzes the protein's rigidity to infer the role of a point substitution to Glycine or Alanine. The other method uses evolutionary conservation to find functional interfaces in proteins.

Results

We applied the two methods to a dataset of proteins, including biomolecules with experimentally known critical residues as determined by the free energy of unfolding. Our results show that the combination of the two methods can detect the vast majority of critical residues in tested proteins.

Conclusions

Our results show that the combination of the two methods has the potential to detect more information than each method separately. Future work will provide a confidence level for the criticalness of a residue to improve the accuracy of our method and eliminate false positives. Once the combined methods are integrated into one scoring function, it can be applied to other domains such as estimating functional interfaces.

     

A conservation and biophysics guided stochastic approach to refining docked multimeric proteins

Background

We introduce a protein docking refinement method that accepts complexes consisting of any number of monomeric units. The method uses a scoring function based on a tight coupling between evolutionary conservation, geometry and physico-chemical interactions. Understanding the role of protein complexes in the basic biology of organisms heavily relies on the detection of protein complexes and their structures. Different computational docking methods are developed for this purpose, however, these methods are often not accurate and their results need to be further refined to improve the geometry and the energy of the resulting complexes. Also, despite the fact that complexes in nature often have more than two monomers, most docking methods focus on dimers since the computational complexity increases exponentially due to the addition of monomeric units.

Results

Our results show that the refinement scheme can efficiently handle complexes with more than two monomers by biasing the results towards complexes with native interactions, filtering out false positive results. Our refined complexes have better IRMSDs with respect to the known complexes and lower energies than those initial docked structures.

Conclusions

Evolutionary conservation information allows us to bias our results towards possible functional interfaces, and the probabilistic selection scheme helps us to escape local energy minima. We aim to incorporate our refinement method in a larger framework which also enables docking of multimeric complexes given only monomeric structures.

     

Predicting beta-turns in proteins using support vector machines with fractional polynomials

Background

β-turns are secondary structure type that have essential role in molecular recognition, protein folding, and stability. They are found to be the most common type of non-repetitive structures since 25% of amino acids in protein structures are situated on them. Their prediction is considered to be one of the crucial problems in bioinformatics and molecular biology, which can provide valuable insights and inputs for the fold recognition and drug design.

Results

We propose an approach that combines support vector machines (SVMs) and logistic regression (LR) in a hybrid prediction method, which we call (H-SVM-LR) to predict β-turns in proteins. Fractional polynomials are used for LR modeling. We utilize position specific scoring matrices (PSSMs) and predicted secondary structure (PSS) as features. Our simulation studies show that H-SVM-LR achieves Qtotal of 82.87%, 82.84%, and 82.32% on the BT426, BT547, and BT823 datasets respectively. These values are the highest among other β-turns prediction methods that are based on PSSMs and secondary structure information. H-SVM-LR also achieves favorable performance in predicting β-turns as measured by the Matthew's correlation coefficient (MCC) on these datasets. Furthermore, H-SVM-LR shows good performance when considering shape strings as additional features.

Conclusions

In this paper, we present a comprehensive approach for β-turns prediction. Experiments show that our proposed approach achieves better performance compared to other competing prediction methods.

     

Integrating domain similarity to improve protein complexes identification in TAP-MS data

Background

Detecting protein complexes in protein-protein interaction (PPI) networks plays an important role in improving our understanding of the dynamic of cellular organisation. However, protein interaction data generated by high-throughput experiments such as yeast-two-hybrid (Y2H) and tandem affinity-purification/mass-spectrometry (TAP-MS) are characterised by the presence of a significant number of false positives and false negatives. In recent years there has been a growing trend to incorporate diverse domain knowledge to support large-scale analysis of PPI networks.

Methods

This paper presents a new algorithm, by incorporating Gene Ontology (GO) based semantic similarities, to detect protein complexes from PPI networks generated by TAP-MS. By taking co-complex relations in TAP-MS data into account, TAP-MS PPI networks are modelled as bipartite graph, where bait proteins consist of one set of nodes and prey proteins are on the other. Similarities between pairs of bait proteins are computed by considering both the topological features and GO-driven semantic similarities. Bait proteins are then grouped in to sets of clusters based on their pair-wise similarities to produce a set of 'seed' clusters. An expansion process is applied to each 'seed' cluster to recruit prey proteins which are significantly associated with the same set of bait proteins. Thus, completely identified protein complexes are then obtained.

Results

The proposed algorithm has been applied to real TAP-MS PPI networks. Fifteen quality measures have been employed to evaluate the quality of generated protein complexes. Experimental results show that the proposed algorithm has greatly improved the accuracy of identifying complexes and outperformed several state-of-the-art clustering algorithms. Moreover, by incorporating semantic similarity, the proposed algorithm is more robust to noises in the networks.

     

M-Finder: Uncovering functionally associated proteins from interactome data integrated with GO annotations

Background

Protein-protein interactions (PPIs) play a key role in understanding the mechanisms of cellular processes. The availability of interactome data has catalyzed the development of computational approaches to elucidate functional behaviors of proteins on a system level. Gene Ontology (GO) and its annotations are a significant resource for functional characterization of proteins. Because of wide coverage, GO data have often been adopted as a benchmark for protein function prediction on the genomic scale.

Results

We propose a computational approach, called M-Finder, for functional association pattern mining. This method employs semantic analytics to integrate the genome-wide PPIs with GO data. We also introduce an interactive web application tool that visualizes a functional association network linked to a protein specified by a user. The proposed approach comprises two major components. First, the PPIs that have been generated by high-throughput methods are weighted in terms of their functional consistency using GO and its annotations. We assess two advanced semantic similarity metrics which quantify the functional association level of each interacting protein pair. We demonstrate that these measures outperform the other existing methods by evaluating their agreement to other biological features, such as sequence similarity, the presence of common Pfam domains, and core PPIs. Second, the information flow-based algorithm is employed to discover a set of proteins functionally associated with the protein in a query and their links efficiently. This algorithm reconstructs a functional association network of the query protein. The output network size can be flexibly determined by parameters.

Conclusions

M-Finder provides a useful framework to investigate functional association patterns with any protein. This software will also allow users to perform further systematic analysis of a set of proteins for any specific function. It is available online at http://bionet.ecs.baylor.edu/mfinder

     

Rapid sampling of local minima in protein energy surface and effective reduction through a multi-objective filter

Background

Many problems in protein modeling require obtaining a discrete representation of the protein conformational space as an ensemble of conformations. In ab-initio structure prediction, in particular, where the goal is to predict the native structure of a protein chain given its amino-acid sequence, the ensemble needs to satisfy energetic constraints. Given the thermodynamic hypothesis, an effective ensemble contains low-energy conformations which are similar to the native structure. The high-dimensionality of the conformational space and the ruggedness of the underlying energy surface currently make it very difficult to obtain such an ensemble. Recent studies have proposed that Basin Hopping is a promising probabilistic search framework to obtain a discrete representation of the protein energy surface in terms of local minima. Basin Hopping performs a series of structural perturbations followed by energy minimizations with the goal of hopping between nearby energy minima. This approach has been shown to be effective in obtaining conformations near the native structure for small systems. Recent work by us has extended this framework to larger systems through employment of the molecular fragment replacement technique, resulting in rapid sampling of large ensembles.

Methods

This paper investigates the algorithmic components in Basin Hopping to both understand and control their effect on the sampling of near-native minima. Realizing that such an ensemble is reduced before further refinement in full ab-initio protocols, we take an additional step and analyze the quality of the ensemble retained by ensemble reduction techniques. We propose a novel multi-objective technique based on the Pareto front to filter the ensemble of sampled local minima.

Results and conclusions

We show that controlling the magnitude of the perturbation allows directly controlling the distance between consecutively-sampled local minima and, in turn, steering the exploration towards conformations near the native structure. For the minimization step, we show that the addition of Metropolis Monte Carlo-based minimization is no more effective than a simple greedy search. Finally, we show that the size of the ensemble of sampled local minima can be effectively and efficiently reduced by a multi-objective filter to obtain a simpler representation of the probed energy surface.

     

B-cell depletion in SLE: clinical and trial experience with rituximab and ocrelizumaband implications for study design

B cells are believed to be central to the disease process in systemic lupuserythematosus (SLE), making them a target for new therapeutic intervention. In recentyears there have been many publications regarding the experience in SLE of B-celldepletion utilising rituximab, an anti-CD20 mAb that temporarily depletes B cells,reporting promising results in uncontrolled open studies and in routine clinical use.However, the two large randomised controlled trials in extra-renal lupus (EXPLORERstudy) and lupus nephritis (LUNAR study) failed to achieve their primary endpoints.Based on the clinical experience with rituximab this failure was somewhat unexpectedand raised a number of questions and concerns, not only into the true level ofbenefit of B-cell depletion in a broad population but also how to test the true levelof effectiveness of an investigational agent as we seek to improve the design oftherapeutic trials in SLE. A better understanding of what went wrong in these trialsis essential to elucidate the underlying reasons for the disparate observations notedin open studies and controlled trials. In this review, we focus on various factorsthat may affect the ability to accurately and confidently establish the level oftreatment effect of the investigational agent, in this case rituximab, in the twostudies and explore hurdles faced in the randomised controlled trials investigatingthe efficacy of ocrelizumab, the humanised anti-CD20 mAb, in SLE. Further, based onthe lessons learned from the clinical trials, we make suggestions that could beimplemented in future clinical trial design to overcome the hurdles faced.     

HMPAS: Human Membrane Protein Analysis System

Background

Membrane proteins perform essential roles in diverse cellular functions and are regarded as major pharmaceutical targets. The significance of membrane proteins has led to the developing dozens of resources related with membrane proteins. However, most of these resources are built for specific well-known membrane protein groups, making it difficult to find common and specific features of various membrane protein groups.

Methods

We collected human membrane proteins from the dispersed resources and predicted novel membrane protein candidates by using ortholog information and our membrane protein classifiers. The membrane proteins were classified according to the type of interaction with the membrane, subcellular localization, and molecular function. We also made new feature dataset to characterize the membrane proteins in various aspects including membrane protein topology, domain, biological process, disease, and drug. Moreover, protein structure and ICD-10-CM based integrated disease and drug information was newly included. To analyze the comprehensive information of membrane proteins, we implemented analysis tools to identify novel sequence and functional features of the classified membrane protein groups and to extract features from protein sequences.

Results

We constructed HMPAS with 28,509 collected known membrane proteins and 8,076 newly predicted candidates. This system provides integrated information of human membrane proteins individually and in groups organized by 45 subcellular locations and 1,401 molecular functions. As a case study, we identified associations between the membrane proteins and diseases and present that membrane proteins are promising targets for diseases related with nervous system and circulatory system. A web-based interface of this system was constructed to facilitate researchers not only to retrieve organized information of individual proteins but also to use the tools to analyze the membrane proteins.

Conclusions

HMPAS provides comprehensive information about human membrane proteins including specific features of certain membrane protein groups. In this system, user can acquire the information of individual proteins and specified groups focused on their conserved sequence features, involved cellular processes, and diseases. HMPAS may contribute as a valuable resource for the inference of novel cellular mechanisms and pharmaceutical targets associated with the human membrane proteins. HMPAS is freely available at http://fcode.kaist.ac.kr/hmpas.