Caretta - A multiple protein structure alignment and feature extraction suite

Faithful Interpretation of Protein Structures through Weighted Persistent Homology Improves Evolutionary Distance Estimation

Phylogenetic inference is mainly based on sequence analysis and requires reliable alignments. This can be challenging, especially when sequences are highly divergent. In this context, the use of three-dimensional protein structures is a promising alternative. In a recent study, we introduced an original topological data analysis method based on persistent homology to estimate the evolutionary distances from structures. The method was successfully tested on 518 protein families representing 22,940 predicted structures. However, as anticipated, the reliability of the estimated evolutionary distances was impacted by the quality of the predicted structures and the presence of indels in the proteins. This paper introduces a new topological descriptor, called bio-topological marker (BTM), which provides a more faithful description of the structures, a topological analysis for estimating evolutionary distances from BTMs, and a new weight-filtering method adapted to protein structures. These new developments significantly improve the estimation of evolutionary distances and phylogenies inferred from structures.

Persistent homology reveals strong phylogenetic signal in 3D protein structures

Changes that occur in proteins over time provide a phylogenetic signal that can be used to decipher their evolutionary history and the relationships between organisms. Sequence comparison is the most common way to access this phylogenetic signal, while those based on 3D structure comparisons are still in their infancy. In this study, we propose an effective approach based on Persistent Homology Theory (PH) to extract the phylogenetic information contained in protein structures. PH provides efficient and robust algorithms for extracting and comparing geometric features from noisy datasets at different spatial resolutions. PH has a growing number of applications in the life sciences, including the study of proteins (e.g. classification, folding). However, it has never been used to study the phylogenetic signal they may contain. Here, using 518 protein families, representing 22,940 protein sequences and structures, from 10 major taxonomic groups, we show that distances calculated with PH from protein structures correlate strongly with phylogenetic distances calculated from protein sequences, at both small and large evolutionary scales. We test several methods for calculating PH distances and propose some refinements to improve their relevance for addressing evolutionary questions. This work opens up new perspectives in evolutionary biology by proposing an efficient way to access the phylogenetic signal contained in protein structures, as well as future developments of topological analysis in the life sciences.

Mutations in the FOXO3 Gene and Their Effects on Meat Traits in Gannan Yaks

The FOXO3 gene, a prominent member of the FOXO family, has been identified as a potential quantitative trait locus for muscle atrophy and lipid metabolism in livestock. It is also considered a promising candidate gene for meat quality traits such as Warner-Bratzler shear force (WBSF) and water holding capacity (WHC). The aim of this study was to identify sequence mutations in the FOXO3 gene of yaks and to analyze the association of genotypes and haplotypes with meat traits such as WBSF and WHC. Quantitative reverse-transcriptase PCR (RT-qPCR) was applied to determine the expression levels of FOXO3 in yak tissues, with the results revealing a high expression in the yak longissimus dorsi muscle. Exons of the FOXO3 gene were then sequenced in 572 yaks using hybrid pool sequencing. Five single nucleotide polymorphisms were identified. Additionally, four effective haplotypes and four combined haplotypes were constructed. Two mutations of the FOXO3 gene, namely C>G at exon g.636 and A>G at exon g.1296, were associated with cooked meat percentage (CMP) (p < 0.05) and WBSF (p < 0.05), respectively. Furthermore, the WBSF of the H2H3 haplotype combination was significantly lower than that of other combinations (p < 0.05). The findings of this study suggest that genetic variations in FOXO3 could be a promising biomarker for improving yak meat traits.

DCAlign v1.0: aligning biological sequences using co-evolution models and informed priors

SUMMARY

DCAlign is a new alignment method able to cope with the conservation and the co-evolution signals that characterize the columns of multiple sequence alignments of homologous sequences. However, the pre-processing steps required to align a candidate sequence are computationally demanding. We show in v1.0 how to dramatically reduce the overall computing time by including an empirical prior over an informative set of variables mirroring the presence of insertions and deletions.

AVAILABILITY AND IMPLEMENTATION

DCAlign v1.0 is implemented in Julia and it is fully available at https://github.com/infernet-h2020/DCAlign.

Abalign: a comprehensive multiple sequence alignment platform for B-cell receptor immune repertoires

