Tianshou Zhou’s research while affiliated with Sun Yat-sen University and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (43)


Diffusive topology preserving manifold distances for single-cell data analysis
  • Article

January 2025

·

9 Reads

Proceedings of the National Academy of Sciences

·

Bin Zhang

·

Qiu Wang

·

[...]

·

Luonan Chen

Manifold learning techniques have emerged as crucial tools for uncovering latent patterns in high-dimensional single-cell data. However, most existing dimensionality reduction methods primarily rely on 2D visualization, which can distort true data relationships and fail to extract reliable biological information. Here, we present DTNE (diffusive topology neighbor embedding), a dimensionality reduction framework that faithfully approximates manifold distance to enhance cellular relationships and dynamics. DTNE constructs a manifold distance matrix using a modified personalized PageRank algorithm, thereby preserving topological structure while enabling diverse single-cell analyses. This approach facilitates distribution-based cellular relationship analysis, pseudotime inference, and clustering within a unified framework. Extensive benchmarking against mainstream algorithms on diverse datasets demonstrates DTNE’s superior performance in maintaining geodesic distances and revealing significant biological patterns. Our results establish DTNE as a powerful tool for high-dimensional data analysis in uncovering meaningful biological insights.


The network formation process and its restoration
a Illustration of a network formation process. At each snapshot T0, T1, T2, ..., Tn, some new edges are added (darker edges appeared earlier). The goal of this study is to restore the generation order of the edges based on the final network structure at Tn. b, c Diagram of the proposed approach to restoring the temporal sequence of edges for a network with partial evolution history or without any historical information.
Performance of the ensemble model and the restored edge sequence
a Test accuracy of the ensemble model as a function of the percentage of edge pairs used for training. Each data point with error bars marks the corresponding simulation results (average ± standard deviation of 100 simulations), the same for b. b Overall error E\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{{{{{{\mathcal{E}}}}}}}}$$\end{document} as a function of the accuracy x of the ensemble model for different numbers of edges E. The solid curves represent the theoretical results from Eq. (2) and the colored crosses stand for the simulation results using the E and x of five real-world networks. c Simulated distributions of Di/E using the E and x of five real-world networks. Specifically, assuming the ground-truth sequence α = (1, 2, …, E), 100(1 − x)% of all edge pairs are randomly selected and artificially assigned the wrong generation order while the remaining edge pairs are assigned the correct one. Then, the restored edge sequence α̂\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\widehat{{{{{{{{\boldsymbol{\alpha }}}}}}}}}$$\end{document} is obtained by applying the ranking algorithm on the artificially predicted order of all edge pairs and Di’s are calculated accordingly. d, e Comparisons between the real and simulated distributions of Di/E based on the collaboration network (CN) and the PPI network (Fungi). f Diagram illustrating how the distributions in c–e are obtained. The left and right panels show the calculation of Di under a real case when we only know the coarse-grained ground-truth sequence and a simulation when we know the fine-grained ground-truth sequence, respectively. For the real case, Di cannot be calculated directly as αi−α̂i\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha }_{i}-{\widehat{\alpha }}_{i}$$\end{document} so the idea is to consider an intermediate sequence α* by randomly assigning fine-grained order to edges added within the same snapshot and Di is calculated as αi*−α̂i\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha }_{i}^{*}-{\widehat{\alpha }}_{i}$$\end{document} instead. Then the distribution of Di/E is obtained by averaging over 5000 α*’s to take the randomness into account. For the simulation, the calculation of Di follows a similar procedure to match with the real case. The results under the real case and simulation are labeled as “Real Data” and “Simulation” in d and e. See Algorithms 2-3 in the Methods section for more details.
Application on the PPI network for fungi
a The restored network structure and protein functional clusters at the time that the first 1000 edges were added. The size of the nodes indicates the order in which the nodes appear, the nodes added first (i.e., the nodes corresponding to the edges that are added first) are larger. The colors of the nodes represent different functions of the proteins (full protein functions are listed in Supplementary Table S8). It can be seen that in the evolution process of the PPI network, interactions between proteins form protein clusters with specific functions. b The number of proteins by function over time counted according to the order of the edges. Proteins at both ends of each edge are considered. c The number of proteins with different functions added in each interval of 300 edges. The functions represented by each capital letter can be found in a.
Underlying growth mechanism in the restored network evolution processes
Cumulative PA function κ(k) for a PPI network (Fungi), b World Trade Web, and c Collaboration network (Interfaces). In each figure, the yellow circles and blue triangles are the results of the ground-truth and restored evolution processes, respectively. If the growth of a network follows the PA rule, the rate at which a node with degree k acquires new edges should be positively correlated with k and the cumulative PA function κ(k) is expected to grow superlinearly (see Supplementary Section 9 for details). So, the solid gray line with slope = 1 represents the case in which PA is absent. d Adjacency matrices of the evolution process for the protein function network generated by the PPI network (Fungi). Proteins with the same function in the network are treated as a single node to form a simplified protein function network where the edges represent the interactions between proteins with weights being the number of protein interactions. The upper row shows the results based on our restored temporal edge sequence while the lower row shows those based on a simulation study assuming the pure PA rule. The simulation is performed by adding edges according to the PA rule and keeping the average node degree consistent with the real network (details are provided in Supplementary Section 9). e, f Visualizations of the protein function network in d when the number of edges are E = 2000 and E = 5425. Letters marking the nodes denote the protein functions (with specific meanings listed in Supplementary Table S8), and the self-connected and non-self-connected edges are respectively displayed in blue and red. g The modularity⁵⁴ of the PPI network (Fungi). The yellow triangles represent results computed at the real snapshots of the networks. The blue solid lines and pink dashed lines are results based on edge generation order by our reconstruction method and the pure PA rule, respectively. h, i Adjacency matrix and protein function network of the PPI network (Fungi) obtained at the first real snapshot (i.e., E = 5425).
Assortativity coefficient, local clustering coefficient, and shortest path length for the restored evolution processes
The assortativity coefficient for a PPI network (Bacteria), b World Trade Web (WTW), and c Animal network (Weaver). The average local clustering coefficient for d PPI network (Bacteria), e WTW, and f Animal network (Weaver). The average shortest path length for g PPI network (Bacteria), h World Trade Web (WTW), and i Animal network (Weaver). The yellow triangles represent results computed at the real snapshots of the networks. The blue solid lines and red dashed lines are results based on edge generation order by our restoring method and by random assignment, respectively. The pink dashed lines are results for networks generated assuming the pure PA rule. Note that due to the presence of disconnected components during the evolution process of a network, the computation of the average shortest path length only involves pairs of nodes that can be connected.

