The cerebral arterial network covering the brain cortex has multiscale anastomosis structures with sparse intermediate anastomoses (O[102] μm in diameter) and dense pial networks (O[101] μm in diameter). Recent studies indicate that collateral blood supply by cerebral arterial anastomoses has an essential role in the prognosis of acute ischemic stroke caused by large vessel occlusion. However, the physiological importance of these multiscale morphological properties-and especially of intermediate anastomoses-is poorly understood because of innate structural complexities. In this study, a computational model of multiscale anastomoses in whole-brain-scale cerebral arterial networks was developed and used to evaluate collateral blood supply by anastomoses during middle cerebral artery occlusion. Morphologically validated cerebral arterial networks were constructed by combining medical imaging data and mathematical modeling. Sparse intermediate anastomoses were assigned between adjacent main arterial branches; the pial arterial network was modeled as a dense network structure. Blood flow distributions in the arterial network during middle cerebral artery occlusion simulations were computed. Collateral blood supply by intermediate anastomoses increased sharply with increasing numbers of anastomoses and provided one-order-higher flow recoveries to the occluded region (15%-30%) compared with simulations using a pial network only, even with a small number of intermediate anastomoses (≤10). These findings demonstrate the importance of sparse intermediate anastomoses, which are generally considered redundant structures in cerebral infarction, and provide insights into the physiological significance of the multiscale properties of arterial anastomoses.

Brain models typically focus either on low-level biological detail or on qualitative behavioral effects. In contrast, we present a biologically-plausible spiking-neuron model of associative learning and recognition that accounts for both human behavior and low-level brain activity across the whole task. Based on cognitive theories and insights from machine-learning analyses of M/EEG data, the model proceeds through five processing stages: stimulus encoding, familiarity judgement, associative retrieval, decision making, and motor response. The results matched human response times and source-localized MEG data in occipital, temporal, prefrontal, and precentral brain regions; as well as a classic fMRI effect in prefrontal cortex. This required two main conceptual advances: a basal-ganglia-thalamus action-selection system that relies on brief thalamic pulses to change the functional connectivity of the cortex, and a new unsupervised learning rule that causes very strong pattern separation in the hippocampus. The resulting model shows how low-level brain activity can result in goal-directed cognitive behavior in humans.

Integrating sensory information during movement and adapting motor plans over successive movements are both essential for accurate, flexible motor behaviour. When an ongoing movement is off target, feedback control mechanisms update the descending motor commands to counter the sensed error. Over longer timescales, errors induce adaptation in feedforward planning so that future movements become more accurate and require less online adjustment from feedback control processes. Both the degree to which sensory feedback is integrated into an ongoing movement and the degree to which movement errors drive adaptive changes in feedforward motor plans have been shown to scale inversely with sensory uncertainty. However, since these processes have only been studied in isolation from one another, little is known about how they are influenced by sensory uncertainty in real-world movement contexts where they co-occur. Here, we show that sensory uncertainty may impact feedforward adaptation of reaching movements differently when feedback integration is present versus when it is absent. In particular, participants gradually adjust their movements from trial-to-trial in a manner that is well characterised by a slow and consistent envelope of error reduction. Riding on top of this slow envelope, participants exhibit large and abrupt changes in their initial movement vectors that are strongly correlated with the degree of sensory uncertainty present on the previous trial. However, these abrupt changes are insensitive to the magnitude and direction of the sensed movement error. These results prompt important questions for current models of sensorimotor learning under uncertainty and open up new avenues for future exploration in the field.

Accurate prediction of nucleic binding residues is essential for the understanding of transcription and translation processes. Integration of feature- and template-based strategies could improve the prediction of these key residues in proteins. Nevertheless, traditional hybrid algorithms have been surpassed by recently developed deep learning-based methods, and the possibility of integrating deep learning- and template-based approaches to improve performance remains to be explored. To address these issues, we developed a novel structure-based integrative algorithm called NABind that can accurately predict DNA- and RNA-binding residues. A deep learning module was built based on the diversified sequence and structural descriptors and edge aggregated graph attention networks, while a template module was constructed by transforming the alignments between the query and its multiple templates into features for supervised learning. Furthermore, the stacking strategy was adopted to integrate the above two modules for improving prediction performance. Finally, a post-processing module dependent on the random walk algorithm was proposed to further correct the integrative predictions. Extensive evaluations indicated that our approach could not only achieve excellent performance on both native and predicted structures but also outperformed existing hybrid algorithms and recent deep learning methods. The NABind server is available at http://liulab.hzau.edu.cn/NABind/.