The utilization of high-throughput sequencing (HTS) for B-cell receptor (BCR) immune repertoire analysis has become widespread in the fields of adaptive immunity and antibody drug development. However, the sheer volume of sequences generated by these experiments presents a challenge in data processing. Specifically, multiple sequence alignment (MSA), a critical aspect of BCR analysis, remains inadequate for handling massive BCR sequencing data and lacks the ability to provide immunoglobulin-specific information. To address this gap, we introduce Abalign, a standalone program specifically designed for ultrafast MSA of BCR/antibody sequences. Benchmark tests demonstrate that Abalign achieves comparable or even better accuracy than state-of-the-art MSA tools, and shows remarkable advantages in terms of speed and memory consumption, reducing the time required for high-throughput analysis from weeks to hours. In addition to its alignment capabilities, Abalign offers a broad range of BCR analysis features, including extracting BCRs, constructing lineage trees, assigning VJ genes, analyzing clonotypes, profiling mutations, and comparing BCR immune repertoires. With its user-friendly graphic interface, Abalign can be easily run on personal computers instead of computing clusters. Overall, Abalign is an easy-to-use and effective tool that enables researchers to analyze massive BCR/antibody sequences, leading to new discoveries in the field of immunoinformatics. The software is freely available at http://cao.labshare.cn/abalign/.

Protein remote homology recognition using local and global structural sequence alignment

Protein Remote Homology and fold Recognition (PRHR) is the most crucial task to predict the protein patterns. To achieve this task, Sequence-Order Frequency Matrix-Sampling and Deep learning with Smith-Waterman (SOFM-SDSW) were designed using large-scale Protein Sequences (PSs), which take more time to determine the high-dimensional attributes. Also, it was ineffective since the SW was only applied for local alignment, which cannot find the most matches between the PSs. Hence, in this manuscript, a rapid semi-global alignment algorithm called SOFM-SD-GlobalSW (SOFM-SDGSW) is proposed that facilitates the affine-gap scoring and uses sequence similarity to align the PSs. The major aim of this paper is to enhance the alignment of SW algorithm in both locally and globally for PRHR. In this algorithm, the Maximal Exact Matches (MEMs) are initially obtained by the bit-level parallelism rather than to align the individual characters. After that, a subgroup of MEMs is obtained to determine the global Alignment Score (AS) using the new adaptive programming scheme. Also, the SW local alignment scheme is used to determine the local AS. Then, both local and global ASs are combined to produce a final AS. Further, this resultant AS is considered to train the Support Vector Machine (SVM) classifier to recognize the PRH and folds. Finally, the test results reveal the SOFM-SDGSW algorithm on SCOP 1.53, SCOP 1.67 and Superfamily databases attains an ROC of 0.97, 0.941 and 0.938, respectively, as well as, an ROC50 of 0.819, 0.846 and 0.86, respectively compared to the conventional PRHR algorithms.

Fast protein structure comparison through effective representation learning with contrastive graph neural networks

Protein structure alignment algorithms are often time-consuming, resulting in challenges for large-scale protein structure similarity-based retrieval. There is an urgent need for more efficient structure comparison approaches as the number of protein structures increases rapidly. In this paper, we propose an effective graph-based protein structure representation learning method, GraSR, for fast and accurate structure comparison. In GraSR, a graph is constructed based on the intra-residue distance derived from the tertiary structure. Then, deep graph neural networks (GNNs) with a short-cut connection learn graph representations of the tertiary structures under a contrastive learning framework. To further improve GraSR, a novel dynamic training data partition strategy and length-scaling cosine distance are introduced. We objectively evaluate our method GraSR on SCOPe v2.07 and a new released independent test set from PDB database with a designed comprehensive performance metric. Compared with other state-of-the-art methods, GraSR achieves about 7%-10% improvement on two benchmark datasets. GraSR is also much faster than alignment-based methods. We dig into the model and observe that the superiority of GraSR is mainly brought by the learned discriminative residue-level and global descriptors. The web-server and source code of GraSR are freely available at www.csbio.sjtu.edu.cn/bioinf/GraSR/ for academic use.

The size and shape of protein structures vary considerably. Accurate protein structure comparison usually relies on structure alignment algorithms. However, superimposing two protein structures is relatively time-consuming, which makes it inappropriate for large-scale protein structure retrieval. Alignment-free algorithms are proposed for efficient protein structure comparison over the last few decades. These algorithms first transform the coordinates of atoms in two proteins to fixed-length vectors. Then, the comparison can be done by measuring the distance or similarity between two vectors, which is much faster than alignment. In this study, we propose a novel protein structure representation method for efficient structure comparison. Compared with other state-of-the-art alignment-free methods, our method achieves better performance on both ranking and multi-class classification tasks due to the powerful representation ability of deep graph neural networks. We dig into the model and observe that the superiority of our method is mainly brought by the learned discriminative residue-level and global descriptors.

Guide tree optimization with genetic algorithm to improve multiple protein 3D-structure alignment

MOTIVATION

With the increasing availability of 3D-data, the focus of comparative bioinformatic analysis is shifting from protein sequence alignments toward more content-rich 3D-alignments. This raises the need for new ways to improve the accuracy of 3D-superimposition.

RESULTS