+1

Reconstructing the evolution history of networked complex systems
  • Article
  • Full-text available

April 2024

·

127 Reads

·

13 Citations

The evolution processes of complex systems carry key information in the systems’ functional properties. Applying machine learning algorithms, we demonstrate that the historical formation process of various networked complex systems can be extracted, including protein-protein interaction, ecology, and social network systems. The recovered evolution process has demonstrations of immense scientific values, such as interpreting the evolution of protein-protein interaction network, facilitating structure prediction, and particularly revealing the key co-evolution features of network structures such as preferential attachment, community structure, local clustering, degree-degree correlation that could not be explained collectively by previous theories. Intriguingly, we discover that for large networks, if the performance of the machine learning model is slightly better than a random guess on the pairwise order of links, reliable restoration of the overall network formation process can be achieved. This suggests that evolution history restoration is generally highly feasible on empirical networks.

Download

Figure 1. A framework for modeling how E-P communication regulates transcription dynamics. (A, B) Schematic for a biological model: The upstream E-P communication in cell nucleus (A) guides the downstream transcription, which is a multistep process where only the main steps are depicted (B). (C, D, E) Schematic for a physical model: A generalized Rouse model is proposed to model chromatin spatial motion including E-P communication (indicated by the red spring with coefficient EP k ), where [ ] T 1 , , N = L r r r
Figure 3. Separatrixes for power-law behaviors of BS and BF in the
Figure 5. Mutual information reveals the effect of E-P communication on bursting kinetics. (A) An information theoretic framework is used to study the effect of input E-P topology on bursting output. The promoter governing transcriptional bursting can be considered a noisy channel. (B) Mutual information between E-P spatial distance and burst size ( MI( , ) BS DS ) as a function of E-P communication strength EP k . (C) Mutual information between E-P spatial distance and cycle time (or OFF time, ON time) as a function of EP k . (D-E) Heatmap shows the effect of EP k and minimum rate on1,min λ
Power-law behavior of transcriptional bursting regulated by enhancer-promoter communication