Chronic Pseudomonas aeruginosa (Pa) lung infections are the leading cause of mortality among cystic fibrosis (CF) patients; therefore, the eradication of new-onset Pa lung infections is an important therapeutic goal that can have long-term health benefits. The use of early antibiotic eradication therapy (AET) has been shown to clear the majority of new-onset Pa infections, and it is hoped that identifying the underlying basis for AET failure will further improve treatment outcomes. Here we generated machine learning models to predict AET outcomes based on pathogen genomic data. We used a nested cross validation design, population structure control, and recursive feature selection to improve model performance and showed that incorporating population structure control was crucial for improving model interpretation and generalizability. Our best model, controlling for population structure and using only 30 recursively selected features, had an area under the curve of 0.87 for a holdout test dataset. The top-ranked features were generally associated with motility, adhesion, and biofilm formation.

The ability of the brain to represent the external world in real-time is impacted by the fact that neural processing takes time. Because neural delays accumulate as information progresses through the visual system, representations encoded at each hierarchical level are based upon input that is progressively outdated with respect to the external world. This 'representational lag' is particularly relevant to the task of localizing a moving object-because the object's location changes with time, neural representations of its location potentially lag behind its true location. Converging evidence suggests that the brain has evolved mechanisms that allow it to compensate for its inherent delays by extrapolating the position of moving objects along their trajectory. We have previously shown how spike-timing dependent plasticity (STDP) can achieve motion extrapolation in a two-layer, feedforward network of velocity-tuned neurons, by shifting the receptive fields of second layer neurons in the opposite direction to a moving stimulus. The current study extends this work by implementing two important changes to the network to bring it more into line with biology: we expanded the network to multiple layers to reflect the depth of the visual hierarchy, and we implemented more realistic synaptic time-courses. We investigate the accumulation of STDP-driven receptive field shifts across several layers, observing a velocity-dependent reduction in representational lag. These results highlight the role of STDP, operating purely along the feedforward pathway, as a developmental strategy for delay compensation.

African horse sickness is an equine orbivirus transmitted by Culicoides Latreille biting midges. In the last 80 years, it has caused several devastating outbreaks in the equine population in Europe, the Far and Middle East, North Africa, South-East Asia, and sub-Saharan Africa. The disease is endemic in South Africa; however, a unique control area has been set up in the Western Cape where increased surveillance and control measures have been put in place. A deterministic metapopulation model was developed to explore if an outbreak might occur, and how it might develop, if a latently infected horse was to be imported into the control area, by varying the geographical location and months of import. To do this, a previously published ordinary differential equation model was developed with a metapopulation approach and included a vaccinated horse population. Outbreak length, time to peak infection, number of infected horses at the peak, number of horses overall affected (recovered or dead), re-emergence, and Rv (the basic reproduction number in the presence of vaccination) were recorded and displayed using GIS mapping. The model predictions were compared to previous outbreak data to ensure validity. The warmer months (November to March) had longer outbreaks than the colder months (May to September), took more time to reach the peak, and had a greater total outbreak size with more horses infected at the peak. Rv appeared to be a poor predictor of outbreak dynamics for this simulation. A sensitivity analysis indicated that control measures such as vaccination and vector control are potentially effective to manage the spread of an outbreak, and shortening the vaccination window to July to September may reduce the risk of vaccine-associated outbreaks.

Understanding the underlying dynamical mechanisms of the brain and controlling it is a crucial issue in brain science. The energy landscape and transition path approach provides a possible route to address these challenges. Here, taking working memory as an example, we quantified its landscape based on a large-scale macaque model. The working memory function is governed by the change of landscape and brain-wide state switching in response to the task demands. The kinetic transition path reveals that information flow follows the direction of hierarchical structure. Importantly, we propose a landscape control approach to manipulate brain state transition by modulating external stimulation or inter-areal connectivity, demonstrating the crucial roles of associative areas, especially prefrontal and parietal cortical areas in working memory performance. Our findings provide new insights into the dynamical mechanism of cognitive function, and the landscape control approach helps to develop therapeutic strategies for brain disorders.

