State-of-the-RNArt: benchmarking current methods for RNA 3D structure prediction.

RNAs are essential molecules involved in numerous biological functions. Understanding RNA functions requires the knowledge of their 3D structures. Computational methods have been developed for over two decades to predict the 3D conformations from RNA sequences. These computational methods have been widely used and are usually categorised as either ab initio or template-based. The performances remain to be improved. Recently, the rise of deep learning has changed the sight of novel approaches. Deep learning methods are promising, but their adaptation to RNA 3D structure prediction remains difficult. In this paper, we give a brief review of the ab initio, template-based and novel deep learning approaches. We highlight the different available tools and provide a benchmark on nine methods using the RNA-Puzzles dataset. We provide an online dashboard that shows the predictions made by benchmarked methods, freely available on the EvryRNA platform: https://evryrna.ibisc.univ-evry.fr/evryrna/state_of_the_rnart/.

RNAdvisor: a comprehensive benchmarking tool for the measure and prediction of RNA structural model quality.

RNA is a complex macromolecule that plays central roles in the cell. While it is well known that its structure is directly related to its functions, understanding and predicting RNA structures is challenging. Assessing the real or predictive quality of a structure is also at stake with the complex 3D possible conformations of RNAs. Metrics have been developed to measure model quality while scoring functions aim at assigning quality to guide the discrimination of structures without a known and solved reference. Throughout the years, many metrics and scoring functions have been developed, and no unique assessment is used nowadays. Each developed assessment method has its specificity and might be complementary to understanding structure quality. Therefore, to evaluate RNA 3D structure predictions, it would be important to calculate different metrics and/or scoring functions. For this purpose, we developed RNAdvisor, a comprehensive automated software that integrates and enhances the accessibility of existing metrics and scoring functions. In this paper, we present our RNAdvisor tool, as well as state-of-the-art existing metrics, scoring functions and a set of benchmarks we conducted for evaluating them. Source code is freely available on the EvryRNA platform: https://evryrna.ibisc.univ-evry.fr.

Over-expression of Dyrk1A affects bleeding by modulating plasma fibronectin and fibrinogen level in mice.

Down syndrome is the most common chromosomal abnormality in humans. Patients with Down syndrome have hematologic disorders, including mild to moderate thrombocytopenia. In case of Down syndrome, thrombocytopenia is not associated with bleeding, and it remains poorly characterized regarding molecular mechanisms. We investigated the effects of overexpression of Dyrk1A, an important factor contributing to some major Down syndrome phenotypes, on platelet number and bleeding in mice. Mice overexpressing Dyrk1A have a decrease in platelet number by 20%. However, bleeding time was found to be reduced by 50%. The thrombocytopenia and the decreased bleeding time observed were not associated to an abnormal platelet receptors expression, to a defect of platelet activation by ADP, thrombin or convulxin, to the presence of activated platelets in the circulation or to an abnormal half-life of the platelets. To propose molecular mechanisms explaining this discrepancy, we performed a network analysis of Dyrk1A interactome and demonstrated that Dyrk1A, fibronectin and fibrinogen interact indirectly through two distinct clusters of proteins. Moreover, in mice overexpressing Dyrk1A, increased plasma fibronectin and fibrinogen levels were found, linked to an increase of the hepatic fibrinogen production. Our results indicate that overexpression of Dyrk1A in mice induces decreased bleeding consistent with increased plasma fibronectin and fibrinogen levels, revealing a new role of Dyrk1A depending on its indirect interaction with these two proteins.

C-RCPred: a multi-objective algorithm for interactive secondary structure prediction of RNA complexes integrating user knowledge and SHAPE data.