January 2024

·

58 Reads

·

5 Citations

Genome Research

Revealing how transcriptional bursting kinetics are genomically encoded is challenging because genome structures are stochastic at the organization level and are suggestively linked to gene transcription. To address this challenge, we develop a generic theoretical framework that integrates chromatin dynamics, enhancer–promoter (E-P) communication, and gene-state switching to study transcriptional bursting. The theory predicts that power law can be a general rule to quantitatively describe bursting modulations by E-P spatial communication. Specifically, burst frequency and burst size are up-regulated by E-P communication strength, following power laws with positive exponents. Analysis of the scaling exponents further reveals that burst frequency is preferentially regulated. Bursting kinetics are down-regulated by E-P genomic distance with negative power-law exponents, and this negative modulation desensitizes at large distances. The mutual information between burst frequency (or burst size) and E-P spatial distance further reveals essential characteristics of the information transfer from E-P communication to transcriptional bursting kinetics. These findings, which are in agreement with experimental observations, not only reveal fundamental principles of E-P communication in transcriptional bursting but also are essential for understanding cellular decision-making.


Local and global outbreak on networks. (A) Local outbreak under SIR model (sub-figures (1), (3), (5)) and viruses-like spreading (sub-figures (2), (4), (6)). (B) Giant (left) and finite (right) clusters in a bond percolation process. (C) The relationship between the distribution of spreading size g(i, s) of SIR Model on Facebook social network (columns) and the distribution of cluster size p(s) in the process of bond percolation (green curves). (D) The size distribution of finite connected components near critical points. Source: reprinted figure from ref. [51].
Empirical information spreading and heterogeneous site percolation model on Weibo social network. (A) Relationship between activity of users and the number of their followers. (B), (C): comparison of established model and actual information spreading. (D) The heterogeneity of influence. (E) Empirical information spreading traces of the star symbol S in (B). Panels (F) and (G) show information traces under heterogeneous and uniform site percolation model, respectively. Spreading starts from the red point. Source: reprinted figure from ref. [49].
(A) Schematic of induced percolation. (B)–(D) Relationships between Q i and influences received from different sources (empirical data). Source: reprinted figure from ref. [50].
Phase transition and critical behaviour of induced percolation model on mixed ER networks. p is the probability of directed links. (A) Size of giant out-component near first-order phase transition (black dotted line). (B)The dotted and solid line are second-order and first-order phase transition, respectively. The solid point is the critical point C labeled in (A). Source: reprinted figure from ref. [50].
Time complexity of PBGA. (A) ER network. (B) 9 real social networks. Source: reprinted figure from ref. [51].
Application of percolation model in spreading dynamics driven by social networks big data

March 2023

·

35 Reads

·

2 Citations

Due to the conciseness and efficiency, percolation theory is widely applied in spreading dynamics which is a common and sophisticated phenomenon in real life. With the development of information technology, the quality and quantity of available data are improving, which offers the chance to describe and understand the empirical spreading phenomenon more comprehensively and accurately. Meanwhile, complicated dynamics brought by massive data pose new challenges to the research on social contagion based on percolation theory. In this prospective, we use several examples to briefly show how to use the percolation theory to describe information transmission on social networks driven by big data, to explore the indirect influence mechanism behind the spread of scientific research behavior, and to propose a new algorithm to quantify the global influence of nodes from the local topology. Finally, based on these studies, we propose several possible new directions of percolation theory in research of social contagion driven by big data.


Silent transcription intervals and translational bursting lead to diverse phenotypic switching

October 2022

·

35 Reads

·

13 Citations

Physical Chemistry Chemical Physics

