Search bioRxiv⌕ Search

Biology subjects

Cazals, F.

Publications and source records attributed to Cazals, F..

14 recordsLinked to original sources

Beyond Ramachandran distributions: quantifying secondary structure effects on amino acids and their pairs in the full torsional space

The Ramachandran diagram has long served for understanding protein secondary structure elements (SSEs), despite the multitude of factors contributing to their occurrence. Starting from recentlyintroduced circula-based multivariate torsion-angle distribution (CBMD) mixture models -- accommodating covariance structure in the full torsion-angle space of amino acids, we define continuous densities for the 20 amino acids and 400 amino-acid pairs in dimension up to 14, conditioned by SSE labels. Projecting these higher-dimensional distributions onto the classical Ramachandran diagram reveals how secondary structures in the protein universe emerge from amino-acid-dependent conformational preferences reflecting influences beyond backbone dihedrals alone. Our analysis links the traditional geometric description of local protein structure to modern statistical models of the full conformational space of amino acids and amino-acidpairs, while providing a framework for generating protein conformations consistent with any given secondary structure environment -- a feature that remains difficult to enforce explicitly in current AI-based generative models.

bioinformatics↗

Nanobodies versus canonical antibodies: an updated comparison of their binding modes

Heavy-chain only antibodies, produced by the adaptive immune systems of camelids and cartilaginous fish, complement canonical antibodies comprising both heavy and light chain variable domains. Using an integrated interface model that unifies interfacial atoms--including solvent molecules, contacts, buried surface areas, and interface curvature measures, we shed light on two aspects of antibody binding that have so far remained elusive when comparing single domain (SdAb) and double domain (DdAb) antibodies. First, contrary to previous reports of smaller SdAb interfaces, we show that SdAb achieve an interface size comparable to that of DdAb despite using a single variable domain and fewer interface residues, a consequence of a geometric pattern driven by convexity and curvature effects. Second, we show that SdAb exhibit a broader diversity of binding modes than previously reported, with a prominent role played by FR regions. Finally, we discuss the thermodynamic implications of these findings for the design of high-affinity single domain antibodies, with particular relevance to protein engineering and design.

bioinformatics↗

Fold or flop: quality assessment of AlphaFold predictions on whole proteomes

MotivationReliability of AlphaFold2 predictions is mainly assessed using the predicted Local Distance Difference Test (pLDDT). For model organisms, 30-40% of residues fall into the low-confidence pLDDT range. Moreover, pLDDT sometimes fails to flag physically implausible structures. This raises two questions: can more robust reliability indicators be identified, and do unreliable predictions share common structural or biophysical features? ResultsWe characterize protein structures through histograms of per-residue neighbor counts, and use the Wasserstein principal component analysis to define the arity map, and lightweight and informative 2D embedding of proteins in a dataset. Using AlphaFold-DB, we show that the arity map reveals three structurally and biophysically distinct populations (well-folded proteins, intrinsically disordered proteins, and physically implausible predictions). We also use our packing based encoding at the residue level to define abstraqt (Arity-Based STRuctural Arrangement Quality assessmenT), a per-residue scoring function complementing the pLDDT, assigning low scores to hallucinated helices and distorted beta strands while correctly scoring native like predictions. AvailabilityThe code to compute arity maps is available within the Structural Bioinformatics Library. See: AlphaFold analysis, and also Documentation, Applications, Installation guide. The code and data for rerunning analyses are made available from AlphaFold analysis, and Data.

bioinformatics↗

Characterizing the fragmentation of AlphaFold predictions

The Nobel prize winning program AlphaFold2 computes plausible structures of (well) folded proteins. The main quality assessment is based on the predicted Local Distance Difference Test (pLDDT), a per amino acid confidence score. To enhance quality assessment, we provide novel quantitative measures to identify coherent amino acid (a.a.) stretches along the sequence in terms of pLDDT values. These constructions, grounded in standard techniques from topological data analysis and combinatorics, provide a canonical framework for identifying regions along the protein backbone and analyzing their properties, such as their propensity for disorder and their consistency with a null model. The outcome of our analysis can readily be used to select reliable regions/domains within proteins whose pLDDT values span the entire pLDDT range.