RNAs can interact with other molecules in their environment, such as ions, proteins or other RNAs, to form complexes with important biological roles. The prediction of the structure of these complexes is therefore an important issue and a difficult task. We are interested in RNA complexes composed of several (more than two) interacting RNAs. We show how available knowledge on the considered RNAs can help predict their secondary structure. We propose an interactive tool for the prediction of RNA complexes, called C-RCPRed, that considers user knowledge and probing data (which can be generated experimentally or artificially). C-RCPred is based on a multi-objective optimization algorithm. Through an extensive benchmarking procedure, which includes state-of-the-art methods, we show the efficiency of the multi-objective approach and the positive impact of considering user knowledge and probing data on the prediction results. C-RCPred is freely available as an open-source program and web server on the EvryRNA website (https://evryrna.ibisc.univ-evry.fr).

IRSOM2: a web server for predicting bifunctional RNAs.

Recent advances have shown that some biologically active non-coding RNAs (ncRNAs) are actually translated into polypeptides that have a physiological function as well. This paradigm shift requires adapted computational methods to predict this new class of 'bifunctional RNAs'. Previously, we developed IRSOM, an open-source algorithm to classify non-coding and coding RNAs. Here, we use the binary statistical model of IRSOM as a ternary classifier, called IRSOM2, to identify bifunctional RNAs as a rejection of the two other classes. We present its easy-to-use web interface, which allows users to perform predictions on large datasets of RNA sequences in a short time, to re-train the model with their own data, and to visualize and analyze the classification results thanks to the implementation of self-organizing maps (SOM). We also propose a new benchmark of experimentally validated RNAs that play both protein-coding and non-coding roles, in different organisms. Thus, IRSOM2 showed promising performance in detecting these bifunctional transcripts among ncRNAs of different types, such as circRNAs and lncRNAs (in particular those of shorter lengths). The web server is freely available on the EvryRNA platform: https://evryrna.ibisc.univ-evry.fr.

SWORD2: hierarchical analysis of protein 3D structures.

Understanding the functions and origins of proteins requires splitting these macromolecules into fragments that could be independent in terms of folding, activity, or evolution. For that purpose, structural domains are the typical level of analysis, but shorter segments, such as subdomains and supersecondary structures, are insightful as well. Here, we propose SWORD2, a web server for exploring how an input protein structure may be decomposed into 'Protein Units' that can be hierarchically assembled to delimit structural domains. For each partitioning solution, the relevance of the identified substructures is estimated through different measures. This multilevel analysis is achieved by integrating our previous work on domain delineation, 'protein peeling' and model quality assessment. We hope that SWORD2 will be useful to biologists searching for key regions in their proteins of interest and to bioinformaticians building datasets of protein structures. The web server is freely available online: https://www.dsimb.inserm.fr/SWORD2.

Representations of protein structure for exploring the conformational space: A speed-accuracy trade-off.

The recent breakthrough in the field of protein structure prediction shows the relevance of using knowledge-based based scoring functions in combination with a low-resolution 3D representation of protein macromolecules. The choice of not using all atoms is barely supported by any data in the literature, and is mostly motivated by empirical and practical reasons, such as the computational cost of assessing the numerous folds of the protein conformational space. Here, we present a comprehensive study, carried on a large and balanced benchmark of predicted protein structures, to see how different types of structural representations rank in either accuracy or calculation speed, and which ones offer the best compromise between these two criteria. We tested ten representations, including low-resolution, high-resolution, and coarse-grained approaches. We also investigated the generalization of the findings to other formalisms than the widely-used "potential of mean force" (PMF) method. Thus, we observed that representing protein structures by their ß carbons-combined or not with Cα-provides the best speed-accuracy trade-off, when using a "total information gain" scoring function. For statistical PMFs, using MARTINI backbone and side-chains beads is the best option. Finally, we also demonstrated the necessity of training the reference state on all atom types, and of including the Cα atoms of glycine residues, in a Cß-based representation.

Proteo3Dnet: a web server for the integration of structural information with interactomics data.

Proteo3Dnet is a web server dedicated to the analysis of mass spectrometry interactomics experiments. Given a flat list of proteins, its aim is to organize it in terms of structural interactions to provide a clearer overview of the data. This is achieved using three means: (i) the search for interologs with resolved structure available in the protein data bank, including cross-species remote homology search, (ii) the search for possibly weaker interactions mediated through Short Linear Motifs as predicted by ELM-a unique feature of Proteo3Dnet, (iii) the search for protein-protein interactions physically validated in the BioGRID database. The server then compiles this information and returns a graph of the identified interactions and details about the different searches. The graph can be interactively explored to understand the way the core complexes identified could interact. It can also suggest undetected partners to the experimentalists, or specific cases of conditionally exclusive binding. The interest of Proteo3Dnet, previously demonstrated for the difficult cases of the proteasome and pragmin complexes data is, here, illustrated in the context of yeast precursors to the small ribosomal subunits and the smaller interactome of 14-3-3zeta frequent interactors. The Proteo3Dnet web server is accessible at http://bioserv.rpbs.univ-paris-diderot.fr/services/Proteo3Dnet/.

InterEvDock3: a combined template-based and free docking server with increased performance through explicit modeling of complex homologs and integration of covariation-based contact maps.

The InterEvDock3 protein docking server exploits the constraints of evolution by multiple means to generate structural models of protein assemblies. The server takes as input either several sequences or 3D structures of proteins known to interact. It returns a set of 10 consensus candidate complexes, together with interface predictions to guide further experimental validation interactively. Three key novelties were implemented in InterEvDock3 to help obtain more reliable models: users can (i) generate template-based structural models of assemblies using close and remote homologs of known 3D structure, detected through an automated search protocol, (ii) select the assembly models most consistent with contact maps from external methods that implement covariation-based contact prediction with or without deep learning and (iii) exploit a novel coevolution-based scoring scheme at atomic level, which leads to significantly higher free docking success rates. The performance of the server was validated on two large free docking benchmark databases, containing respectively 230 unbound targets (Weng dataset) and 812 models of unbound targets (PPI4DOCK dataset). Its effectiveness has also been proven on a number of challenging examples. The InterEvDock3 web interface is available at http://bioserv.rpbs.univ-paris-diderot.fr/services/InterEvDock3/.

An information gain-based approach for evaluating protein structure models.

For three decades now, knowledge-based scoring functions that operate through the "potential of mean force" (PMF) approach have continuously proven useful for studying protein structures. Although these statistical potentials are not to be confused with their physics-based counterparts of the same name-i.e. PMFs obtained by molecular dynamics simulations-their particular success in assessing the native-like character of protein structure predictions has lead authors to consider the computed scores as approximations of the free energy. However, this physical justification is a matter of controversy since the beginning. Alternative interpretations based on Bayes' theorem have been proposed, but the misleading formalism that invokes the inverse Boltzmann law remains recurrent in the literature. In this article, we present a conceptually new method for ranking protein structure models by quality, which is (i) independent of any physics-based explanation and (ii) relevant to statistics and to a general definition of information gain. The theoretical development described in this study provides new insights into how statistical PMFs work, in comparison with our approach. To prove the concept, we have built interatomic distance-dependent scoring functions, based on the former and new equations, and compared their performance on an independent benchmark of 60,000 protein structures. The results demonstrate that our new formalism outperforms statistical PMFs in evaluating the quality of protein structural decoys. Therefore, this original type of score offers a possibility to improve the success of statistical PMFs in the various fields of structural biology where they are applied. The open-source code is available for download at https://gitlab.rpbs.univ-paris-diderot.fr/src/ig-score.

Probing Protein Interaction Networks by Combining MS-Based Proteomics and Structural Data Integration.

Protein-protein interactions play a major role in the molecular machinery of life, and various techniques such as AP-MS are dedicated to their identification. However, those techniques return lists of proteins devoid of organizational structure, not detailing which proteins interact with which others. Proposing a hierarchical view of the interactions between the members of the flat list becomes highly tedious for large data sets when done by hand. To help hierarchize this data, we introduce a new bioinformatics protocol that integrates information of the multimeric protein 3D structures available in the Protein Data Bank using remote homology detection, as well as information related to Short Linear Motifs and interaction data from the BioGRID. We illustrate on two unrelated use-cases of different complexity how our approach can be useful to decipher the network of interactions hidden in the list of input proteins, and how it provides added value compared to state-of-the-art resources such as Interactome3D or STRING. Particularly, we show the added value of using homology detection to distinguish between orthologs and paralogs, and to distinguish between core obligate and more facultative interactions. We also demonstrate the potential of considering interactions occurring through Short Linear Motifs.

DaReUS-Loop: a web server to model multiple loops in homology models.

Loop regions in protein structures often have crucial roles, and they are much more variable in sequence and structure than other regions. In homology modeling, this leads to larger deviations from the homologous templates, and loop modeling of homology models remains an open problem. To address this issue, we have previously developed the DaReUS-Loop protocol, leading to significant improvement over existing methods. Here, a DaReUS-Loop web server is presented, providing an automated platform for modeling or remodeling loops in the context of homology models. This is the first web server accepting a protein with up to 20 loop regions, and modeling them all in parallel. It also provides a prediction confidence level that corresponds to the expected accuracy of the loops. DaReUS-Loop facilitates the analysis of the results through its interactive graphical interface and is freely available at http://bioserv.rpbs.univ-paris-diderot.fr/services/DaReUS-Loop/.

MyPMFs: a simple tool for creating statistical potentials to assess protein structural models.

Evaluating the model quality of protein structures that evolve in environments with particular physicochemical properties requires scoring functions that are adapted to their specific residue compositions and/or structural characteristics. Thus, computational methods developed for structures from the cytosol cannot work properly on membrane or secreted proteins. Here, we present MyPMFs, an easy-to-use tool that allows users to train statistical potentials of mean force (PMFs) on the protein structures of their choice, with all parameters being adjustable. We demonstrate its use by creating an accurate statistical potential for transmembrane protein domains. We also show its usefulness to study the influence of the physical environment on residue interactions within protein structures. Our open-source software is freely available for download at https://github.com/bibip-impmc/mypmfs.

KNOTTIN: the database of inhibitor cystine knot scaffold after 10 years, toward a systematic structure modeling.

Knottins, or inhibitor cystine knots (ICKs), are ultra-stable miniproteins with multiple applications in drug design and medical imaging. These widespread and functionally diverse proteins are characterized by the presence of three interwoven disulfide bridges in their structure, which form a unique pseudoknot. Since 2004, the KNOTTIN database (www.dsimb.inserm.fr/KNOTTIN/) has been gathering standardized information about knottin sequences, structures, functions and evolution. The website also provides access to bibliographic data and to computational tools that have been specifically developed for ICKs. Here, we present a major upgrade of our database, both in terms of data content and user interface. In addition to the new features, this article describes how KNOTTIN has seen its size multiplied over the past ten years (since its last publication), notably with the recent inclusion of predicted ICKs structures. Finally, we report how our web resource has proved usefulness for the researchers working on ICKs, and how the new version of the KNOTTIN website will continue to serve this active community.

TMPL: a database of experimental and theoretical transmembrane protein models positioned in the lipid bilayer.

Knowing the position of protein structures within the membrane is crucial for fundamental and applied research in the field of molecular biology. Only few web resources propose coordinate files of oriented transmembrane proteins, and these exclude predicted structures, although they represent the largest part of the available models. In this article, we present TMPL (http://www.dsimb.inserm.fr/TMPL/), a database of transmembrane protein structures (α-helical and ß-sheet) positioned in the lipid bilayer. It is the first database to include theoretical models of transmembrane protein structures, making it a large repository with more than 11 000 entries. The TMPL database also contains experimentally solved protein structures, which are available as either atomistic or coarse-grained models. A unique feature of TMPL is the possibility for users to update the database by uploading, through an intuitive web interface, the membrane assignments they can obtain with our recent OREMPRO web server.

An ambiguity principle for assigning protein structural domains.

Ambiguity is the quality of being open to several interpretations. For an image, it arises when the contained elements can be delimited in two or more distinct ways, which may cause confusion. We postulate that it also applies to the analysis of protein three-dimensional structure, which consists in dividing the molecule into subunits called domains. Because different definitions of what constitutes a domain can be used to partition a given structure, the same protein may have different but equally valid domain annotations. However, knowledge and experience generally displace our ability to accept more than one way to decompose the structure of an object-in this case, a protein. This human bias in structure analysis is particularly harmful because it leads to ignoring potential avenues of research. We present an automated method capable of producing multiple alternative decompositions of protein structure (web server and source code available at www.dsimb.inserm.fr/sword/). Our innovative algorithm assigns structural domains through the hierarchical merging of protein units, which are evolutionarily preserved substructures that describe protein architecture at an intermediate level, between domain and secondary structure. To validate the use of these protein units for decomposing protein structures into domains, we set up an extensive benchmark made of expert annotations of structural domains and including state-of-the-art domain parsing algorithms. The relevance of our "multipartitioning" approach is shown through numerous examples of applications covering protein function, evolution, folding, and structure prediction. Finally, we introduce a measure for the structural ambiguity of protein molecules.

ORION: a web server for protein fold recognition and structure prediction using evolutionary hybrid profiles.

Protein structure prediction based on comparative modeling is the most efficient way to produce structural models when it can be performed. ORION is a dedicated webserver based on a new strategy that performs this task. The identification by ORION of suitable templates is performed using an original profile-profile approach that combines sequence and structure evolution information. Structure evolution information is encoded into profiles using structural features, such as solvent accessibility and local conformation -with Protein Blocks-, which give an accurate description of the local protein structure. ORION has recently been improved, increasing by 5% the quality of its results. The ORION web server accepts a single protein sequence as input and searches homologous protein structures within minutes. Various databases such as PDB, SCOP and HOMSTRAD can be mined to find an appropriate structural template. For the modeling step, a protein 3D structure can be directly obtained from the selected template by MODELLER and displayed with global and local quality model estimation measures. The sequence and the predicted structure of 4 examples from the CAMEO server and a recent CASP11 target from the 'Hard' category (T0818-D1) are shown as pertinent examples. Our web server is accessible at http://www.dsimb.inserm.fr/ORION/.

OREMPRO web server: orientation and assessment of atomistic and coarse-grained structures of membrane proteins.

UNLABELLED: : The experimental determination of membrane protein orientation within the lipid bilayer is extremely challenging, such that computational methods are most often the only solution. Moreover, obtaining all-atom 3D structures of membrane proteins is also technically difficult, and many of the available data are either experimental low-resolution structures or theoretical models, whose structural quality needs to be evaluated. Here, to address these two crucial problems, we propose OREMPRO, a web server capable of both (i) positioning α-helical and ß-sheet transmembrane domains in the lipid bilayer and (ii) assessing their structural quality. Most importantly, OREMPRO uses the sole alpha carbon coordinates, which makes it the only web server compatible with both high and low structural resolutions. Finally, OREMPRO is also interesting in its ability to process coarse-grained protein models, by using coordinates of backbone beads in place of alpha carbons. AVAILABILITY AND IMPLEMENTATION: http://www.dsimb.inserm.fr/OREMPRO/ CONTACT: : guillaume.postic@univ-paris-diderot.fr or jean-christophe.gelly@univ-paris-diderot.fr SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Membrane positioning for high- and low-resolution protein structures through a binary classification approach.

The critical importance of algorithms for orienting proteins in the lipid bilayer stems from the extreme difficulty in obtaining experimental data about the membrane boundaries. Here, we present a computational method for positioning protein structures in the membrane, based on the sole alpha carbon coordinates and, therefore, compatible with both high and low structural resolutions. Our algorithm follows a new and simple approach, by treating the membrane assignment problem as a binary classification. Compared with the state-of-the-art algorithms, our method achieves similar accuracy, while being faster. Finally, our open-source software is also capable of processing coarse-grained models of protein structures.