Transmembrane α-helical and β-barrel proteins are a ubiquitous component of proteomes. Topology prediction infers how proteins are embedded in lipid bilayers, identifying membrane-spanning segments and their orientation. While recent methods achieve high performance for membrane-spanning segments, they cannot predict re-entrant regions and interfacial helices – membrane-associated segments that partially insert but do not cross the bilayer – nor identify which biological membrane a protein resides in. Here, we present DeepTMHMM2, the first predictor to include re-entrant regions and interfacial helices in its topologies and jointly predict localization across 17 biological membranes. Benchmark results show that DeepTMHMM2 successfully learns to predict the additional elements, while achieving strong performance on canonical α-helical and β-barrel topology prediction. Applying DeepTMHMM2 to Swiss-Prot reveals that non-crossing segments are a ubiquitous feature of the transmembrane proteome, with interfacial helices present in nearly a quarter of all α-helical transmembrane proteins.
Felix Teufel, Jeppe Hallgren, Henrik Nielsen et al.· bioRxiv· 0 citations
Motivation In this paper, we demonstrate that it is feasible to train a deep generative model for dimensionality reduction with millions of features using few samples, which makes this type of generative model a more versatile alternative to standard methods for dimensionality reduction. Specifically, we hypothesize that for a decoder-only model, the number of training samples required is almost independent of the feature dimensionality in most network architectures. Results Through an extensive set of experiments on synthetic non-linear data, we validate this hypothesis. We also train the model on a downsampled version of the 1000 Genomes Project (1KGP) dataset to further assess its behavior under controlled reductions in sample size. Furthermore, we train a deep generative decoder (DGD) on a curated dataset from the International Cancer Genome Consortium (ICGC), which contains 4.4 million features. It is trained on approximately 4,000 samples and tested on 1,000 samples. The resulting latent representation exhibits clear clustering, and when methods are reduced to the same number of dimensions, it outperforms PCA and VAE for tumor type classification. Additionally, the DGD is computationally efficient and can be trained on a 16GB GPU. Availability and implementation Code is available at https://github.com/cpancott/ReceptiveDGD. Contact corrado.pancotti@helmholtz-munich.de; akrogh@di.ku.dk Supplementary information Supplementary data are available with this preprint.
C. Pancotti, P. Fariselli, J. Meisner et al.· bioRxiv· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