Gene-expression bimodality, as a potential mechanism generating phenotypic cell diversity, can enhance the survival of cells in a fluctuating environment. Previous studies have shown that intrinsic or extrinsic regulations could induce bimodal gene expressions, but it is unclear whether this bimodality can occur without regulation. Here we develop an interpretable and tractable model, namely a generalized telegraph model (GTM), which considers silent transcription intervals and translational bursting, each being characterized by a general distribution. Using the queuing theory, we derive the analytical expressions of protein distributions, and show that non-exponential inactive times and translational bursting can lead to two peaks of the protein distribution away from the origin, which are different from those occurring in classical telegraph models. We also find that both silent-interval noise and translational burst-size noise can amplify gene-expression noise and induce diverse dynamic expression patterns. Our results not only provide an alternative mechanism of phenotypic switching but also could be used in explaining the bimodal phenomenon in experimental observations.


Balance of positive and negative regulation for trade-off between efficiency and resilience of high-dimensional networks

June 2022

·

35 Reads

·

4 Citations

Physica A Statistical Mechanics and its Applications

The study of resilience for high-dimensional systems is a challenging problem in physical sciences. Although a generic dimensional reduction method has been proposed to study the resilience of large-scale networks, an important yet unsolved question is how different types of regulation affect network resilience. Here we propose a new method to reduce the size of a large-scale regulatory network to the number of regulation types in the system. For each type of regulation, a symbolic variable is introduced to represent the function of that regulation in determining the resilience of the high-dimensional network. Using the genetic networks in Escherichia coli and Saccharomyces cerevisiae as the test systems, we examine how positive and negative regulation affect the resilience of these systems. Analytical and numerical studies suggest that the reduction of positive regulation deteriorates network resilience, while the decline of negative regulation enhances the resilience property. More importantly, we show that there is a trade-off between network efficiency and resilience, which is supported by the balance of positive and negative regulation. The proposed method provides a general framework to evaluate the key role of different regulatory mechanisms in determining the resilience of high-dimensional networks.


Integrated Pipelines for Inferring Gene Regulatory Networks from Single-Cell Data

May 2022

·

35 Reads

·

3 Citations

Current Bioinformatics

Background Single-cell technologies provide unprecedented opportunities to study heterogeneity of molecular mechanisms. In particular, single-cell RNA-sequence data have been successfully used to infer gene regulatory networks with stochastic expressions. However, there are still substantial challenges in measuring the relationships between genes and selecting the important genetic regulations. Objective This prospective provides a brief review of effective methods for the inference of gene regulatory networks. Methods We concentrate on two types of inference methods, namely the model-free methods and mechanistic methods for constructing gene networks. Results For the model-free methods, we mainly discuss two issues, namely the measures for quantifying gene relationship and criteria for selecting significant connections between genes. The issue for mechanistic methods is different mathematical models to describe genetic regulations accurately. Conclusions We and advocates the development of ensemble methods that combine two or more methods together.


Genome-wide inference reveals that feedback regulations constrain promoter-dependent transcriptional burst kinetics

April 2022

·

30 Reads

Background: A major challenge in transcriptional regulation is to understand how static promoter architecture and dynamic feedback regulation dictate transcriptional burst kinetics on a genome-wide scale. Although single-cell RNA sequencing (scRNA-seq) provides an opportunity to address this issue, analytical methods need to be developed to uncover molecular mechanisms governing burst kinetics. Results: We develop an interpretable and scalable statistical framework, which combines experimental data with a mechanistic model to infer transcriptional burst kinetics (sizes and frequencies) and feedback regulations. Applying this framework to the scRNA-seq data of embryonic mouse fibroblast cells, we find that genome-wide burst kinetics exhibit different characteristics in cases without and with feedback regulations, implying Simpson’s paradoxes. We show that feedbacks modulate burst frequencies and sizes differently and conceal the effects of transcription start site distributions on burst kinetics. Notably, only in the presence of positive feedback, TATA genes are expressed with high burst frequencies, and enhancer-promoter interactions mainly modulate burst frequencies. Conclusions: The inference method developed here provides a flexible, robust, and efficient way to infer molecular mechanisms dictating burst kinetics. Our study reveals genome-wide burst patterns coordinated by promoter architecture and feedback regulations.


