Sustained deep-tissue voltage recording using a fast indicator evolved for two-photon microscopy.

Genetically encoded voltage indicators are emerging tools for monitoring voltage dynamics with cell-type specificity. However, current indicators enable a narrow range of applications due to poor performance under two-photon microscopy, a method of choice for deep-tissue recording. To improve indicators, we developed a multiparameter high-throughput platform to optimize voltage indicators for two-photon microscopy. Using this system, we identified JEDI-2P, an indicator that is faster, brighter, and more sensitive and photostable than its predecessors. We demonstrate that JEDI-2P can report light-evoked responses in axonal termini of Drosophila interneurons and the dendrites and somata of amacrine cells of isolated mouse retina. JEDI-2P can also optically record the voltage dynamics of individual cortical neurons in awake behaving mice for more than 30 min using both resonant-scanning and ULoVE random-access microscopy. Finally, ULoVE recording of JEDI-2P can robustly detect spikes at depths exceeding 400 µm and report voltage correlations in pairs of neurons.

Efficient Generation of Transcriptomic Profiles by Random Composite Measurements.

RNA profiles are an informative phenotype of cellular and tissue states but can be costly to generate at massive scale. Here, we describe how gene expression levels can be efficiently acquired with random composite measurements-in which abundances are combined in a random weighted sum. We show (1) that the similarity between pairs of expression profiles can be approximated with very few composite measurements; (2) that by leveraging sparse, modular representations of gene expression, we can use random composite measurements to recover high-dimensional gene expression levels (with 100 times fewer measurements than genes); and (3) that it is possible to blindly recover gene expression from composite measurements, even without access to training data. Our results suggest new compressive modalities as a foundation for massive scaling in high-throughput measurements and new insights into the interpretation of high-dimensional data.

A Unifying Theory of Branching Morphogenesis.

The morphogenesis of branched organs remains a subject of abiding interest. Although much is known about the underlying signaling pathways, it remains unclear how macroscopic features of branched organs, including their size, network topology, and spatial patterning, are encoded. Here, we show that, in mouse mammary gland, kidney, and human prostate, these features can be explained quantitatively within a single unifying framework of branching and annihilating random walks. Based on quantitative analyses of large-scale organ reconstructions and proliferation kinetics measurements, we propose that morphogenesis follows from the proliferative activity of equipotent tips that stochastically branch and randomly explore their environment but compete neutrally for space, becoming proliferatively inactive when in proximity with neighboring ducts. These results show that complex branched epithelial structures develop as a self-organized process, reliant upon a strikingly simple but generic rule, without recourse to a rigid and deterministic sequence of genetically programmed events.

Deposited footprints let cells switch between confined, oscillatory, and exploratory migration.

For eukaryotic cells to heal wounds, respond to immune signals, or metastasize, they must migrate, often by adhering to extracellular matrix (ECM). Cells may also deposit ECM components, leaving behind a footprint that influences their crawling. Recent experiments showed that some epithelial cell lines on micropatterned adhesive stripes move persistently in regions they have previously crawled over, where footprints have been formed, but barely advance into unexplored regions, creating an oscillatory migration of increasing amplitude. Here, we explore through mathematical modeling how footprint deposition and cell responses to footprint combine to allow cells to develop oscillation and other complex migratory motions. We simulate cell crawling with a phase field model coupled to a biochemical model of cell polarity, assuming local contact with the deposited footprint activates Rac1, a protein that establishes the cell's front. Depending on footprint deposition rate and response to the footprint, cells on micropatterned lines can display many types of motility, including confined, oscillatory, and persistent motion. On two-dimensional (2D) substrates, we predict a transition between cells undergoing circular motion and cells developing an exploratory phenotype. Small quantitative changes in a cell's interaction with its footprint can completely alter exploration, allowing cells to tightly regulate their motion, leading to different motility phenotypes (confined vs. exploratory) in different cells when deposition or sensing is variable from cell to cell. Consistent with our computational predictions, we find in earlier experimental data evidence of cells undergoing both circular and exploratory motion.

Accurate prediction of discontinuous crack paths in random porous media via a generative deep learning model.

