Autologous transplantation of hematopoietic stem and progenitor cells lentivirally labeled with unique oligonucleotide barcodes flanked by sequencing primer targets enables quantitative assessment of the self-renewal and differentiation patterns of these cells in a myeloablative rhesus macaque model. Compared with other approaches to clonal tracking, this approach is highly quantitative and reproducible. We documented stable multipotent long-term hematopoietic clonal output of monocytes, granulocytes, B cells, and T cells from a polyclonal pool of hematopoietic stem and progenitor cells in 4 macaques observed for up to 49 months posttransplantation. A broad range of clonal behaviors characterized by contribution level and biases toward certain cell types were extremely stable over time. Correlations between granulocyte and monocyte clonalities were greatest, followed by correlations between these cell types and B cells. We also detected quantitative expansion of T cell–biased clones consistent with an adaptive immune response. In contrast to recent data from a nonquantitative murine model, there was little evidence for clonal succession after initial hematopoietic reconstitution. These findings have important implications for human hematopoiesis, given the similarities between macaque and human physiologies. Publisher9s Note: There is an Inside Blood Commentary on this article in this issue. Key Points Output from individual rhesus macaque hematopoietic stem and progenitor cells is stable for years, with little evidence of clonal succession. Individual clones may display stable myeloid or lymphoid bias for many years.
18 August 2020 in Journal of the American Statistical Association
We propose a generative model and an inference scheme for epidemic processes on dynamic, adaptive contact networks. Network evolution is formulated as a link-Markovian process, which is then coupled to an individual-level stochastic SIR model, in order to describe the interplay between the dynamics of the disease spread and the contact network underlying the epidemic. A Markov chain Monte Carlo framework is developed for likelihood-based inference from partial epidemic observations, with a novel data augmentation algorithm specifically designed to deal with missing individual recovery times under the dynamic network setting. Through a series of simulation experiments, we demonstrate the validity and flexibility of the model as well as the efficacy and efficiency of the data augmentation inference scheme. The model is also applied to a recent real-world dataset on influenza-like-illness transmission with high-resolution social contact tracking records.
Rod photoreceptor degeneration causes deterioration in the morphology and physiology of cone photoreceptors along with changes in retinal circuits. These changes could diminish visual signaling at cone-mediated light levels, thereby limiting the efficacy of treatments such as gene therapy for rescuing normal, cone-mediated vision. However, the impact of progressive rod death on cone-mediated signaling remains unclear. To investigate the fidelity of retinal ganglion cell (RGC) signaling throughout disease progression, we used a mouse model of rod degeneration (Cngb1neo/neo). Despite clear deterioration of cone morphology with rod death, cone-mediated signaling among RGCs remained surprisingly robust: spatiotemporal receptive fields changed little and the mutual information between stimuli and spiking responses was relatively constant. This relative stability held until nearly all rods had died and cones had completely lost well-formed outer segments. Interestingly, RGC information rates were higher and more stable for natural movies than checkerboard noise as degeneration progressed. The main change in RGC responses with photoreceptor degeneration was a decrease in response gain. These results suggest that gene therapies for rod degenerative diseases are likely to prolong cone-mediated vision even if there are changes to cone morphology and density.
2 August 2018 in Computational Optimization and Applications
Summary: This paper addresses the task of estimating a covariance matrix under a patternless sparsity assumption. In contrast to existing approaches based on thresholding or shrinkage penalties, we propose a likelihood-based method that regularizes the distance from the covariance estimate to a symmetric sparsity set. This formulation avoids unwanted shrinkage induced by more common norm penalties, and enables optimization of the resulting nonconvex objective by solving a sequence of smooth, unconstrained subproblems. These subproblems are generated and solved via the proximal distance version of the majorization-minimization principle. The resulting algorithm executes rapidly, gracefully handles settings where the number of parameters exceeds the number of cases, yields a positive-definite solution, and enjoys desirable convergence properties. Empirically, we demonstrate that our approach outperforms competing methods across several metrics, for a suite of simulated experiments. Its merits are illustrated on international migration data and a case study on flow cytometry. Our findings suggest that the marginal and conditional dependency networks for the cell signalling data are more similar than previously concluded.
5 December 2024 in Journal of the American Statistical Association
Factor analysis provides a canonical framework for imposing lower-dimensional structure such as sparse covariance in high-dimensional data. High-dimensional data on the same set of variables are often collected under different conditions, for instance in reproducing studies across research groups. In such cases, it is natural to seek to learn the shared versus condition-specific structure. Existing hierarchical extensions of factor analysis have been proposed, but face practical issues including identifiability problems. To address these shortcomings, we propose a class of SUbspace Factor Analysis (SUFA) models, which characterize variation across groups at the level of a lower-dimensional subspace. We prove that the proposed class of SUFA models lead to identifiability of the shared versus group-specific components of the covariance, and study their posterior contraction properties. Taking a Bayesian approach, these contributions are developed alongside efficient posterior computation algorithms. Our sampler fully integrates out latent variables, is easily parallelizable and has complexity that does not depend on sample size. We illustrate the methods through application to integration of multiple gene expression datasets relevant to immunology.