Fig. 1 Methodology for developing multistable models by embedding two sub-systems with bistability together. a Brief flowchart of hematopoietic hierarchy that is created with BioRender.com. HSCs hematopoietic stem cells, MPPs multipotent progenitors, MEPs megakaryocyte-erythroid progenitors, GMPs granulocyte-macrophage progenitors. b The principle of embeddedness: Z-U module is the first bistable sub-system. Once this module crosses the saddle point from state Z to state U, it enters the X-Y sub-system that has two stable steady states X and Y, reaching either state X or state Y via the auxiliary state U. c, d The structure of two double-negative feedback loops with positive autoregulations, which is the mechanisms for bistable sub-systems in HSCs. e The structure and mathematical model of regulatory network after embeddedness. The X-Y sub-system is embedded into the state U.
Fig. 5 Distributions of different cell types derived from stochastic simulations. a Frequencies of cells having successful switching for each set of parameters ðk à 0 ; ψÞ. b Ratios of GMP cells to MEP cells when cells have successfully switched in a for each set of parameters ðk à 0 ; ψÞ. c Parameter sets of ðk à 0 ; ψÞ that generate stochastic simulations with four steady states as shown in Fig. 4 (yellow part) or with two or three states (blue part). d Violin plots of natural log normalised (expression level per cell +1) distributions for three genes in different cell states derived from stochastic simulations with parameters k à 0 ¼ 0:52 and ψ = 0.0005.
A robust method for designing multistable systems by embedding bistable subsystems

March 2022

·

64 Reads

·

11 Citations

npj Systems Biology and Applications

Although multistability is an important dynamic property of a wide range of complex systems, it is still a challenge to develop mathematical models for realising high order multistability using realistic regulatory mechanisms. To address this issue, we propose a robust method to develop multistable mathematical models by embedding bistable models together. Using the GATA1-GATA2-PU.1 module in hematopoiesis as the test system, we first develop a tristable model based on two bistable models without any high cooperative coefficients, and then modify the tristable model based on experimentally determined mechanisms. The modified model successfully realises four stable steady states and accurately reflects a recent experimental observation showing four transcriptional states. In addition, we develop a stochastic model, and stochastic simulations successfully realise the experimental observations in single cells. These results suggest that the proposed method is a general approach to develop mathematical models for realising multistability and heterogeneity in complex systems.


Exact distributions for stochastic gene expression models with arbitrary promoter architecture and translational bursting

January 2022

·

46 Reads

·

15 Citations

PHYSICAL REVIEW E

Gene expression in individual cells is inherently variable and sporadic, leading to cell-to-cell variability in mRNA and protein levels. Recent single-cell and single-molecule experiments indicate that promoter architecture and translational bursting play significant roles in controlling gene expression noise and generating the phenotypic diversity that life exhibits. To quantitatively understand the impact of these factors, it is essential to construct an accurate mathematical description of stochastic gene expression and find the exact analytical results, which is a formidable task. Here, we develop a stochastic model of bursty gene expression, which considers the complex promoter architecture governing the variability in mRNA expression and a general distribution characterizing translational burst. We derive the analytical expression for the corresponding protein steady-state distribution and all moment statistics of protein counts. We show that the total protein noise can be decomposed into three parts: the low-copy noise of protein due to probabilistic individual birth and death events, the noise due to stochastic switching between promoter states, and the noise resulting from translational busting. The theoretical results derived provide quantitative insights into the biochemical mechanisms of stochastic gene expression.


Citations (29)


... In "Finding key players in complex networks through deep reinforcement learning" [319], authors employed graph reinforcement learning to detect "key players" on the network, which denotes influential and vital nodes for certain network functionality. Recently, in "Reconstructing the evolution history of networked complex systems" [320], the output of a graph neural network is directly trained to predict the generation order of the given edges, recovering the valuable information of graph evolution process which is unknown in most cases. ...

Reference:

Interpretable Machine Learning in Physics: A Review
Reconstructing the evolution history of networked complex systems

... For instance, more complex models incorporate feedback regulation, multiple gene activation steps, and multiple gene activation pathways (11). Recent studies have integrated transcriptional bursting with genomic architecture and chromatin accessibility (48), revealing that these factors preferentially affect burst frequency (BF). ...

Power-law behavior of transcriptional bursting regulated by enhancer-promoter communication

Genome Research

... Over the past several decades, percolation models that exhibit geometric phase transitions have garnered significant attention due to their theoretical and practical importance across various fields [1][2][3][4][5][6][7][8]. These models effectively capture the inherent randomness of geometric structures present in many systems and show nontrivial critical behavior [9][10][11][12]. ...