Pore structures provide extra freedoms for the design of porous media, leading to desirable properties, such as high catalytic rate, energy storage efficiency, and specific strength. This unfortunately makes the porous media susceptible to failure. Deep understanding of the failure mechanism in microstructures is a key to customizing high-performance crack-resistant porous media. However, solving the fracture problem of the porous materials is computationally intractable due to the highly complicated configurations of microstructures. To bridge the structural configurations and fracture responses of random porous media, a unique generative deep learning model is developed. A two-step strategy is proposed to deconstruct the fracture process, which sequentially corresponds to elastic deformation and crack propagation. The geometry of microstructure is translated into a scalar of elastic field as an intermediate variable, and then, the crack path is predicted. The neural network precisely characterizes the strong interactions among pore structures, the multiscale behaviors of fracture, and the discontinuous essence of crack propagation. Crack paths in random porous media are accurately predicted by simply inputting the images of targets, without inputting any additional input physical information. The prediction model enjoys an outstanding performance with a prediction accuracy of 90.25% and possesses a robust generalization capability. The accuracy of the present model is a record so far, and the prediction is accomplished within a second. This study opens an avenue to high-throughput evaluation of the fracture behaviors of heterogeneous materials with complex geometries.

Renormalization group analysis of the Anderson model on random regular graphs.

We present a renormalization group (RG) analysis of the problem of Anderson localization on a random regular graph (RRG) which generalizes the RG of Abrahams, Anderson, Licciardello, and Ramakrishnan to infinite-dimensional graphs. The RG equations necessarily involve two parameters (one being the changing connectivity of subtrees), but we show that the one-parameter scaling hypothesis is recovered for sufficiently large system sizes for both eigenstates and spectrum observables. We also explain the nonmonotonic behavior of dynamical and spectral quantities as a function of the system size for values of disorder close to the transition, by identifying two terms in the beta function of the running fractal dimension of different signs and functional dependence. Our theory provides a simple and coherent explanation for the unusual scaling behavior observed in numerical data of the Anderson model on RRG and of many-body localization.

On the surprising effectiveness of a simple matrix exponential derivative approximation, with application to global SARS-CoV-2.

The continuous-time Markov chain (CTMC) is the mathematical workhorse of evolutionary biology. Learning CTMC model parameters using modern, gradient-based methods requires the derivative of the matrix exponential evaluated at the CTMC's infinitesimal generator (rate) matrix. Motivated by the derivative's extreme computational complexity as a function of state space cardinality, recent work demonstrates the surprising effectiveness of a naive, first-order approximation for a host of problems in computational biology. In response to this empirical success, we obtain rigorous deterministic and probabilistic bounds for the error accrued by the naive approximation and establish a "blessing of dimensionality" result that is universal for a large class of rate matrices with random entries. Finally, we apply the first-order approximation within surrogate-trajectory Hamiltonian Monte Carlo for the analysis of the early spread of Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) across 44 geographic regions that comprise a state space of unprecedented dimensionality for unstructured (flexible) CTMC models within evolutionary biology.

Principled and interpretable alignability testing and integration of single-cell data.

Single-cell data integration can provide a comprehensive molecular view of cells, and many algorithms have been developed to remove unwanted technical or biological variations and integrate heterogeneous single-cell datasets. Despite their wide usage, existing methods suffer from several fundamental limitations. In particular, we lack a rigorous statistical test for whether two high-dimensional single-cell datasets are alignable (and therefore should even be aligned). Moreover, popular methods can substantially distort the data during alignment, making the aligned data and downstream analysis difficult to interpret. To overcome these limitations, we present a spectral manifold alignment and inference (SMAI) framework, which enables principled and interpretable alignability testing and structure-preserving integration of single-cell data with the same type of features. SMAI provides a statistical test to robustly assess the alignability between datasets to avoid misleading inference and is justified by high-dimensional statistical theory. On a diverse range of real and simulated benchmark datasets, it outperforms commonly used alignment methods. Moreover, we show that SMAI improves various downstream analyses such as identification of differentially expressed genes and imputation of single-cell spatial transcriptomics, providing further biological insights. SMAI's interpretability also enables quantification and a deeper understanding of the sources of technical confounders in single-cell data.

NetMIM: network-based multi-omics integration with block missingness for biomarker selection and disease outcome prediction.