We proposed guide tree optimization with genetic algorithm (GA) as a universal tool to improve the alignment quality of multiple protein 3D-structures systematically. As a proof of concept, we implemented the suggested GA-based approach in popular Matt and Caretta multiple protein 3D-structure alignment (M3DSA) algorithms, leading to a statistically significant improvement of the TM-score quality indicator by up to 220-1523% on 'SABmark Superfamilies' (in 49-77% of cases) and 'SABmark Twilight' (in 59-80% of cases) datasets. The observed improvement in collections of distant homologies highlights the potentials of GA to optimize 3D-alignments of diverse protein superfamilies as one plausible tool to study the structure-function relationship.

AVAILABILITY AND IMPLEMENTATION

The source codes of patched gaCaretta and gaMatt programs are available open-access at https://github.com/n-canter/gamaps.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

A roadmap for metagenomic enzyme discovery

Covering: up to 2021Metagenomics has yielded massive amounts of sequencing data offering a glimpse into the biosynthetic potential of the uncultivated microbial majority. While genome-resolved information about microbial communities from nearly every environment on earth is now available, the ability to accurately predict biocatalytic functions directly from sequencing data remains challenging. Compared to primary metabolic pathways, enzymes involved in secondary metabolism often catalyze specialized reactions with diverse substrates, making these pathways rich resources for the discovery of new enzymology. To date, functional insights gained from studies on environmental DNA (eDNA) have largely relied on PCR- or activity-based screening of eDNA fragments cloned in fosmid or cosmid libraries. As an alternative, shotgun metagenomics holds underexplored potential for the discovery of new enzymes directly from eDNA by avoiding common biases introduced through PCR- or activity-guided functional metagenomics workflows. However, inferring new enzyme functions directly from eDNA is similar to searching for a 'needle in a haystack' without direct links between genotype and phenotype. The goal of this review is to provide a roadmap to navigate shotgun metagenomic sequencing data and identify new candidate biosynthetic enzymes. We cover both computational and experimental strategies to mine metagenomes and explore protein sequence space with a spotlight on natural product biosynthesis. Specifically, we compare in silico methods for enzyme discovery including phylogenetics, sequence similarity networks, genomic context, 3D structure-based approaches, and machine learning techniques. We also discuss various experimental strategies to test computational predictions including heterologous expression and screening. Finally, we provide an outlook for future directions in the field with an emphasis on meta-omics, single-cell genomics, cell-free expression systems, and sequence-independent methods.

An Application of the Eigenproblem for Biochemical Similarity

Protein alignment finds its application in refining results of sequence alignment and understanding protein function. A previous study aligned single molecules, making use of the minimization of sums of the squares of eigenvalues, obtained for the antisymmetric Cartesian coordinate distance matrices Dx and Dy. This is used in our program to search for similarities between amino acids by comparing the sums of the squares of eigenvalues associated with the Dx, Dy, and Dz distance matrices. These matrices are obtained by removing atoms that could lead to low similarity. Candidates are aligned, and trilateration is used to attach all previously striped atoms. A TM-score is the scoring function that chooses the best alignment from supplied candidates. Twenty essential amino acids that take many forms in nature are selected for comparison. The correct alignment is taken into account most of the time by the alignment algorithm. It was numerically detected by the TM-score 70% of the time, on average, and 15% more cases with close scores can be easily distinguished by human observation.

DAMA: a method for computing multiple alignments of protein structures using local structure descriptors

MOTIVATION

The well-known fact that protein structures are more conserved than their sequences forms the basis of several areas of computational structural biology. Methods based on the structure analysis provide more complete information on residue conservation in evolutionary processes. This is crucial for the determination of evolutionary relationships between proteins and for the identification of recurrent structural patterns present in biomolecules involved in similar functions. However, algorithmic structural alignment is much more difficult than multiple sequence alignment. This study is devoted to the development and applications of DAMA-a novel effective environment capable to compute and analyze multiple structure alignments.

RESULTS

DAMA is based on local structural similarities, using local 3D structure descriptors and thus accounts for nearest-neighbor molecular environments of aligned residues. It is constrained neither by protein topology nor by its global structure. DAMA is an extension of our previous study (DEDAL) which demonstrated the applicability of local descriptors to pairwise alignment problems. Since the multiple alignment problem is NP-complete, an effective heuristic approach has been developed without imposing any artificial constraints. The alignment algorithm searches for the largest, consistent ensemble of similar descriptors. The new method is capable to capture most of the biologically significant similarities present in canonical test sets and is discriminatory enough to prevent the emergence of larger, but meaningless, solutions. Tests performed on the test sets, including protein kinases, demonstrate DAMA's capability of identifying equivalent residues, which should be very useful in discovering the biological nature of proteins similarity. Performance profiles show the advantage of DAMA over other methods, in particular when using a strict similarity measure QC, which is the ratio of correctly aligned columns, and when applying the methods to more difficult cases.

AVAILABILITY AND IMPLEMENTATION