bioinformatics↗

AlphaFold predictions on whole genomes at a glance

For model organisms, AlphaFold predictions show that 30% to 40% of amino acids have a (very) low pLDDT confidence score. This observation, combined with the methods high complexity, commands a systematic analysis of AlphaFold predictions on whole genomes. Consequently, using whole-genome predictions, we provide a coherent analysis on packing properties, pLDDT values, and their relationship with intrinsically disordered regions (IDRs). Our contributions are of two kinds. First, we introduce simple and explainable geometrical and topological statistics characterizing predictions. Second, we investigate four key biophysical and biological questions: (i) the clustering of AlphaFold predictions on whole genomes, (ii) the identification of high/low quality predicted domains, (iii) false positive/negative AlphaFold predictions with respect to IDRs, and (iv) the fragmentation of the polypeptide chain in terms of pLDDT values. Altogether, our analysis provide novel insights into AlphaFold predictions across whole genomes, further enhancing the confidence assessment of the models.

bioinformatics↗

Simpler protein domain identification using spectral clustering

The decomposition of a biomolecular complex into domains is an important step to investigate biological functions and ease structure determination. A successful approach to do so is the SPECTRUS algorithm, which provides a segmentation based on spectral clustering applied to a graph coding interatomic fluctuations derived from an elastic network model. We present SPECTRALDOM, which makes three straightforward and useful additions to SPECTRUS. For single structures, we show that high quality partitionings can be obtained from a graph Laplacian derived from pairwise interactions-without normal modes. For sets of homologous structures, we introduce a Multiple Sequence Alignment mode, exploiting both the sequence based information (MSA) and the geometric information embodied in experimental structures. Finally, we propose to analyse the clusters/- domains delivered using the so-called D-family-matching algorithm, which establishes a correspondence between domains yielded by two decompositions, and can be used to handle fragmentation issues. Our domains compare favorably to those of the original SPECTRUS, and those of the deep learning based method Chainsaw. Using two complex cases, we show in particular that SPECTRALDOM is the only method handling complex conformational changes involving several sub-domains. Finally, a comparison of SPECTRALDOM and Chainsaw on the manually curated domain classification ECOD as a reference shows that high quality domains are obtained without using any evolutionary related piece of information. SPECTRALDOM is provided in the Structural Bioinformatics Library, see http://sbl.inria.fr and https://sbl.inria.fr/doc/Spectral_domain_explorer-user-manual.html.

bioinformatics↗

Geometric constraints within tripeptides and the existence of tripeptide reconstructions

Designing movesets providing high quality protein conformations remains a hard problem, especially when it comes to deform a long protein backbone segment, and a key building block to do so is the so-called tripeptide loop closure (TLC). Consider a tripeptide whose first and last segments (N1C;1 and C;3C3) are fixed, and so are all internal coordinates except the six {({phi},{psi} )}i=1,2,3 dihedral angles associated to the three C carbons. Under these conditions, the TLC algorithm provides all possible values for these six dihedral angles-there exists at most 16 solutions. TLC moves atoms up to ~ 5[A] in one step and retains low energy conformations, whence its pivotal role to design move sets sampling protein loop conformations. In this work, we relax the previous constraints, allowing the last segment (C;3C3) to freely move in 3D space-or equivalently in a 5D configuration space. We exhibit necessary geometric constraints in this 5D space for TLC to admit solutions. Our analysis provides key insights on the geometry of solutions for TLC. Most importantly, when using TLC to sample loop conformations based on m consecutive tripeptides along a protein backbone, we obtain an exponential gain in the volume of the 5m-dimensional configuration space to be explored.

bioinformatics↗

Enhanced conformational exploration of protein loops using a global parameterization of the backbone geometry