Compared with analyzing omics data from a single platform, an integrative analysis of multi-omics data provides a more comprehensive understanding of the regulatory relationships among biological features associated with complex diseases. However, most existing frameworks for integrative analysis overlook two crucial aspects of multi-omics data. Firstly, they neglect the known dependencies among biological features that exist in highly credible biological databases. Secondly, most existing integrative frameworks just simply remove the subjects without full omics data to handle block missingness, resulting in decreasing statistical power. To overcome these issues, we propose a network-based integrative Bayesian framework for biomarker selection and disease outcome prediction based on multi-omics data. Our framework utilizes Dirac spike-and-slab variable selection prior to identifying a small subset of biomarkers. The incorporation of gene pathway information improves the interpretability of feature selection. Furthermore, with the strategy in the FBM (stand for "full Bayesian model with missingness") model where missing omics data are augmented via a mechanistic model, our framework handles block missingness in multi-omics data via a data augmentation approach. The real application illustrates that our approach, which incorporates existing gene pathway information and includes subjects without DNA methylation data, results in more interpretable feature selection results and more accurate predictions.

MiRAGE: mining relationships for advanced generative evaluation in drug repositioning.

MOTIVATION: Drug repositioning, the identification of new therapeutic uses for existing drugs, is crucial for accelerating drug discovery and reducing development costs. Some methods rely on heterogeneous networks, which may not fully capture the complex relationships between drugs and diseases. However, integrating diverse biological data sources offers promise for discovering new drug-disease associations (DDAs). Previous evidence indicates that the combination of information would be conducive to the discovery of new DDAs. However, the challenge lies in effectively integrating different biological data sources to identify the most effective drugs for a certain disease based on drug-disease coupled mechanisms. RESULTS: In response to this challenge, we present MiRAGE, a novel computational method for drug repositioning. MiRAGE leverages a three-step framework, comprising negative sampling using hard negative mining, classification employing random forest models, and feature selection based on feature importance. We evaluate MiRAGE on multiple benchmark datasets, demonstrating its superiority over state-of-the-art algorithms across various metrics. Notably, MiRAGE consistently outperforms other methods in uncovering novel DDAs. Case studies focusing on Parkinson's disease and schizophrenia showcase MiRAGE's ability to identify top candidate drugs supported by previous studies. Overall, our study underscores MiRAGE's efficacy and versatility as a computational tool for drug repositioning, offering valuable insights for therapeutic discoveries and addressing unmet medical needs.

Multilevel superposition for deciphering the conformational variability of protein ensembles.

The dynamics and variability of protein conformations are directly linked to their functions. Many comparative studies of X-ray protein structures have been conducted to elucidate the relevant conformational changes, dynamics and heterogeneity. The rapid increase in the number of experimentally determined structures has made comparison an effective tool for investigating protein structures. For example, it is now possible to compare structural ensembles formed by enzyme species, variants or the type of ligands bound to them. In this study, the author developed a multilevel model for estimating two covariance matrices that represent inter- and intra-ensemble variability in the Cartesian coordinate space. Principal component analysis using the two estimated covariance matrices identified the inter-/intra-enzyme variabilities, which seemed to be important for the enzyme functions, with the illustrative examples of cytochrome P450 family 2 enzymes and class A $\beta$-lactamases. In P450, in which each enzyme has its own active site of a distinct size, an active-site motion shared universally between the enzymes was captured as the first principal mode of the intra-enzyme covariance matrix. In this case, the method was useful for understanding the conformational variability after adjusting for the differences between enzyme sizes. The developed method is advantageous in small ensemble-size problems and hence promising for use in comparative studies on experimentally determined structures where ensemble sizes are smaller than those generated, for example, by molecular dynamics simulations.

Fuzzy kernel evidence Random Forest for identifying pseudouridine sites.

Pseudouridine is an RNA modification that is widely distributed in both prokaryotes and eukaryotes, and plays a critical role in numerous biological activities. Despite its importance, the precise identification of pseudouridine sites through experimental approaches poses significant challenges, requiring substantial time and resources.Therefore, there is a growing need for computational techniques that can reliably and quickly identify pseudouridine sites from vast amounts of RNA sequencing data. In this study, we propose fuzzy kernel evidence Random Forest (FKeERF) to identify pseudouridine sites. This method is called PseU-FKeERF, which demonstrates high accuracy in identifying pseudouridine sites from RNA sequencing data. The PseU-FKeERF model selected four RNA feature coding schemes with relatively good performance for feature combination, and then input them into the newly proposed FKeERF method for category prediction. FKeERF not only uses fuzzy logic to expand the original feature space, but also combines kernel methods that are easy to interpret in general for category prediction. Both cross-validation tests and independent tests on benchmark datasets have shown that PseU-FKeERF has better predictive performance than several state-of-the-art methods. This new method not only improves the accuracy of pseudouridine site identification, but also provides a certain reference for disease control and related drug development in the future.