Application of percolation model in spreading dynamics driven by social networks big data

... This suggests that the one rate-limiting step during gene initiation in the telegraph model should be replaced by ordered n 2 rate-limiting steps with ratesk on,1 , . . . ,k on,n , giving rise to the "n + 1"-state model, as shown by the following scheme: (21) In previous research, the three-state model was established to explain the nonzero peaked distribution of the gene inactive period in mouse fibroblasts [34]; the four-state model shows the best fit to dynamic distribution data for yeast and bacterial genes [28,35]; the six-state model can induce two nonzero peaks for the mRNA distribution that cannot be generated by the telegraph model [36]; and an arbitrary gene state number was integrated into different models to simulate the effect of multistep cell cycle regulation on gene transcription [37], as well as the oscillated transcriptional mean dynamics of mouse fibroblast genes in response to the cytokine tumor necrosis factor [38]. ...

Silent transcription intervals and translational bursting lead to diverse phenotypic switching

Physical Chemistry Chemical Physics

... In complex adaptive systems, such as the health system, tensions exist between efficiency and resilience [6]. A tradeoff between system efficiency and system resilience has been documented in ecological, business, and other literature (for example, [7,8] or [9]). In health systems, a focus on efficiency may hinder the resilience of the system through at least three channels. ...

Balance of positive and negative regulation for trade-off between efficiency and resilience of high-dimensional networks
  • Citing Article
  • June 2022

Physica A Statistical Mechanics and its Applications

... Bi-stable models were then embedded to achieve a tri-stable model, which was further modeled to encompass four mutually exclusive stable states. The findings from their modeling fitted experimental data [59]. We cannot, therefore, exclude that HSCs can process complex information regarding how they make a choice of lineage. ...

A robust method for designing multistable systems by embedding bistable subsystems

npj Systems Biology and Applications

... There is a rich body of literature connecting transcriptional bursting to fluctuations in levels of a given gene product [74][75][76][77][78][79][80][81][82][83][84]. Borrowing this recent mathematical modeling framework, we explore the impact of non-exponential promoter switching times on the statistical fluctuations in gene expression levels. ...

Exact distributions for stochastic gene expression models with arbitrary promoter architecture and translational bursting
  • Citing Article
  • January 2022

PHYSICAL REVIEW E

... Pseudotime Analysis and Stochastic Differential Equations Pseudotime analysis (PA) was originally developed in single-cell transcriptomics to reconstruct cell differentiation trajectories from static snapshots of gene expression profiles [Trapnell et al., 2014, Haghverdi et al., 2016, Wei et al., 2021. Since time-resolved measurements of individual cells are often infeasible, pseudotime methods infer an intrinsic ordering (e.g., trajectories) of cells based on their transcriptional similarities, providing insights into dynamic biological processes. ...

DTFLOW: Inference and Visualization of Single-Cell Pseudotime Trajectory Using Diffusion Propagation

Genomics Proteomics & Bioinformatics

... Mean-field models based on the diffusion approximation and the approximate transfer function of [20] have been applied to a variety of different model neurons [37], have been studied in terms of bifurcation theory [38,39], and have been compared to biological data [22]. However, the sigmoidal shape of this transfer function does not match analytical results [36,40]. ...

Hopf Bifurcation in Mean Field Explains Critical Avalanches in Excitation-Inhibition Balanced Neuronal Networks: A Mechanism for Multiscale Variability

Frontiers in Systems Neuroscience

... The rapid development of single-cell transcriptome sequencing technology allows researchers to study cell state transitions and various biological processes at single-cell resolution 1 and opens new fields for exploring the basic mechanisms of normal development and disease 2,3 . It further allows researchers to measure gene expression levels within individual cells, identify specific cell types within complex cellular populations, analyze heterogeneity in single cells, and describe gene expression trends during cellular differentiation 4,5 . This provides new insights into cell differentiation, development, disease, and other complex cellular processes 6 . ...

SCOUT: A new algorithm for the inference of pseudo-time trajectory using single-cell data
  • Citing Article
  • June 2019

Computational Biology and Chemistry