Search bioRxiv⌕ Search

bioRxiv · 10.1101/2022.07.26.501607

CGAN-Cmap: protein contact map prediction using deep generative adversarial neural networks

Abstract

Protein contact maps represent spatial pairwise inter-residue interactions, providing a proteins translationally and rotationally invariant topological representation. Accurate contact map prediction has been a critical driving force for improving protein structure prediction, one of computational biologys most challenging problems in the last half-century. While many computational tools have been developed to this end, most fail to predict accurate contact maps for proteins with insufficient homologous protein sequences, and exhibit low accuracy for long-range contacts. To address these limitations, we develop a novel hybrid model, CGAN-Cmap, that uses a generative adversarial neural network embedded with a series of modified squeeze and excitation residual networks. To exploit features of different dimensions, we build the generator of CGAN-Cmap via two parallel modules: sequential and pairwise modules to capture and interpret distance profiles from 1D sequential and 2D pairwise feature maps, respectively, and combine them during the training process to generate the contact map. This novel architecture helps to improve the contact map prediction by surpassing redundant features and encouraging more meaningful ones from 1D and 2D inputs simultaneously. We also introduce a new custom dynamic binary cross-entropy (BCE) as the loss function to extract essential details from feature maps, and thereby address the input imbalance problem for highly sparse long-range contacts in proteins with insufficient numbers of homologous sequences. We evaluate the performance of CGAN-Cmap on the 11th, 12th, 13th, and 14th Critical Assessment of protein Structure Prediction (CASP 11, 12, 13, and 14) and CAMEO test sets. CGAN-Cmap significantly outperforms state-of-the-art models, and in particular, it improves the precision of medium and long-range contact by at least 3.5%. Furthermore, our model has a low dependency on the number of homologous sequences obtained via multiple sequence alignment, suggesting that it can predict protein contact maps with good accuracy for those proteins that lack homologous templates. These results demonstrate an efficient approach for fast and highly accurate contact map prediction toward construction of protein 3D structure from protein sequence. Data availabilityAll datasets and source codes are provided in: https://github.com/mahan-fcb/CGAN-Cmap-A-protein-contact-map-predictor

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Madani, M., Behzadi, M. M., Song, D., Ilies, H., Tarakanova, A.. 2022-07-28. CGAN-Cmap: protein contact map prediction using deep generative adversarial neural networks. https://doi.org/10.1101/2022.07.26.501607

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related preprints

CellChat Hotspot: A Targeted Approach to Cell Cell Communication Analysis With Spatial transcriptomics Validation.

Abstract. In recent years, single cell RNA sequencing (scRNA seq) has enabled the investigation of intercellular communication through Cell Cell Communication (CCC) tools such as CellChat. Despite their potential, these approaches remain challenging to interpret, particularly when global analyses generate complex interaction networks that may include biologically irrelevant signals. To address this limitation, we developed a framework termed CellChat Hotspot, designed to improve the biological interpretability of inferred communication networks. This approach integrates gene set enrichment analysis with a context driven filtering strategy, selecting both genes and cells based on their functional relevance prior to communication inference. Applied to stage II colon cancer data, CellChat Hotspot enabled the identification of condition-specific interaction patterns associated with recurrence. Non recurrent patients showed enrichment of immune related processes, whereas recurrent cases were characterized by pathways associated with invasion and metastasis. Notably, a loss of interaction in the HSPG pathway between CALB1+ and stromal cells was observed in recurrent patients, suggesting a potential disruption of cell matrix adhesion mechanisms. To verify the reliability of this finding, we applied the framework to spatial transcriptomics data, which confirmed the presence of the HSPG2 DAG1 interaction in non-recurrent tumors and its near absence in recurrent ones. Overall, this framework provides a biologically guided strategy for studying intercellular communication in complex systems such as the tumor microenvironment.

bioinformatics↗

SIFT: Syncmer-Informed Selection of Haplotypes for T2T Imputation

Genome patching improves the completeness of fragmented assemblies by filling unresolved gaps with sequences from reference genomes. Pangenome panels provide diverse candidate haplotypes for this task, but identifying suitable references efficiently becomes increasingly challenging as these panels grow. We present SIFT, a compressed indexing method for selecting reference haplotypes for genome patching with ImpuT2T. SIFT combines closed-syncmer parsing, phrase-level indexing, and pseudo-maximal exact match (pseudo-MEM) queries. Closed syncmers provide a context-independent parsing rule with bounded distances between consecutive selected positions, enabling consistent parsing of reference and query sequences. We demonstrate that two closed syncmers determine the distance at which they can occur consecutively in any string, so that equal substrings of two parses represent identical sequences and no gap sequence need be stored. SIFT indexes the reference parse and its reverse using run-length compressed suffix arrays and adapts the Boyer-Moore-Li search procedure to identify pseudo-MEMs between the reference parse and query parse. It then aggregates matching evidence to identify candidate reference haplotypes for downstream patching. This framework connects compressed sequence indexing with haplotype selection and provides a basis for querying large reference panels at the phrase level. SIFT is publicly available under the GNU license at https://github.com/EddieFerro/SIFT.

bioinformatics↗

Assessing the Capacity of Genomic Language Models to Generate Informative Embeddings of Viral Genome Fragments

Genomic language models (gLMs) trained on large volumes of nucleotide sequences are becoming an alternative to classical methods in metagenomic analysis, particularly for studying genomic "dark matter". In this work, we investigate the ability of four gLMs (DNABERT-2, DNABERT-S, ViraLM, and Evo2-7B) to generate taxonomically informative vector representations of short viral genome fragments. We constructed a balanced reference dataset of viruses based on the ICTV Virus Metadata Resource and compared the representations generated by gLMs with conventional k-mer profiles and MinHash sketches using clustering and neighborhood-based metrics (adjusted Rand index (ARI), precision@k, and CROSS precision@k). On the reference dataset, three of the four gLMs outperformed the 4-mer profile in terms of ARI and precision@5 under the same evaluation protocol. The best performance was generally achieved by intermediate model layers. Conventional k-mer profiles consistently outperformed MinHash sketches. We further evaluated the methods on two viral orders (egoviruses and mriyaviruses) absent from the reference dataset, with model layers and k-mer lengths selected exclusively on the reference dataset. DNABERT-S showed the most consistently strong performance across these two orders, ranking first on mriyaviruses and second on egoviruses, while k-mer profiles with Jensen-Shannon distance remained competitive. We also observed the consistency of representations between forward fragments and their reverse complements. Overall, the best-performing gLMs surpassed conventional baselines, although their advantage depended on the dataset and evaluation metric. The consistently strong performance of DNABERT-S suggests a potential benefit of contrastive fine-tuning and indicates that larger models are not necessarily more effective for generating taxonomically informative representations.

bioinformatics↗