ASU Scholarship Showcase

Linnorm is a novel normalization and transformation method for the analysis of single cell RNA sequencing (scRNA-seq) data. Linnorm is developed to remove technical noises and simultaneously preserve biological variations in scRNA-seq data, such that existing statistical methods can be improved. Using real scRNA-seq data, we compared Linnorm with existing normalization methods, including NODES, SAMstrt, SCnorm, scran, DESeq and TMM. Linnorm shows advantages in speed, technical noise removal and preservation of cell heterogeneity, which can improve existing methods in the discovery of novel subtypes, pseudo-temporal ordering of cells, clustering analysis, etc. Linnorm also performs better than existing DEG analysis methods, including BASiCS, NODES, SAMstrt, Seurat and DESeq2, in false positive rate control and accuracy.

Two classes of scaling behaviours, namely the super-linear scaling of links or activities, and the sub-linear scaling of area, diversity, or time elapsed with respect to size have been found to prevail in the growth of complex networked systems. Despite some pioneering modelling approaches proposed for specific systems, whether there exists some general mechanisms that account for the origins of such scaling behaviours in different contexts, especially in socioeconomic systems, remains an open question. We address this problem by introducing a geometric network model without free parameter, finding that both super-linear and sub-linear scaling behaviours can be simultaneously reproduced and that the scaling exponents are exclusively determined by the dimension of the Euclidean space in which the network is embedded. We implement some realistic extensions to the basic model to offer more accurate predictions for cities of various scaling behaviours and the Zipf distribution reported in the literature and observed in our empirical studies. All of the empirical results can be precisely recovered by our model with analytical predictions of all major properties. By virtue of these general findings concerning scaling behaviour, our models with simple mechanisms gain new insights into the evolution and development of complex networked systems.

Two distinct monocyte (Mo)/macrophage (Mp) subsets (Ly6C^low and Ly6C^hi) orchestrate cardiac recovery process following myocardial infarction (MI). Prostaglandin (PG) E₂ is involved in the Mo/Mp-mediated inflammatory response, however, the role of its receptors in Mos/Mps in cardiac healing remains to be determined. Here we show that pharmacological inhibition or gene ablation of the Ep3 receptor in mice suppresses accumulation of Ly6C^low Mos/Mps in infarcted hearts. Ep3 deletion in Mos/Mps markedly attenuates healing after MI by reducing neovascularization in peri-infarct zones. Ep3 deficiency diminishes CX3C chemokine receptor 1 (CX3CR1) expression and vascular endothelial growth factor (VEGF) secretion in Mos/Mps by suppressing TGFβ1 signaling and subsequently inhibits Ly6C^low Mos/Mps migration and angiogenesis. Targeted overexpression of Ep3 receptors in Mos/Mps improves wound healing by enhancing angiogenesis. Thus, the PGE₂/Ep3 axis promotes cardiac healing after MI by activating reparative Ly6C^low Mos/Mps, indicating that Ep3 receptor activation may be a promising therapeutic target for acute MI.

Modeling of transcriptional regulatory networks (TRNs) has been increasingly used to dissect the nature of gene regulation. Inference of regulatory relationships among transcription factors (TFs) and genes, especially among multiple TFs, is still challenging. In this study, we introduced an integrative method, LogicTRN, to decode TF–TF interactions that form TF logics in regulating target genes. By combining cis-regulatory logics and transcriptional kinetics into one single model framework, LogicTRN can naturally integrate dynamic gene expression data and TF-DNA-binding signals in order to identify the TF logics and to reconstruct the underlying TRNs. We evaluated the newly developed methodology using simulation, comparison and application studies, and the results not only show their consistence with existing knowledge, but also demonstrate its ability to accurately reconstruct TRNs in biological complex systems.

Cancer therapy selects for cancer cells resistant to treatment, a process that is fundamentally evolutionary. To what extent, however, is the evolutionary perspective employed in research on therapeutic resistance and relapse? We analyzed 6,228 papers on therapeutic resistance and/or relapse in cancers and found that the use of evolution terms in abstracts has remained at about 1% since the 1980s. However, detailed coding of 22 recent papers revealed a higher proportion of papers using evolutionary methods or evolutionary theory, although this number is still less than 10%. Despite the fact that relapse and therapeutic resistance is essentially an evolutionary process, it appears that this framework has not permeated research. This represents an unrealized opportunity for advances in research on therapeutic resistance.