DAMA is available online at http://dworkowa.imdik.pan.pl/EP/DAMA. Linux binaries of the software are available upon request.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Systematic Structure-Based Search for Ochratoxin-Degrading Enzymes in Proteomes from Filamentous Fungi

(1) Background: ochratoxins are mycotoxins produced by filamentous fungi with important implications in the food manufacturing industry due to their toxicity. Decontamination by specific ochratoxin-degrading enzymes has become an interesting alternative for the treatment of contaminated food commodities. (2) Methods: using a structure-based approach based on homology modeling, blind molecular docking of substrates and characterization of low-frequency protein motions, we performed a proteome mining in filamentous fungi to characterize new enzymes with potential ochratoxinase activity. (3) Results: the proteome mining results demonstrated the ubiquitous presence of fungal binuclear zinc-dependent amido-hydrolases with a high degree of structural homology to the already characterized ochratoxinase from Aspergillus niger. Ochratoxinase-like enzymes from ochratoxin-producing fungi showed more favorable substrate-binding pockets to accommodate ochratoxins A and B. (4) Conclusions: filamentous fungi are an interesting and rich source of hydrolases potentially capable of degrading ochratoxins, and could be used for the detoxification of diverse food commodities.

Bingham deep neural and oppositional fish swarm optimized protein structure prediction

It is familiar that essential proteins take part in managing cellular activities in living organisms. Moreover, protein structure prediction from its amino acid sequence is advantageous to the comprehending of cellular functions. Formerly, several essential protein prediction methods have been proposed. However, those existing prediction methods were not satisfactory because to low sensitivity to imbalance characteristics. To address this issue, this paper presents a novel secondary protein structure prediction method, called, Bingham Deep Convolutional-based Oppositional Artificial Fish Optimized (BDC-OAFO). First, a protein structure identification framework, called, Bingham Distributed Deep Convolutional (BDDC) is designed to identify the essential proteins by eliminating the imbalanced learning issue. Next, secondary structure prediction framework, called, Oppositional Artificial Fish Swarm Optimization is proposed that obtain precise prediction results. Then, predicting secondary protein structure by emulating three biological behaviors of artificial fishes, including foraging behavior, following behavior, swarming behavior in which process, proximal count, oppositional function and Gaussian function are utilized. To evaluate the performance of BDC-OAFO method, we conduct experiments on Protein Data Bank dataset the experimental results show that our method BDC-OAFO achieves a better performance for identifying essential proteins and precise prediction in comparison with several other well-known prediction methods, which confirms the significance of BDC-OAFO.Communicated by Ramaswamy H. Sarma.

Bioinformatic analysis of subfamily-specific regions in 3D-structures of homologs to study functional diversity and conformational plasticity in protein superfamilies

Local 3D-structural differences in homologous proteins contribute to functional diversity observed in a superfamily, but so far received little attention as bioinformatic analysis was usually carried out at the level of amino acid sequences. We have developed Zebra3D - the first-of-its-kind bioinformatic software for systematic analysis of 3D-alignments of protein families using machine learning. The new tool identifies subfamily-specific regions (SSRs) - patterns of local 3D-structure (i.e. single residues, loops, or secondary structure fragments) that are spatially equivalent within families/subfamilies, but are different among them, and thus can be associated with functional diversity and function-related conformational plasticity. Bioinformatic analysis of protein superfamilies by Zebra3D can be used to study 3D-determinants of catalytic activity and specific accommodation of ligands, help to prepare focused libraries for directed evolution or assist development of chimeric enzymes with novel properties by exchange of equivalent regions between homologs, and to characterize plasticity in binding sites. A companion Mustguseal web-server is available to automatically construct a 3D-alignment of functionally diverse proteins, thus reducing the minimal input required to operate Zebra3D to a single PDB code. The Zebra3D + Mustguseal combined approach provides the opportunity to systematically explore the value of SSRs in superfamilies and to use this information for protein design and drug discovery. The software is available open-access at https://biokinet.belozersky.msu.ru/Zebra3D.

Comparative host-coronavirus protein interaction networks reveal pan-viral disease mechanisms

The COVID-19 pandemic, caused by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), is a grave threat to public health and the global economy. SARS-CoV-2 is closely related to the more lethal but less transmissible coronaviruses SARS-CoV-1 and Middle East respiratory syndrome coronavirus (MERS-CoV). Here, we have carried out comparative viral-human protein-protein interaction and viral protein localization analyses for all three viruses. Subsequent functional genetic screening identified host factors that functionally impinge on coronavirus proliferation, including Tom70, a mitochondrial chaperone protein that interacts with both SARS-CoV-1 and SARS-CoV-2 ORF9b, an interaction we structurally characterized using cryo-electron microscopy. Combining genetically validated host factors with both COVID-19 patient genetic data and medical billing records identified molecular mechanisms and potential drug treatments that merit further molecular and clinical study.