Mutation and evolution: Conceptual possibilities.

Although random mutation is central to models of evolutionary change, a lack of clarity remains regarding the conceptual possibilities for thinking about the nature and role of mutation in evolution. We distinguish several claims at the intersection of mutation, evolution, and directionality and then characterize a previously unrecognized category: complex conditioned mutation. Empirical evidence in support of this category suggests that the historically famous fluctuation test should be revisited, and new experiments should be undertaken with emerging experimental techniques to facilitate detecting mutation rates within specific loci at an ultra-high, individual base pair resolution.

Unveiling order from chaos by approximate 2-localization of random matrices.

Quantum many-body systems are typically endowed with a tensor product structure. A structure they inherited from probability theory, where the probability of two independent events is the product of the probabilities. The tensor product structure of a Hamiltonian thus gives a natural decomposition of the system into independent smaller subsystems. It is interesting to understand whether a given Hamiltonian is compatible with some particular tensor product structure. In particular, we ask, is there a basis in which an arbitrary Hamiltonian has a 2-local form, i.e., it contains only pairwise interactions? Here we show, using analytical and numerical calculations, that a generic Hamiltonian (e.g., a large random matrix) can be approximately written as a linear combination of two-body interaction terms with high precision; that is, the Hamiltonian is 2-local in a carefully chosen basis. Moreover, we show that these Hamiltonians are not fine-tuned, meaning that the spectrum is robust against perturbations of the coupling constants. Finally, by analyzing the adjacency structure of the couplings [Formula: see text], we suggest a possible mechanism for the emergence of geometric locality from quantum chaos.

Approximate message passing from random initialization with applications to Z2 synchronization.

This paper is concerned with the problem of reconstructing an unknown rank-one matrix with prior structural information from noisy observations. While computing the Bayes optimal estimator is intractable in general due to the requirement of computing high-dimensional integrations/summations, Approximate Message Passing (AMP) emerges as an efficient first-order method to approximate the Bayes optimal estimator. However, the theoretical underpinnings of AMP remain largely unavailable when it starts from random initialization, a scheme of critical practical utility. Focusing on a prototypical model called [Formula: see text] synchronization, we characterize the finite-sample dynamics of AMP from random initialization, uncovering its rapid global convergence. Our theory-which is nonasymptotic in nature-in this model unveils the non-necessity of a careful initialization for the success of AMP.

Scattering evidence of positional charge correlations in polyelectrolyte complexes.

Polyelectrolyte complexation plays an important role in materials science and biology. The internal structure of the resultant polyelectrolyte complex (PEC) phase dictates properties such as physical state, response to external stimuli, and dynamics. Small-angle scattering experiments with X-rays and neutrons have revealed structural similarities between PECs and semidilute solutions of neutral polymers, where the total scattering function exhibits an Ornstein-Zernike form. In spite of consensus among different theoretical predictions, the existence of positional correlations between polyanion and polycation charges has not been confirmed experimentally. Here, we present small-angle neutron scattering profiles where the polycation scattering length density is matched to that of the solvent to extract positional correlations among anionic monomers. The polyanion scattering functions exhibit a peak at the inverse polymer screening radius of Coulomb interactions, q* ≈ 0.2 Å-1. This peak, attributed to Coulomb repulsions between the fragments of polyanions and their attractions to polycations, is even more pronounced in the calculated charge scattering function that quantifies positional correlations of all polymer charges within the PEC. Screening of electrostatic interactions by adding salt leads to the gradual disappearance of this correlation peak, and the scattering functions regain an Ornstein-Zernike form. Experimental scattering results are consistent with those calculated from the random phase approximation, a scaling analysis, and molecular simulations.

Are trait-associated genes clustered together in a gene network?