Flexible loops are paramount to protein functions, with action modes ranging from localized dynamics contributing to the free energy of the system, to large amplitude conformational changes accounting for the repositioning whole secondary structure elements or protein domains. However, generating diverse and low energy loops remains a difficult problem. This work introduces a novel paradigm to sample loop conformations, in the spirit of the Hit-and- Run (HAR) Markov chain Monte Carlo technique. The algorithm uses a decomposition of the loop into tripeptides, and a novel characterization of necessary conditions for Tripeptide Loop Closure to admit solutions. Denoting m the number of tripeptides, the algorithm works in an angular space of dimension 12m. In this space, the hyper-surfaces associated with the aforementioned necessary conditions are used to run a HAR-like sampling technique. On classical loop cases up to 15 amino acids, our parameter free method compares favorably to previous work, generating more diverse conformational ensembles. We also report experiments on a 30 amino acids long loop, a size not processed in any previous work.

bioinformatics↗

Tripeptide loop closure: a detailed study of reconstructions based on Ramachandran distributions

Tripeptide loop closure (TLC) is a standard procedure to reconstruct protein backbone conformations, by solving a zero dimensional polynomial system yielding up to 16 solutions. In this work, we first show that multiprecision is required in a TLC solver to guarantee the existence and the accuracy of solutions. We then compare solutions yielded by the TLC solver against tripeptides from the Protein Data Bank. We show that these solutions are geometrically diverse (up to 3[A] RMSD with respect to the data), and sound in terms of potential energy. Finally, we compare Ramachandran distributions of data and reconstructions for the three amino acids. The distribution of reconstructions in the second angular space ({varphi}2,{psi} 2) stands out, with a rather uniform distribution leaving a central void. We anticipate that these insights, coupled to our robust implementation in the Structural Bioinformatics Library (https://sbl.inria.fr/doc/Tripeptide_loop_closure-user-manual.html), will boost the interest of TLC for structural modeling in general, and the generation of conformations of flexible loops in particular.

bioinformatics↗

Gene prioritization based on random walks with restarts and absorbing states, to define gene sets regulating drug pharmacodynamics from single-cell analyses

Prioritizing genes for their role in drug sensitivity, is an important step in understanding drugs mechanisms of action and discovering new molecular targets for co-treatment. To formalize this problem, we consider two sets of genes X and P respectively composing the predictive gene signature of sensitivity to a drug and the genes involved in its mechanism of action, as well as a protein interaction network (PPIN) containing the products of X and P as nodes. We introduce Genetrank, a method to prioritize the genes in X for their likelihood to regulate the genes in P. Genetrank uses asymmetric random walks with restarts, absorbing states, and a suitable renormalization scheme. Using novel so-called saturation indices, we show that the conjunction of absorbing states and renormalization yields an exploration of the PPIN which is much more progressive than that afforded by random walks with restarts only. Using MINT as underlying network, we apply Genetrank to a predictive gene signature of cancer cells sensitivity to tumor-necrosis-factor-related apoptosis-inducing ligand (TRAIL), performed in single-cells. Our ranking provides biological insights on drug sensitivity and a gene set considerably enriched in genes regulating TRAIL pharmacodynamics when compared to the most significant differentially expressed genes obtained from a statistical analysis framework alone. We also introduce gene expression radars, a visualization tool to assess all pairwise interactions at a glance. Genetrank is made available in the Structural Bioinformatics Library (https://sbl.inria.fr/doc/Genetrank-user-manual.html). It should prove useful for mining gene sets in conjunction with a signaling pathway, whenever other approaches yield relatively large sets of genes.

systems biology↗

Boosting the analysis of protein interfaces with Multiple Interface String Alignment: illustration on the spikes of coronaviruses

We introduce Multiple Interface String Alignment (MISA), a visualization tool to display coherently various sequence and structure based statistics at protein-protein interfaces (SSE elements, buried surface area, {Delta}ASA, B factor values, etc). The amino-acids supporting these annotations are obtained from Voronoi interface models. The benefit of MISA is to collate annotated sequences of (homologous) chains found in different biological contexts i.e. bound with different partners or unbound. The aggregated views MISA/SSE, MISA/BSA, MISA/{Delta} ASAetc make it trivial to identify commonalities and differences between chains, to infer key interface residues, and to understand where conformational changes occur upon binding. As such, they should prove of key relevance for knowledge based annotations of protein databases such as the Protein Data Bank. Illustrations are provided on the receptor binding domain (RBD) of coronaviruses, in complex with their cognate partner or (neutralizing) antibodies. MISA computed with a minimal number of structures complement and enrich findings previously reported. The corresponding package is available from the Structural Bioinformatics Library (http://sbl.inria.fr)

bioinformatics↗

Hybrid sequence-structure based HMM models leverage theidentification of homologous proteins: the example of class II fusion

We present a sequence-structure based method characterizing a set of functionally related proteins exhibiting low sequence identity and loose structural conservation. Given a (small) set of structures, our method consists of three main steps. First, pairwise structural alignments are combined with multi-scale geometric analysis to produce structural motifs i.e. regions structurally more conserved than the whole structures. Second, the sub-sequences of the motifs are used to build profile hidden Markov models (HMM) biased towards the structurally conserved regions. Third, these HMM are used to retrieve from UniProtKB proteins harboring signatures compatible with the function studied, in a bootstrap fashion.\n\nWe apply these hybrid HMM to investigate two questions related to class II fusion proteins, an especially challenging class since known structures exhibit low sequence identity (less than 15%) and loose structural similarity (of the order of 15[A] in lRMSD). In a first step, we compare the performances of our hybrid HMM against those of sequence based HMM. Using various learning sets, we show that both classes of HMM retrieve unique species. The number of unique species reported by both classes of methods are comparable, stressing the novelty brought by our hybrid models. In a second step, we use our models to identify 17 plausible HAP2-GSC1 candidate sequences in 10 different drosophila melanogaster species. These models are not identified by the PF[A]M family HAP2-GCS1 (PF10699), stressing the ability of our structural motifs to capture signals more subtle than whole Pfam domains.\n\nIn a more general setting, our method should be of interest for all cases functional families with low sequence identity and loose structural conservation.\n\nOur software tools are available from the FunChaT package of the Structural Bioinformatics Library (http://sbl.inria.fr).

bioinformatics↗

Multiscale analysis of structurally conserved motifs

This work develops a generic framework to perform a multiscale structural analysis of two structures (homologous proteins, conformations) undergoing conformational changes. Practically, given a seed structural alignment, we identify structural motifs with a hierarchical structure, characterized by three unique properties. First, the hierarchical structure sheds light on the trade-off between size and flexibility. Second, motifs can be combined to perform an overall comparison of the input structures in terms of combined RMSD - an improvement over the classical least RMSD. Third, motifs can be used to seed iterative aligners, and to design hybrid sequence-structure profile HMM characterizing protein families.\n\nFrom the methods standpoint, our framework is reminiscent from the bootstrap and combines concepts from rigidity analysis (distance difference matrices), graph theory, computational geometry (space filling diagrams), and topology (topological persistence).\n\nOn challenging cases (class II fusion proteins, flexible molecules) we illustrate the ability of our tools to localize conformational changes, shedding light of commonalities of structures which would otherwise appear as radically different.\n\nOur tools are available within the Structural Bioinformatics Library (http://sbl.inria.fr). We anticipate that they will be of interest to perform structural comparisons at large, and for remote homology detection.

bioinformatics↗

Characterizing molecular flexibility by combining lRMSD measures

The root mean square deviation (RMSD) and the least RMSD are two widely used similarity measures in structural bioinformatics. Yet, they stem from global comparisons, possibly obliterating locally conserved motifs. We correct these limitations with the so-called combined RMSD, which mixes independent lRMSD measures, each computed with its own rigid motion. The combined RMSD can be used to compare (quaternary) structures based on motifs defined from the sequence (domains, SSE), or to compare structures based on structural motifs yielded by local structural alignment methods.\n\nWe illustrate the benefits of combined RMSD over the usual RMSD on three problems, namely (i) the analysis of conformational changes based on combined RMSD of rigid structural motifs (case study: a class II fusion protein), (ii) the calculation of structural phylogenies (case study: class II fusion proteins), and (iii) the assignment of quaternary structures for hemoglobin. Using these, we argue that the combined RMSD is a tool a choice to perform positive and negative discrimination of degree of freedom, with applications to the design of move sets and collective coordinates.\n\nCombined RMSD are available within the Structural Bioinformatics Library (http://sbl.inria.fr).

bioinformatics↗