MapCell: Learning a Comparative Cell Type Distance Metric With Siamese Neural Nets With Applications Toward Cell-Type Identification Across Experimental Datasets
Ontology highlight
ABSTRACT:
SUBMITTER: Koh W
PROVIDER: S-EPMC8593221 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:MotivationCategorizing cells into distinct types can shed light on biological tissue functions and interactions, and uncover specific mechanisms under pathological conditions. Since gene expression throughout a population of cells is averaged out by conventional sequencing techniques, it is challenging to distinguish between different cell types. The accumulation of single-cell RNA sequencing (scRNA-seq) data provides the foundation for a more precise classification of cell types. It is crucial building a high-accuracy clustering approach to categorize cell types since the imbalance of cell types and differences in the distribution of scRNA-seq data affect single-cell clustering and visualization outcomes.ResultTo achieve single-cell type detection, we propose a meta-learning-based single-cell clustering model called ScLSTM. Specifically, ScLSTM transforms the single-cell type detection problem into a hierarchical classification problem based on feature extraction by the siamese long-short term memory (LSTM) network. The similarity matrix derived from the improved sigmoid kernel is mapped to the siamese LSTM feature space to analyze the differences between cells. ScLSTM demonstrated superior classification performance on 8 scRNA-seq data sets of different platforms, species, and tissues. Further quantitative analysis and visualization of the human breast cancer data set validated the superiority and capability of ScLSTM in recognizing cell types.
| S-EPMC10629177 | biostudies-literature
Project description:In protein-protein interaction (PPI) networks, functional similarity is often inferred based on the function of directly interacting proteins, or more generally, some notion of interaction network proximity among proteins in a local neighborhood. Prior methods typically measure proximity as the shortest-path distance in the network, but this has only a limited ability to capture fine-grained neighborhood distinctions, because most proteins are close to each other, and there are many ties in proximity. We introduce diffusion state distance (DSD), a new metric based on a graph diffusion property, designed to capture finer-grained distinctions in proximity for transfer of functional annotation in PPI networks. We present a tool that, when input a PPI network, will output the DSD distances between every pair of proteins. We show that replacing the shortest-path metric by DSD improves the performance of classical function prediction methods across the board.
| S-EPMC3806810 | biostudies-literature
Project description:BackgroundElaboration of powerful methods to predict functional and/or physical protein-protein interactions from genome sequence is one of the main tasks in the post-genomic era. Phylogenetic profiling allows the prediction of protein-protein interactions at a whole genome level in both Prokaryotes and Eukaryotes. For this reason it is considered one of the most promising methods.ResultsHere, we propose an improvement of phylogenetic profiling that enables handling of large genomic datasets and infer global protein-protein interactions. This method uses the distance correlation as a new measure of phylogenetic profile similarity. We constructed robust reference sets and developed Phylo-dCor, a parallelized version of the algorithm for calculating the distance correlation that makes it applicable to large genomic data. Using Saccharomyces cerevisiae and Escherichia coli genome datasets, we showed that Phylo-dCor outperforms phylogenetic profiling methods previously described based on the mutual information and Pearson's correlation as measures of profile similarity.ConclusionsIn this work, we constructed and assessed robust reference sets and propose the distance correlation as a measure for comparing phylogenetic profiles. To make it applicable to large genomic data, we developed Phylo-dCor, a parallelized version of the algorithm for calculating the distance correlation. Two R scripts that can be run on a wide range of machines are available upon request.
| S-EPMC5584357 | biostudies-literature
Project description:Metagenomic binning is the step in building metagenome-assembled genomes (MAGs) when sequences predicted to originate from the same genome are automatically grouped together. The most widely-used methods for binning are reference-independent, operating de novo and enable the recovery of genomes from previously unsampled clades. However, they do not leverage the knowledge in existing databases. Here, we introduce SemiBin, an open source tool that uses deep siamese neural networks to implement a semi-supervised approach, i.e. SemiBin exploits the information in reference genomes, while retaining the capability of reconstructing high-quality bins that are outside the reference dataset. Using simulated and real microbiome datasets from several different habitats from GMGCv1 (Global Microbial Gene Catalog), including the human gut, non-human guts, and environmental habitats (ocean and soil), we show that SemiBin outperforms existing state-of-the-art binning methods. In particular, compared to other methods, SemiBin returns more high-quality bins with larger taxonomic diversity, including more distinct genera and species.
| S-EPMC9051138 | biostudies-literature
Project description:Analysis of single-cell datasets generated from diverse organisms offers unprecedented opportunities to unravel fundamental evolutionary processes of conservation and diversification of cell types. However, interspecies genomic differences limit the joint analysis of cross-species datasets to homologous genes. Here we present SATURN, a deep learning method for learning universal cell embeddings that encodes genes' biological properties using protein language models. By coupling protein embeddings from language models with RNA expression, SATURN integrates datasets profiled from different species regardless of their genomic similarity. SATURN can detect functionally related genes coexpressed across species, redefining differential expression for cross-species analysis. Applying SATURN to three species whole-organism atlases and frog and zebrafish embryogenesis datasets, we show that SATURN can effectively transfer annotations across species, even when they are evolutionarily remote. We also demonstrate that SATURN can be used to find potentially divergent gene functions between glaucoma-associated genes in humans and four other species.
| S-EPMC11310084 | biostudies-literature
Project description:MOTIVATION: The presence of reticulate evolutionary events in phylogenies turn phylogenetic trees into phylogenetic networks. These events imply in particular that there may exist multiple evolutionary paths from a non-extant species to an extant one, and this multiplicity makes the comparison of phylogenetic networks much more difficult than the comparison of phylogenetic trees. In fact, all attempts to define a sound distance measure on the class of all phylogenetic networks have failed so far. Thus, the only practical solutions have been either the use of rough estimates of similarity (based on comparison of the trees embedded in the networks), or narrowing the class of phylogenetic networks to a certain class where such a distance is known and can be efficiently computed. The first approach has the problem that one may identify two networks as equivalent, when they are not; the second one has the drawback that there may not exist algorithms to reconstruct such networks from biological sequences. RESULTS: We present in this article a distance measure on the class of semi-binary tree-sibling time consistent phylogenetic networks, which generalize tree-child time consistent phylogenetic networks, and thus also galled-trees. The practical interest of this distance measure is 2-fold: it can be computed in polynomial time by means of simple algorithms, and there also exist polynomial-time algorithms for reconstructing networks of this class from DNA sequence data. AVAILABILITY: The Perl package Bio::PhyloNetwork, included in the BioPerl bundle, implements many algorithms on phylogenetic networks, including the computation of the distance presented in this article. SUPPLEMENTARY INFORMATION: Some counterexamples, proofs of the results not included in this article, and some computational experiments are available at Bioinformatics online.
| S-EPMC2718672 | biostudies-literature
Project description:High-throughput next-generation sequencing methods have recently provided a detailed picture of the genetic landscape of neuroendocrine tumors (NETs), revealing recurrent mutations of chromatin-remodeling genes and little-to-no pathogenetic role for oncogenes commonly mutated in cancer. Concurrently, multiple epigenetic modifications have been described across the whole spectrum of NETs, and their putative function as tumorigenic drivers has been envisaged. As result, it is still unclear whether or not NETs are epigenetically-driven, rather than genetically-induced malignancies. Although the NET epigenome profiling has led to the identification of molecularly-distinct tumor subsets, validation studies in larger cohorts of patients are needed to translate the use of NET epitypes in clinical practice. In the precision medicine era, recognition of subpopulations of patients more likely to respond to therapeutic agents is critical, and future studies testing epigenetic biomarkers are therefore awaited. Restoration of the aberrant chromatin remodeling machinery is an attractive approach for future treatment of cancer and in several hematological malignancies a few epigenetic agents have been already approved. Although clinical outcomes of epigenetic therapies in NETs have been disappointing so far, further clinical trials are required to investigate the efficacy of these drugs. In this context, given the immune-stimulating effects of epidrugs, combination therapies with immune checkpoint inhibitors should be tested. In this review, we provide an overview of the epigenetic changes in both hereditary and sporadic NETs of the gastroenteropancreatic and bronchial tract, focusing on their diagnostic, prognostic and therapeutic implications.
| S-EPMC5302998 | biostudies-literature
Project description:The control of porcine reproductive and respiratory syndrome (PRRS) remains a significant challenge due to the genetic and antigenic variability of the causative virus (PRRSV). Predominantly, PRRSV management includes using vaccines and live virus inoculations to confer immunity against PRRSV on farms. While understanding cross-protection among strains is crucial for the continued success of these interventions, understanding how genetic diversity translates to antigenic diversity remains elusive. We developed machine learning algorithms to estimate antigenic distance in silico, based on genetic sequence data, and identify differences in specific amino acid sites associated with antigenic differences between viruses. First, we obtained antigenic distance estimates derived from serum neutralization assays cross-reacting PRRSV monospecific antisera with virus isolates from 27 PRRSV1 viruses circulating in Europe. Antigenic distances were weakly to moderately associated with ectodomain amino acid distance for open reading frames (ORFs) 2 to 4 (ρ < 0.2) and ORF5 (ρ = 0.3), respectively. Dividing the antigenic distance values at the median, we then categorized the sera-virus pairs into two levels: low and high antigenic distance (dissimilarity). In the machine learning models, we used amino acid distances in the ectodomains of ORFs 2 to 5 and site-wise amino acid differences between the viruses as potential predictors of antigenic dissimilarity. Using mixed-effect gradient boosting models, we estimated the antigenic distance (high versus low) between serum-virus pairs with an accuracy of 81% (95% confidence interval, 76 to 85%); sensitivity and specificity were 86% and 75%, respectively. We demonstrate that using sequence data we can estimate antigenic distance and potential cross-protection between PRRSV1 strains. IMPORTANCE Understanding cross-protection between cocirculating PRRSV1 strains is crucial to reducing losses associated with PRRS outbreaks on farms. While experimental studies to determine cross-protection are instrumental, these in vivo studies are not always practical or timely for the many cocirculating and emerging PRRSV strains. In this study, we demonstrate the ability to rapidly estimate potential immunologic cross-reaction between different PRRSV1 strains in silico using sequence data routinely collected by production systems. These models can provide fast turn-around information crucial for improving PRRS management decisions such as selecting vaccines/live virus inoculation to be used on farms and assessing the risk of outbreaks by emerging strains on farms previously exposed to certain PRRSV strains and vaccine development among others.
| S-EPMC9927307 | biostudies-literature
Project description:Metric multidimensional scaling (MDS) is a widely used multivariate method with applications in almost all scientific disciplines. Eigenvalues obtained in the analysis are usually reported in order to calculate the overall goodness-of-fit of the distance matrix. In this paper, we refine MDS goodness-of-fit calculations, proposing additional point and pairwise goodness-of-fit statistics that can be used to filter poorly represented observations in MDS maps. The proposed statistics are especially relevant for large data sets that contain outliers, with typically many poorly fitted observations, and are helpful for improving MDS output and emphasising the most important features of the dataset. Several goodness-of-fit statistics are considered, and both Euclidean and non-Euclidean distance matrices are considered. Some examples with data from demographic, genetic and geographic studies are shown.
| S-EPMC7539904 | biostudies-literature
Project description:X-ray crystallography has shown that an antibody paratope typically binds 15-22 amino acids (aa) of an epitope, of which 2-5 randomly distributed amino acids contribute most of the binding energy. In contrast, researchers typically choose for B-cell epitope mapping short peptide antigens in antibody binding assays. Furthermore, short 6-11-aa epitopes, and in particular non-epitopes, are over-represented in published B-cell epitope datasets that are commonly used for development of B-cell epitope prediction approaches from protein antigen sequences. We hypothesized that such suboptimal length peptides result in weak antibody binding and cause false-negative results. We tested the influence of peptide antigen length on antibody binding by analyzing data on more than 900 peptides used for B-cell epitope mapping of immunodominant proteins of Chlamydia spp. We demonstrate that short 7-12-aa peptides of B-cell epitopes bind antibodies poorly; thus, epitope mapping with short peptide antigens falsely classifies many B-cell epitopes as non-epitopes. We also show in published datasets of confirmed epitopes and non-epitopes a direct correlation between length of peptide antigens and antibody binding. Elimination of short, ≤11-aa epitope/non-epitope sequences improved datasets for evaluation of in silico B-cell epitope prediction. Achieving up to 86% accuracy, protein disorder tendency is the best indicator of B-cell epitope regions for chlamydial and published datasets. For B-cell epitope prediction, the most effective approach is plotting disorder of protein sequences with the IUPred-L scale, followed by antibody reactivity testing of 16-30-aa peptides from peak regions. This strategy overcomes the well known inaccuracy of in silico B-cell epitope prediction from primary protein sequences.
| S-EPMC4938180 | biostudies-literature