RESUMO
BACKGROUND: Complex biological systems are described as a multitude of cell-cell interactions (CCIs). Recent single-cell RNA-sequencing studies focus on CCIs based on ligand-receptor (L-R) gene co-expression but the analytical methods are not appropriate to detect many-to-many CCIs. RESULTS: In this work, we propose scTensor, a novel method for extracting representative triadic relationships (or hypergraphs), which include ligand-expression, receptor-expression, and related L-R pairs. CONCLUSIONS: Through extensive studies with simulated and empirical datasets, we have shown that scTensor can detect some hypergraphs that cannot be detected using conventional CCI detection methods, especially when they include many-to-many relationships. scTensor is implemented as a freely available R/Bioconductor package.
Assuntos
RNA , Software , Ligantes , Análise de Sequência de RNA/métodos , Expressão Gênica , RNA/genéticaRESUMO
BACKGROUND: In the field of neuroscience, neural modules and circuits that control biological functions have been found throughout entire neural networks. Correlations in neural activity can be used to identify such neural modules. Recent technological advances enable us to measure whole-brain neural activity with single-cell resolution in several species including [Formula: see text]. Because current neural activity data in C. elegans contain many missing data points, it is necessary to merge results from as many animals as possible to obtain more reliable functional modules. RESULTS: In this work, we developed a new time-series clustering method, WormTensor, to identify functional modules using whole-brain activity data from C. elegans. WormTensor uses a distance measure, modified shape-based distance to account for the lags and the mutual inhibition of cell-cell interactions and applies the tensor decomposition algorithm multi-view clustering based on matrix integration using the higher orthogonal iteration of tensors (HOOI) algorithm (MC-MI-HOOI), which can estimate both the weight to account for the reliability of data from each animal and the clusters that are common across animals. CONCLUSION: We applied the method to 24 individual C. elegans and successfully found some known functional modules. Compared with a widely used consensus clustering method to aggregate multiple clustering results, WormTensor showed higher silhouette coefficients. Our simulation also showed that WormTensor is robust to contamination from noisy data. WormTensor is freely available as an R/CRAN package https://cran.r-project.org/web/packages/WormTensor .
Assuntos
Encéfalo , Caenorhabditis elegans , Animais , Reprodutibilidade dos Testes , Algoritmos , Análise por ConglomeradosAssuntos
Animais Domésticos , Medical Subject Headings , Software , Animais , Bovinos , Galinhas , Computação em Nuvem , SuínosRESUMO
BACKGROUND: In genome-wide studies, over-representation analysis (ORA) against a set of genes is an essential step for biological interpretation. Many gene annotation resources and software platforms for ORA have been proposed. Recently, Medical Subject Headings (MeSH) terms, which are annotations of PubMed documents, have been used for ORA. MeSH enables the extraction of broader meaning from the gene lists and is expected to become an exhaustive annotation resource for ORA. However, the existing MeSH ORA software platforms are still not sufficient for several reasons. RESULTS: In this work, we developed an original MeSH ORA framework composed of six types of R packages, including MeSH.db, MeSH.AOR.db, MeSH.PCR.db, the org.MeSH.XXX.db-type packages, MeSHDbi, and meshr. CONCLUSIONS: Using our framework, users can easily conduct MeSH ORA. By utilizing the enriched MeSH terms, related PubMed documents can be retrieved and saved on local machines within this framework.
Assuntos
Biologia Computacional/métodos , Armazenamento e Recuperação da Informação/métodos , Medical Subject Headings , Anotação de Sequência Molecular , PubMed , Software , Vocabulário Controlado , Animais , Restrição Calórica , Perfilação da Expressão Gênica , Estudo de Associação Genômica Ampla , Humanos , Análise de Sequência com Séries de Oligonucleotídeos , Pseudomonas aeruginosa/genética , RatosRESUMO
BACKGROUND: Detection of significant differentially expressed genes (DEGs) from DNA microarray datasets is a common routine task conducted in biomedical research. For the detection of DEGs, numerous methods are proposed. By such conventional methods, generally, DEGs are detected from one dataset consisting of group of control and treatment. However, some DEGs are easily to be detected in any experimental condition. For the detection of much experiment condition specific DEGs, each measurement value of gene expression levels should be compared in two dimensional ways, or both with other genes and other datasets simultaneously. For this purpose, we retrieve the gene expression data from public database as possible and construct "meta-dataset" which summarize expression change of all genes in various experimental condition. Herein, we propose "two-way AIC" (Akaike Information Criteria), method for simultaneous detection of significance genes and experiments on meta-dataset. RESULTS: As a case study of the Pseudomonas aeruginosa, we evaluate whether two-way AIC method can detect test data which is the experiment condition specific DEGs. Operon genes are used as test data. Compared with other commonly used statistical methods (t-rank/F-test, RankProducts and SAM), two-way AIC shows the highest specificity of detection of operon genes. CONCLUSIONS: The two-way AIC performs high specificity for operon gene detection on the microarray meta-dataset. This method can also be applied to estimation of mutual gene interactions.
Assuntos
Perfilação da Expressão Gênica/métodos , Análise de Sequência com Séries de Oligonucleotídeos/métodos , Modelos Estatísticos , Óperon , Pseudomonas aeruginosa , Sensibilidade e EspecificidadeRESUMO
Non-negative tensor factorization (NTF) enables the extraction of a small number of latent components from high-dimensional biomedical data. However, NTF requires many steps, which is a hurdle to implementation. Here, we provide a protocol for TensorLyCV, an easy to run and reproducible NTF analysis pipeline using Snakemake workflow management system and Docker container. Using vaccine adverse reaction data as an example, we describe steps for data processing, tensor decomposition, optimal rank parameter estimation, and visualization of factor matrices. For complete details on the use and execution of this protocol, please refer to Kei Ikeda et al.1.
Assuntos
Fluxo de Trabalho , Fatores de TempoRESUMO
Symptoms of adverse reactions to vaccines evolve over time, but traditional studies have focused only on the frequency and intensity of symptoms. Here, we attempt to extract the dynamic changes in vaccine adverse reaction symptoms as a small number of interpretable components by using non-negative tensor factorization. We recruited healthcare workers who received two doses of the BNT162b2 mRNA COVID-19 vaccine at Chiba University Hospital and collected information on adverse reactions using a smartphone/web-based platform. We analyzed the adverse-reaction data after each dose obtained for 1,516 participants who received two doses of vaccine. The non-negative tensor factorization revealed four time-evolving components that represent typical temporal patterns of adverse reactions for both doses. These components were differently associated with background factors and post-vaccine antibody titers. These results demonstrate that complex adverse reactions against vaccines can be explained by a limited number of time-evolving components identified by tensor factorization.
RESUMO
BACKGROUND: Principal component analysis (PCA) is an essential method for analyzing single-cell RNA-seq (scRNA-seq) datasets, but for large-scale scRNA-seq datasets, computation time is long and consumes large amounts of memory. RESULTS: In this work, we review the existing fast and memory-efficient PCA algorithms and implementations and evaluate their practical application to large-scale scRNA-seq datasets. Our benchmark shows that some PCA algorithms based on Krylov subspace and randomized singular value decomposition are fast, memory-efficient, and more accurate than the other algorithms. CONCLUSION: We develop a guideline to select an appropriate PCA implementation based on the differences in the computational environment of users and developers.
Assuntos
Análise de Componente Principal , RNA-Seq/métodos , Análise de Célula Única/métodos , Algoritmos , BenchmarkingRESUMO
Single-cell RNA sequencing has enabled researchers to quantify the transcriptomes of individual cells, infer cell types and investigate differential expression among cell types, which will lead to a better understanding of the regulatory mechanisms of cell states. Transcript diversity caused by phenomena such as aberrant splicing events have been revealed, and differential expression of previously unannotated transcripts might be overlooked by annotation-based analyses. Accordingly, we have developed an approach to discover overlooked differentially expressed (DE) gene regions that complements annotation-based methods. Our algorithm decomposes mapped count data matrix for a gene region using non-negative matrix factorization, quantifies the differential expression level based on the decomposed matrix, and compares the differential expression level based on annotation-based approach to discover previously unannotated DE transcripts. We performed single-cell RNA sequencing for human neural stem cells and applied our algorithm to the dataset. We also applied our algorithm to two public single-cell RNA sequencing datasets correspond to mouse ES and primitive endoderm cells, and human preimplantation embryos. As a result, we discovered several intriguing DE transcripts, including a transcript related to the modulation of neural stem/progenitor cell differentiation.
RESUMO
Recent technical improvements in single-cell RNA sequencing (scRNA-seq) have enabled massively parallel profiling of transcriptomes, thereby promoting large-scale studies encompassing a wide range of cell types of multicellular organisms. With this background, we propose CellFishing.jl, a new method for searching atlas-scale datasets for similar cells and detecting noteworthy genes of query cells with high accuracy and throughput. Using multiple scRNA-seq datasets, we validate that our method demonstrates comparable accuracy to and is markedly faster than the state-of-the-art software. Moreover, CellFishing.jl is scalable to more than one million cells, and the throughput of the search is approximately 1600 cells per second.