Biology subjects

Nikaido, I.

Publications and source records attributed to Nikaido, I..

4 recordsLinked to original sources

bioRxiv2018

CellFishing.jl: an ultrafast and scalable cell search method for single-cell RNA-sequencing

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 1,600 cells per second.

bioinformatics↗

bioRxiv2017

An efficient gene regulatory network inference algorithm for early Drosophila melanogaster embryogenesis

The spatial patterns of gene expression in early Drosophila melanogaster embryogenesis have been studied experimentally and theoretically to reveal the molecular basis of morphogenesis. In particular, the gene regulatory network (GRN) of gap genes has been investigated through mathematical modeling and simulation. Although these simulation-based approaches are useful for describing complex dynamics and have revealed several important regulations in spatial patterning, they are computationally intensive because they optimize GRN with iterative simulation. Recently, the advance of experimental technologies is enabling the acquisition of comprehensive spatial expression data, and an efficient algorithm will be necessary to analyze such large-scale data. In this research, we developed an efficient algorithm to infer the GRN based on a linear reaction-diffusion model. First, we qualitatively analyzed the GRNs of gap genes and pair-rule genes based on our algorithm and showed that two mutual repressions are fundamental regulations. Then, we inferred the GRN from gap gene data, and identified asymmetric regulations in addition to the two mutual repressions. We analyzed the effect of these asymmetric regulations on spatial patterns, and showed that they have the potential to adjust peak position. Our algorithm runs in sub-second time, which is significantly smaller than the runtime of simulation-based approaches (between 8 and 160 h, for exmaple). Neverthe-less, our inferred GRN was highly correlated with the simulation-based GRNs. We also analyzed the gap gene network of Clogmia albipunctata and showed that different mutual repression regulations might be important in comparison with those of Drosophila melanogaster. As our algorithm can infer GRNs efficiently and can be applied to several different network analysis, it will be a valuable approach for analyzing large-scale data.

bioinformatics↗

bioRxiv2017

Quartz-Seq2: a high-throughput single-cell RNA-sequencing method that effectively uses limited sequence reads

High-throughput single-cell RNA-seq methods assign limited unique molecular identifier (UMI) counts as gene expression values to single cells from shallow sequence reads and detect limited gene counts. We thus developed a high-throughput single-cell RNA-seq method, Quartz-Seq2, to overcome these issues. Our improvements in the reaction steps make it possible to effectively convert initial reads to UMI counts (at a rate of 30%-50%) and detect more genes. To demonstrate the power of Quartz-Seq2, we analyzed approximately 10,000 transcriptomes in total from in vitro embryonic stem cells and an in vivo stromal vascular fraction with a limited number of reads.

genomics↗

bioRxiv2016

SCODE: An efficient regulatory network inference algorithm from single-cell RNA-Seq during differentiation

The analysis of RNA-Seq data from individual differentiating cells enables us to reconstruct the differentiation process and the degree of differentiation (in pseudo-time) of each cell. Such analyses can reveal detailed expression dynamics and functional relationships for differentiation. To further elucidate differentiation processes, more insight into gene regulatory networks is required. The pseudo-time can be regarded as time information and, therefore, single-cell RNA-Seq data are time-course data with high time resolution. Although time-course data are useful for inferring networks, conventional inference algorithms for such data suffer from high time complexity when the number of samples and genes is large. Therefore, a novel algorithm is necessary to infer networks from single-cell RNA-Seq during differentiation.\n\nIn this study, we developed the novel and efficient algorithm SCODE to infer regulatory networks, based on ordinary differential equations. We applied SCODE to three single-cell RNA-Seq datasets and confirmed that SCODE can reconstruct observed expression dynamics. We evaluated SCODE by comparing its inferred networks with use of a DNaseI-footprint based network. The performance of SCODE was best for two of the datasets and nearly best for the remaining dataset. We also compared the runtimes and showed that the runtimes for SCODE are significantly shorter than for alternatives. Thus, our algorithm provides a promising approach for further single-cell differentiation analyses.\n\nThe R source code of SCODE is available at https://github.com/hmatsu1226/SCODE.

bioinformatics↗