Genome-wide association studies (GWAS) have provided an abundance of information about the genetic variants and their loci that are associated to complex traits and diseases. However, due to linkage disequilibrium (LD) and noncoding regions of loci, it remains a challenge to pinpoint the causal genes. Gene network-based approaches, paired with network diffusion methods, have been proposed to prioritize causal genes and to boost statistical power in GWAS based on the assumption that trait-associated genes are clustered in a gene network. Due to the difficulty in mapping trait-associated variants to genes in GWAS, this assumption has never been directly or rigorously tested empirically. On the other hand, whole exome sequencing (WES) data focuses on the protein-coding regions, directly identifying trait-associated genes. In this study, we tested the assumption by leveraging the recently available exome-based association statistics from the UK Biobank WES data along with two types of networks. We found that almost all trait-associated genes were significantly more proximal to each other than randomly selected genes within both networks. These results support the assumption that trait-associated genes are clustered in gene networks, which can be further leveraged to boost the power of GWAS such as by introducing less stringent p value thresholds.

StrVCTVRE: A supervised learning method to predict the pathogenicity of human genome structural variants.

Whole-genome sequencing resolves many clinical cases where standard diagnostic methods have failed. However, at least half of these cases remain unresolved after whole-genome sequencing. Structural variants (SVs; genomic variants larger than 50 base pairs) of uncertain significance are the genetic cause of a portion of these unresolved cases. As sequencing methods using long or linked reads become more accessible and SV detection algorithms improve, clinicians and researchers are gaining access to thousands of reliable SVs of unknown disease relevance. Methods to predict the pathogenicity of these SVs are required to realize the full diagnostic potential of long-read sequencing. To address this emerging need, we developed StrVCTVRE to distinguish pathogenic SVs from benign SVs that overlap exons. In a random forest classifier, we integrated features that capture gene importance, coding region, conservation, expression, and exon structure. We found that features such as expression and conservation are important but are absent from SV classification guidelines. We leveraged multiple resources to construct a size-matched training set of rare, putatively benign and pathogenic SVs. StrVCTVRE performs accurately across a wide SV size range on independent test sets, which will allow clinicians and researchers to eliminate about half of SVs from consideration while retaining a 90% sensitivity. We anticipate clinicians and researchers will use StrVCTVRE to prioritize SVs in probands where no SV is immediately compelling, empowering deeper investigation into novel SVs to resolve cases and understand new mechanisms of disease. StrVCTVRE runs rapidly and is publicly available.

Simultaneous clustering and estimation of networks in multiple graphical models.

Gaussian graphical models are widely used to study the dependence structure among variables. When samples are obtained from multiple conditions or populations, joint analysis of multiple graphical models are desired due to their capacity to borrow strength across populations. Nonetheless, existing methods often overlook the varying levels of similarity between populations, leading to unsatisfactory results. Moreover, in many applications, learning the population-level clustering structure itself is of particular interest. In this article, we develop a novel method, called Simultaneous Clustering and Estimation of Networks via Tensor decomposition (SCENT), that simultaneously clusters and estimates graphical models from multiple populations. Precision matrices from different populations are uniquely organized as a three-way tensor array, and a low-rank sparse model is proposed for joint population clustering and network estimation. We develop a penalized likelihood method and an augmented Lagrangian algorithm for model fitting. We also establish the clustering accuracy and norm consistency of the estimated precision matrices. We demonstrate the efficacy of the proposed method with comprehensive simulation studies. The application to the Genotype-Tissue Expression multi-tissue gene expression data provides important insights into tissue clustering and gene coexpression patterns in multiple brain tissues.

A joint normal-ordinal (probit) model for ordinal and continuous longitudinal data.

In biomedical studies, continuous and ordinal longitudinal variables are frequently encountered. In many of these studies it is of interest to estimate the effect of one of these longitudinal variables on the other. Time-dependent covariates have, however, several limitations; they can, for example, not be included when the data is not collected at fixed intervals. The issues can be circumvented by implementing joint models, where two or more longitudinal variables are treated as a response and modeled with a correlated random effect. Next, by conditioning on these response(s), we can study the effect of one or more longitudinal variables on another. We propose a normal-ordinal(probit) joint model. First, we derive closed-form formulas to estimate the model-based correlations between the responses on their original scale. In addition, we derive the marginal model, where the interpretation is no longer conditional on the random effects. As a consequence, we can make predictions for a subvector of one response conditional on the other response and potentially a subvector of the history of the response. Next, we extend the approach to a high-dimensional case with more than two ordinal and/or continuous longitudinal variables. The methodology is applied to a case study where, among others, a longitudinal ordinal response is predicted with a longitudinal continuous variable.