It remains challenging to predict regulatory variants in particular tissues or cell types due to highly context-specific gene regulation. By connecting large-scale epigenomic profiles to expression quantitative trait loci (eQTLs) in a wide range of human tissues/cell types, we identify critical chromatin features that predict variant regulatory potential. We present cepip, a joint likelihood framework, for estimating a variant’s regulatory probability in a context-dependent manner. Our method exhibits significant GWAS signal enrichment and is superior to existing cell type-specific methods. Furthermore, using phenotypically relevant epigenomes to weight the GWAS single-nucleotide polymorphisms, we improve the statistical power of the gene-based association test.

Background: Medical and public health scientists are using evolution to devise new strategies to solve major health problems. But based on a 2003 survey, medical curricula may not adequately prepare physicians to evaluate and extend these advances. This study assessed the change in coverage of evolution in North American medical schools since 2003 and identified opportunities for enriching medical education.

Methods: In 2013, curriculum deans for all North American medical schools were invited to rate curricular coverage and perceived importance of 12 core principles, the extent of anticipated controversy from adding evolution, and the usefulness of 13 teaching resources. Differences between schools were assessed by Pearson’s chi-square test, Student’s t-test, and Spearman’s correlation. Open-ended questions sought insight into perceived barriers and benefits.

Results: Despite repeated follow-up, 60 schools (39%) responded to the survey. There was no evidence of sample bias. The three evolutionary principles rated most important were antibiotic resistance, environmental mismatch, and somatic selection in cancer. While importance and coverage of principles were correlated (r = 0.76, P < 0.01), coverage (at least moderate) lagged behind importance (at least moderate) by an average of 21% (SD = 6%). Compared to 2003, a range of evolutionary principles were covered by 4 to 74% more schools. Nearly half (48%) of responders anticipated igniting controversy at their medical school if they added evolution to their curriculum. The teaching resources ranked most useful were model test questions and answers, case studies, and model curricula for existing courses/rotations. Limited resources (faculty expertise) were cited as the major barrier to adding more evolution, but benefits included a deeper understanding and improved patient care.

Conclusion: North American medical schools have increased the evolution content in their curricula over the past decade. However, coverage is not commensurate with importance. At a few medical schools, anticipated controversy impedes teaching more evolution. Efforts to improve evolution education in medical schools should be directed toward boosting faculty expertise and crafting resources that can be easily integrated into existing curricula.

Given a complex geospatial network with nodes distributed in a two-dimensional region of physical space, can the locations of the nodes be determined and their connection patterns be uncovered based solely on data? We consider the realistic situation where time series/signals can be collected from a single location. A key challenge is that the signals collected are necessarily time delayed, due to the varying physical distances from the nodes to the data collection centre. To meet this challenge, we develop a compressive-sensing-based approach enabling reconstruction of the full topology of the underlying geospatial network and more importantly, accurate estimate of the time delays. A standard triangularization algorithm can then be employed to find the physical locations of the nodes in the network. We further demonstrate successful detection of a hidden node (or a hidden source or threat), from which no signal can be obtained, through accurate detection of all its neighbouring nodes. As a geospatial network has the feature that a node tends to connect with geophysically nearby nodes, the localized region that contains the hidden node can be identified.

Recent works revealed that the energy required to control a complex network depends on the number of driving signals and the energy distribution follows an algebraic scaling law. If one implements control using a small number of drivers, e.g. as determined by the structural controllability theory, there is a high probability that the energy will diverge. We develop a physical theory to explain the scaling behaviour through identification of the fundamental structural elements, the longest control chains (LCCs), that dominate the control energy. Based on the LCCs, we articulate a strategy to drastically reduce the control energy (e.g. in a large number of real-world networks). Owing to their structural nature, the LCCs may shed light on energy issues associated with control of nonlinear dynamical networks.

A challenging problem in network science is to control complex networks. In existing frameworks of structural or exact controllability, the ability to steer a complex network toward any desired state is measured by the minimum number of required driver nodes. However, if we implement actual control by imposing input signals on the minimum set of driver nodes, an unexpected phenomenon arises: due to computational or experimental error there is a great probability that convergence to the final state cannot be achieved. In fact, the associated control cost can become unbearably large, effectively preventing actual control from being realized physically. The difficulty is particularly severe when the network is deemed controllable with a small number of drivers. Here we develop a physical controllability framework based on the probability of achieving actual control. Using a recently identified fundamental chain structure underlying the control energy, we offer strategies to turn physically uncontrollable networks into physically controllable ones by imposing slightly augmented set of input signals on properly chosen nodes. Our findings indicate that, although full control can be theoretically guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control cost to achieve physical control.