Here, we introduce Trackplot, a Python package for generating publication-quality visualization by a programmable and interactive web-based approach. Compared to the existing versions of programs generating sashimi plots, Trackplot offers a versatile platform for visually interpreting genomic data from a wide variety of sources, including gene annotation with functional domain mapping, isoform expression, isoform structures identified by scRNA-seq and long-read sequencing, as well as chromatin accessibility and architecture without any preprocessing, and also offers a broad degree of flexibility for formats of output files that satisfy the requirements of major journals. The Trackplot package is an open-source software which is freely available on Bioconda (https://anaconda.org/bioconda/trackplot), Docker (https://hub.docker.com/r/ygidtu/trackplot), PyPI (https://pypi.org/project/trackplot/) and GitHub (https://github.com/ygidtu/trackplot), and a built-in web server for local deployment is also provided.

Heterogeneity in contact patterns, mortality rates, and transmissibility among and between different age classes can have significant effects on epidemic outcomes. Adaptive behavior in response to the spread of an infectious pathogen may give rise to complex epidemiological dynamics. Here we model an infectious disease in which adaptive behavior incentives, and mortality rates, can vary between two and three age classes. The model indicates that age-dependent variability in infection aversion can produce more complex epidemic dynamics at lower levels of pathogen transmissibility and that those at less risk of infection can still drive complexity in the dynamics of those at higher risk of infection. Policymakers should consider the interdependence of such heterogeneous groups when making decisions.

Many therapies in clinical trials are based on single drug-single target relationships. To further extend this concept to multi-target approaches using multi-targeted drugs, we developed a machine learning pipeline to unravel the target landscape of kinase inhibitors. This pipeline, which we call 3D-KINEssence, uses a new type of protein fingerprints (3D FP) based on the structure of kinases generated through a 3D convolutional neural network (3D-CNN). These 3D-CNN kinase fingerprints were matched to molecular Morgan fingerprints to predict the targets of each respective kinase inhibitor based on available bioactivity data. The performance of the pipeline was evaluated on two test sets: a sparse drug-target set where each drug is matched in most cases to a single target and also on a densely-covered drug-target set where each drug is matched to most if not all targets. This latter set is more challenging to train, given its non-exclusive character. Our model's root-mean-square error (RMSE) based on the two datasets was 0.68 and 0.8, respectively. These results indicate that 3D FP can predict the target landscape of kinase inhibitors at around 0.8 log units of bioactivity. Our strategy can be utilized in proteochemometric or chemogenomic workflows by consolidating the target landscape of kinase inhibitors.

Propagating waves of activity can be evoked and can occur spontaneously in vivo and in vitro in cerebral cortex. These waves are thought to be instrumental in the propagation of information across cortical regions and as a means to modulate the sensitivity of neurons to subsequent stimuli. In normal tissue, the waves are sparse and tightly controlled by inhibition and other negative feedback processes. However, alterations of this balance between excitation and inhibition can lead to pathological behavior such as seizure-type dynamics (with low inhibition) or failure to propagate (with high inhibition). We develop a spiking one-dimensional network of neurons to explore the reliability and control of evoked waves and compare this to a cortical slice preparation where the excitability can be pharmacologically manipulated. We show that the waves enhance sensitivity of the cortical network to stimuli in specific spatial and temporal ways. To gain further insight into the mechanisms of propagation and transitions to pathological behavior, we derive a mean-field model for the synaptic activity. We analyze the mean-field model and a piece-wise constant approximation of it and study the stability of the propagating waves as spatial and temporal properties of the inhibition are altered. We show that that the transition to seizure-like activity is gradual but that the loss of propagation is abrupt and can occur via either the loss of existence of the wave or through a loss of stability leading to complex patterns of propagation.

Intensive care medicine is complex and resource-demanding. A critical and common challenge lies in inferring the underlying physiological state of a patient from partially observed data. Specifically for the cardiovascular system, clinicians use observables such as heart rate, arterial and venous blood pressures, as well as findings from the physical examination and ancillary tests to formulate a mental model and estimate hidden variables such as cardiac output, vascular resistance, filling pressures and volumes, and autonomic tone. Then, they use this mental model to derive the causes for instability and choose appropriate interventions. Not only this is a very hard problem due to the nature of the signals, but it also requires expertise and a clinician's ongoing presence at the bedside. Clinical decision support tools based on mechanistic dynamical models offer an appealing solution due to their inherent explainability, corollaries to the clinical mental process, and predictive power. With a translational motivation in mind, we developed iCVS: a simple, with high explanatory power, dynamical mechanistic model to infer hidden cardiovascular states. Full model estimation requires no prior assumptions on physiological parameters except age and weight, and the only inputs are arterial and venous pressure waveforms. iCVS also considers autonomic and non-autonomic modulations. To gain more information without increasing model complexity, both slow and fast timescales of the blood pressure traces are exploited, while the main inference and dynamic evolution are at the longer, clinically relevant, timescale of minutes. iCVS is designed to allow bedside deployment at pediatric and adult intensive care units and for retrospective investigation of cardiovascular mechanisms underlying instability. In this paper, we describe iCVS and inference system in detail, and using a dataset of critically-ill children, we provide initial indications to its ability to identify bleeding, distributive states, and cardiac dysfunction, in isolation and in combination.

Food webs are complex ecological networks whose structure is both ecologically and statistically constrained, with many network properties being correlated with each other. Despite the recognition of these invariable relationships in food webs, the use of the principle of maximum entropy (MaxEnt) in network ecology is still rare. This is surprising considering that MaxEnt is a statistical tool precisely designed for understanding and predicting many types of constrained systems. This principle asserts that the least-biased probability distribution of a system's property, constrained by prior knowledge about that system, is the one with maximum information entropy. MaxEnt has been proven useful in many ecological modeling problems, but its application in food webs and other ecological networks is limited. Here we show how MaxEnt can be used to derive many food-web properties both analytically and heuristically. First, we show how the joint degree distribution (the joint probability distribution of the numbers of prey and predators for each species in the network) can be derived analytically using the number of species and the number of interactions in food webs. Second, we present a heuristic and flexible approach of finding a network's adjacency matrix (the network's representation in matrix format) based on simulated annealing and SVD entropy. We built two heuristic models using the connectance and the joint degree sequence as statistical constraints, respectively. We compared both models' predictions against corresponding null and neutral models commonly used in network ecology using open access data of terrestrial and aquatic food webs sampled globally (N = 257). We found that the heuristic model constrained by the joint degree sequence was a good predictor of many measures of food-web structure, especially the nestedness and motifs distribution. Specifically, our results suggest that the structure of terrestrial and aquatic food webs is mainly driven by their joint degree distribution.

It is increasingly apparent that cancer cells, in addition to remodelling their metabolism to survive and proliferate, adapt and manipulate the metabolism of other cells. This property may be a telling sign that pre-clinical tumour metabolism studies exclusively utilising in-vitro mono-culture models could prove to be limited for uncovering novel metabolic targets able to translate into clinical therapies. Although this is increasingly recognised, and work towards addressing the issue is becoming routinary much remains poorly understood. For instance, knowledge regarding the biochemical mechanisms through which cancer cells manipulate non-cancerous cell metabolism, and the subsequent impact on their survival and proliferation remains limited. Additionally, the variations in these processes across different cancer types and progression stages, and their implications for therapy, also remain largely unexplored. This study employs an interdisciplinary approach that leverages the predictive power of mathematical modelling to enrich experimental findings. We develop a functional multicellular in-silico model that facilitates the qualitative and quantitative analysis of the metabolic network spawned by an in-vitro co-culture model of bone marrow mesenchymal stem- and myeloma cell lines. To procure this model, we devised a bespoke human genome constraint-based reconstruction workflow that combines aspects from the legacy mCADRE & Metabotools algorithms, the novel redHuman algorithm, along with 13C-metabolic flux analysis. Our workflow transforms the latest human metabolic network matrix (Recon3D) into two cell-specific models coupled with a metabolic network spanning a shared growth medium. When cross-validating our in-silico model against the in-vitro model, we found that the in-silico model successfully reproduces vital metabolic behaviours of its in-vitro counterpart; results include cell growth predictions, respiration rates, as well as support for observations which suggest cross-shuttling of redox-active metabolites between cells.

In reversal learning tasks, the behavior of humans and animals is often assumed to be uniform within single experimental sessions to facilitate data analysis and model fitting. However, behavior of agents can display substantial variability in single experimental sessions, as they execute different blocks of trials with different transition dynamics. Here, we observed that in a deterministic reversal learning task, mice display noisy and sub-optimal choice transitions even at the expert stages of learning. We investigated two sources of the sub-optimality in the behavior. First, we found that mice exhibit a high lapse rate during task execution, as they reverted to unrewarded directions after choice transitions. Second, we unexpectedly found that a majority of mice did not execute a uniform strategy, but rather mixed between several behavioral modes with different transition dynamics. We quantified the use of such mixtures with a state-space model, block Hidden Markov Model (block HMM), to dissociate the mixtures of dynamic choice transitions in individual blocks of trials. Additionally, we found that blockHMM transition modes in rodent behavior can be accounted for by two different types of behavioral algorithms, model-free or inference-based learning, that might be used to solve the task. Combining these approaches, we found that mice used a mixture of both exploratory, model-free strategies and deterministic, inference-based behavior in the task, explaining their overall noisy choice sequences. Together, our combined computational approach highlights intrinsic sources of noise in rodent reversal learning behavior and provides a richer description of behavior than conventional techniques, while uncovering the hidden states that underlie the block-by-block transitions.

Growing evidence indicates that only a sparse subset from a pool of sensory neurons is active for the encoding of visual stimuli at any instant in time. Traditionally, to replicate such biological sparsity, generative models have been using the ℓ1 norm as a penalty due to its convexity, which makes it amenable to fast and simple algorithmic solvers. In this work, we use biological vision as a test-bed and show that the soft thresholding operation associated to the use of the ℓ1 norm is highly suboptimal compared to other functions suited to approximating ℓp with 0 ≤ p < 1 (including recently proposed continuous exact relaxations), in terms of performance. We show that ℓ1 sparsity employs a pool with more neurons, i.e. has a higher degree of overcompleteness, in order to maintain the same reconstruction error as the other methods considered. More specifically, at the same sparsity level, the thresholding algorithm using the ℓ1 norm as a penalty requires a dictionary of ten times more units compared to the proposed approach, where a non-convex continuous relaxation of the ℓ0 pseudo-norm is used, to reconstruct the external stimulus equally well. At a fixed sparsity level, both ℓ0- and ℓ1-based regularization develop units with receptive field (RF) shapes similar to biological neurons in V1 (and a subset of neurons in V2), but ℓ0-based regularization shows approximately five times better reconstruction of the stimulus. Our results in conjunction with recent metabolic findings indicate that for V1 to operate efficiently it should follow a coding regime which uses a regularization that is closer to the ℓ0 pseudo-norm rather than the ℓ1 one, and suggests a similar mode of operation for the sensory cortex in general.

Mathematical and statistical models can be used to make predictions of how epidemics may progress in the near future and form a central part of outbreak mitigation and control. Renewal equation based models allow inference of epidemiological parameters from historical data and forecast future epidemic dynamics without requiring complex mechanistic assumptions. However, these models typically ignore interaction between age groups, partly due to challenges in parameterising a time varying interaction matrix. Social contact data collected regularly during the COVID-19 epidemic provide a means to inform interaction between age groups in real-time. We developed an age-specific forecasting framework and applied it to two age-stratified time-series: incidence of SARS-CoV-2 infection, estimated from a national infection and antibody prevalence survey; and, reported cases according to the UK national COVID-19 dashboard. Jointly fitting our model to social contact data from the CoMix study, we inferred a time-varying next generation matrix which we used to project infections and cases in the four weeks following each of 29 forecast dates between October 2020 and November 2021. We evaluated the forecasts using proper scoring rules and compared performance with three other models with alternative data and specifications alongside two naive baseline models. Overall, incorporating age interaction improved forecasts of infections and the CoMix-data-informed model was the best performing model at time horizons between two and four weeks. However, this was not true when forecasting cases. We found that age group interaction was most important for predicting cases in children and older adults. The contact-data-informed models performed best during the winter months of 2020-2021, but performed comparatively poorly in other periods. We highlight challenges regarding the incorporation of contact data in forecasting and offer proposals as to how to extend and adapt our approach, which may lead to more successful forecasts in future.

To behave adaptively, animals must learn to predict future reward, or value. To do this, animals are thought to learn reward predictions using reinforcement learning. However, in contrast to classical models, animals must learn to estimate value using only incomplete state information. Previous work suggests that animals estimate value in partially observable tasks by first forming "beliefs"-optimal Bayesian estimates of the hidden states in the task. Although this is one way to solve the problem of partial observability, it is not the only way, nor is it the most computationally scalable solution in complex, real-world environments. Here we show that a recurrent neural network (RNN) can learn to estimate value directly from observations, generating reward prediction errors that resemble those observed experimentally, without any explicit objective of estimating beliefs. We integrate statistical, functional, and dynamical systems perspectives on beliefs to show that the RNN's learned representation encodes belief information, but only when the RNN's capacity is sufficiently large. These results illustrate how animals can estimate value in tasks without explicitly estimating beliefs, yielding a representation useful for systems with limited capacity.

We have developed Simulation-based Reconstructed Diffusion (SbRD) to determine diffusion coefficients corrected for confinement effects and for the bias introduced by two-dimensional models describing a three-dimensional motion. We validate the method on simulated diffusion data in three-dimensional cell-shaped compartments. We use SbRD, combined with a new cell detection method, to determine the diffusion coefficients of a set of native proteins in Escherichia coli. We observe slower diffusion at the cell poles than in the nucleoid region of exponentially growing cells, which is independent of the presence of polysomes. Furthermore, we show that the newly formed pole of dividing cells exhibits a faster diffusion than the old one. We hypothesize that the observed slowdown at the cell poles is caused by the accumulation of aggregated or damaged proteins, and that the effect is asymmetric due to cell aging.

Several competing neuro-computational theories of autism have emerged from predictive coding models of the brain. To disentangle their subtly different predictions about the nature of atypicalities in autistic perception, we performed computational modelling of two sensorimotor tasks: the predictive use of manual gripping forces during object lifting and anticipatory eye movements during a naturalistic interception task. In contrast to some accounts, we found no evidence of chronic atypicalities in the use of priors or weighting of sensory information during object lifting. Differences in prior beliefs, rates of belief updating, and the precision weighting of prediction errors were, however, observed for anticipatory eye movements. Most notably, we observed autism-related difficulties in flexibly adapting learning rates in response to environmental change (i.e., volatility). These findings suggest that atypical encoding of precision and context-sensitive adjustments provide a better explanation of autistic perception than generic attenuation of priors or persistently high precision prediction errors. Our results did not, however, support previous suggestions that autistic people perceive their environment to be persistently volatile.

T lymphocytes migrate into organs and interact with local cells to perform their functions. How human T lymphocytes communicate with organ-specific cells and participate in pathobiological processes remains unresolved. Brain infiltration of T lymphocytes is associated with multiple neurological disorders. Thus, to characterize the behavior of human T lymphocytes reaching the human brain, we performed time-lapse microscopy on human CD8+ T lymphocytes co-cultured with either primary human astrocytes or neurons. Using traditional manual and visual assessment of microscopy data, we identified distinct CD8+ T lymphocyte motility behaviors. However, such characterization is time and labor-intensive. In this work, we trained and validated a machine-learning model for the automated classification of behaviors of CD8+ T lymphocytes interacting with astrocytes and neurons. A balanced random forest was trained for the binary classification of established classes of cell behaviors (synapse vs. kinapse) as well as visually identified behaviors (scanning, dancing, and poking). Feature selection was performed during 3-fold cross-validation using the minimum redundancy maximum relevance algorithm. Results show promising performances when tested on a held-out dataset of CD8+ T lymphocytes interacting with astrocytes with a new experimenter and a held-out independent dataset of CD8+ T lymphocytes interacting with neurons. When tested on the independent CD8+ T cell-neuron dataset, the final model achieved a binary classification accuracy of 0.82 and a 3-class accuracy of 0.79. This novel automated classification approach could significantly reduce the time required to label cell motility behaviors while facilitating the identification of interactions of T lymphocytes with multiple cell types.

Different genes form complex networks within cells to carry out critical cellular functions, while network alterations in this process can potentially introduce downstream transcriptome perturbations and phenotypic variations. Therefore, developing efficient and interpretable methods to quantify network changes and pinpoint driver genes across conditions is crucial. We propose a hierarchical graph representation learning method, called iHerd. Given a set of networks, iHerd first hierarchically generates a series of coarsened sub-graphs in a data-driven manner, representing network modules at different resolutions (e.g., the level of signaling pathways). Then, it sequentially learns low-dimensional node representations at all hierarchical levels via efficient graph embedding. Lastly, iHerd projects separate gene embeddings onto the same latent space in its graph alignment module to calculate a rewiring index for driver gene prioritization. To demonstrate its effectiveness, we applied iHerd on a tumor-to-normal GRN rewiring analysis and cell-type-specific GCN analysis using single-cell multiome data of the brain. We showed that iHerd can effectively pinpoint novel and well-known risk genes in different diseases. Distinct from existing models, iHerd's graph coarsening for hierarchical learning allows us to successfully classify network driver genes into early and late divergent genes (EDGs and LDGs), emphasizing genes with extensive network changes across and within signaling pathway levels. This unique approach for driver gene classification can provide us with deeper molecular insights. The code is freely available at https://github.com/aicb-ZhangLabs/iHerd. All other relevant data are within the manuscript and it supporting information files.

The study of protein folding mechanism is a challenge in molecular biology, which is of great significance for revealing the movement rules of biological macromolecules, understanding the pathogenic mechanism of folding diseases, and designing protein engineering materials. Based on the hypothesis that the conformational sampling trajectory contain the information of folding pathway, we propose a protein folding pathway prediction algorithm named Pathfinder. Firstly, Pathfinder performs large-scale sampling of the conformational space and clusters the decoys obtained in the sampling. The heterogeneous conformations obtained by clustering are named seed states. Then, a resampling algorithm that is not constrained by the local energy basin is designed to obtain the transition probabilities of seed states. Finally, protein folding pathways are inferred from the maximum transition probabilities of seed states. The proposed Pathfinder is tested on our developed test set (34 proteins). For 11 widely studied proteins, we correctly predicted their folding pathways and specifically analyzed 5 of them. For 13 proteins, we predicted their folding pathways to be further verified by biological experiments. For 6 proteins, we analyzed the reasons for the low prediction accuracy. For the other 4 proteins without biological experiment results, potential folding pathways were predicted to provide new insights into protein folding mechanism. The results reveal that structural analogs may have different folding pathways to express different biological functions, homologous proteins may contain common folding pathways, and α-helices may be more prone to early protein folding than β-strands.

Biomolecular condensates are important structures in various cellular processes but are challenging to study using traditional experimental techniques. In silico simulations with residue-level coarse-grained models strike a balance between computational efficiency and chemical accuracy. They could offer valuable insights by connecting the emergent properties of these complex systems with molecular sequences. However, existing coarse-grained models often lack easy-to-follow tutorials and are implemented in software that is not optimal for condensate simulations. To address these issues, we introduce OpenABC, a software package that greatly simplifies the setup and execution of coarse-grained condensate simulations with multiple force fields using Python scripting. OpenABC seamlessly integrates with the OpenMM molecular dynamics engine, enabling efficient simulations with performance on a single GPU that rivals the speed achieved by hundreds of CPUs. We also provide tools that convert coarse-grained configurations to all-atom structures for atomistic simulations. We anticipate that OpenABC will significantly facilitate the adoption of in silico simulations by a broader community to investigate the structural and dynamical properties of condensates.

Genomic selection (GS) is an effective method for the genetic improvement of complex traits in plants and animals. Optimization approaches could be used in conjunction with GS to further increase its efficiency and to limit inbreeding, which can increase faster with GS. Mate selection (MS) typically uses a metaheuristic optimization algorithm, simulated annealing, to optimize the selection of individuals and their matings. However, in species with long breeding cycles, this cannot be studied empirically. Here, we investigated this aspect with forward genetic simulations on a high-performance computing cluster and massively parallel computing, considering the oil palm hybrid breeding example. We compared MS and simple methods of inbreeding management (limitation of the number of individuals selected per family, prohibition of self-fertilization and combination of these two methods), in terms of parental inbreeding and genetic progress over four generations of genomic selection and phenotypic selection. The results showed that, compared to the conventional method without optimization, MS could lead to significant decreases in inbreeding and increases in annual genetic progress, with the magnitude of the effect depending on MS parameters and breeding scenarios. The optimal solution retained by MS differed by five breeding characteristics from the conventional solution: selected individuals covering a broader range of genetic values, fewer individuals selected per full-sib family, decreased percentage of selfings, selfings preferentially made on the best individuals and unbalanced number of crosses among selected individuals, with the better an individual, the higher the number of times he is mated. Stronger slowing-down in inbreeding could be achieved with other methods but they were associated with a decreased genetic progress. We recommend that breeders use MS, with preliminary analyses to identify the proper parameters to reach the goals of the breeding program in terms of inbreeding and genetic gain.

Once challenged by the SARS-CoV-2 virus, the human host immune system triggers a dynamic process against infection. We constructed a mathematical model to describe host innate and adaptive immune response to viral challenge. Based on the dynamic properties of viral load and immune response, we classified the resulting dynamics into four modes, reflecting increasing severity of COVID-19 disease. We found the numerical product of immune system's ability to clear the virus and to kill the infected cells, namely immune efficacy, to be predictive of disease severity. We also investigated vaccine-induced protection against SARS-CoV-2 infection. Results suggested that immune efficacy based on memory T cells and neutralizing antibody titers could be used to predict population vaccine protection rates. Finally, we analyzed infection dynamics of SARS-CoV-2 variants within the construct of our mathematical model. Overall, our results provide a systematic framework for understanding the dynamics of host response upon challenge by SARS-CoV-2 infection, and this framework can be used to predict vaccine protection and perform clinical diagnosis.

There are many contrasting results concerning the effectiveness of Test-Trace-Isolate (TTI) strategies in mitigating SARS-CoV-2 spread. To shed light on this debate, we developed a novel static-temporal multiplex network characterizing both the regular (static) and random (temporal) contact patterns of individuals and a SARS-CoV-2 transmission model calibrated with historical COVID-19 epidemiological data. We estimated that the TTI strategy alone could not control the disease spread: assuming R0 = 2.5, the infection attack rate would be reduced by 24.5%. Increased test capacity and improved contact trace efficiency only slightly improved the effectiveness of the TTI. We thus investigated the effectiveness of the TTI strategy when coupled with reactive social distancing policies. Limiting contacts on the temporal contact layer would be insufficient to control an epidemic and contacts on both layers would need to be limited simultaneously. For example, the infection attack rate would be reduced by 68.1% when the reactive distancing policy disconnects 30% and 50% of contacts on static and temporal layers, respectively. Our findings highlight that, to reduce the overall transmission, it is important to limit contacts regardless of their types in addition to identifying infected individuals through contact tracing, given the substantial proportion of asymptomatic and pre-symptomatic SARS-CoV-2 transmission.

Mean-field (MF) models are computational formalism used to summarize in a few statistical parameters the salient biophysical properties of an inter-wired neuronal network. Their formalism normally incorporates different types of neurons and synapses along with their topological organization. MFs are crucial to efficiently implement the computational modules of large-scale models of brain function, maintaining the specificity of local cortical microcircuits. While MFs have been generated for the isocortex, they are still missing for other parts of the brain. Here we have designed and simulated a multi-layer MF of the cerebellar microcircuit (including Granule Cells, Golgi Cells, Molecular Layer Interneurons, and Purkinje Cells) and validated it against experimental data and the corresponding spiking neural network (SNN) microcircuit model. The cerebellar MF was built using a system of equations, where properties of neuronal populations and topological parameters are embedded in inter-dependent transfer functions. The model time constant was optimised using local field potentials recorded experimentally from acute mouse cerebellar slices as a template. The MF reproduced the average dynamics of different neuronal populations in response to various input patterns and predicted the modulation of the Purkinje Cells firing depending on cortical plasticity, which drives learning in associative tasks, and the level of feedforward inhibition. The cerebellar MF provides a computationally efficient tool for future investigations of the causal relationship between microscopic neuronal properties and ensemble brain activity in virtual brain models addressing both physiological and pathological conditions.

Microbiome sequencing data normalization is crucial for eliminating technical bias and ensuring accurate downstream analysis. However, this process can be challenging due to the high frequency of zero counts in microbiome data. We propose a novel reference-based normalization method called normalization via rank similarity (RSim) that corrects sample-specific biases, even in the presence of many zero counts. Unlike other normalization methods, RSim does not require additional assumptions or treatments for the high prevalence of zero counts. This makes it robust and minimizes potential bias resulting from procedures that address zero counts, such as pseudo-counts. Our numerical experiments demonstrate that RSim reduces false discoveries, improves detection power, and reveals true biological signals in downstream tasks such as PCoA plotting, association analysis, and differential abundance analysis.

Evolutionary dynamics in spatially structured populations has been studied for a long time. More recently, the focus has been to construct structures that amplify selection by fixing beneficial mutations with higher probability than the well-mixed population and lower probability of fixation for deleterious mutations. It has been shown that for a structure to substantially amplify selection, self-loops are necessary when mutants appear predominately in nodes that change often. As a result, for low mutation rates, self-looped amplifiers attain higher steady-state average fitness in the mutation-selection balance than well-mixed populations. But what happens when the mutation rate increases such that fixation probabilities alone no longer describe the dynamics? We show that self-loops effects are detrimental outside the low mutation rate regime. In the intermediate and high mutation rate regime, amplifiers of selection attain lower steady-state average fitness than the complete graph and suppressors of selection. We also provide an estimate of the mutation rate beyond which the mutation-selection dynamics on a graph deviates from the weak mutation rate approximation. It involves computing average fixation time scaling with respect to the population sizes for several graphs.

Estimating the distance at which pathogens disperse from one season to the next is crucial for designing efficient control strategies for invasive plant pathogens and a major milestone in the reduction of pesticide use in agriculture. However, we still lack such estimates for many diseases, especially for insect-vectored pathogens, such as Flavescence dorée (FD). FD is a quarantine disease threatening European vineyards. Its management is based on mandatory insecticide treatments and the removal of infected plants identified during annual surveys. This paper introduces a general statistical framework to model the epidemiological dynamics of FD in a mechanistic manner that can take into account missing hosts in surveyed fields (resulting from infected plant removals). We parameterized the model using Markov chain Monte Carlo (MCMC) and data augmentation from surveillance data gathered in Bordeaux vineyards. The data mainly consist of two snapshot maps of the infectious status of all the plants in three adjacent fields during two consecutive years. We demonstrate that heavy-tailed dispersal kernels best fit the spread of FD and that on average, 50% (resp. 80%) of new infection occurs within 10.5 m (resp. 22.2 m) of the source plant. These values are in agreement with estimates of the flying capacity of Scaphoideus titanus, the leafhopper vector of FD, reported in the literature using mark-capture techniques. Simulations of simple removal scenarios using the fitted model suggest that cryptic infection hampered FD management. Future efforts should explore whether strategies relying on reactive host removal can improve FD management.