bioRxiv Science⌕ Search

SEARCH · bioRxiv Science

Results for “systems biology”

Search indexed bioRxiv preprints in genomics, neuroscience, cell biology and bioinformatics. Read source abstracts and check manuscript versions; preprints are not peer reviewed.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14Linked to original sources

Discovering conserved regulatory modules in predicted gene regulatory networks across species

The discovery of conserved regulatory motifs across different species is a fundamental challenge in systems biology, especially considering the noisy and incomplete nature of predicted gene regulatory networks (GRNs) and the intractability of the underlying graph alignment problem. Traditional network alignment methods frequently enforce one-to-one node mappings or strict topological isomorphism, which fail to accommodate the many-to-many orthology mappings caused by evolutionary gene duplication. Consequently, strict constraints often yield highly fragmented topological islands rather than cohesive functional modules. In this work, we propose a relaxed topological alignment algorithm designed to extract conserved regulatory structures from cross-species GRNs. We formulate the discovery process as a multi-objective optimization problem that balances sequence homology, functional coherence, and a normalized topological consensus. To navigate the exponentially scaling search space, we introduce a greedy seed-and-extend heuristic bounded by a dynamic{epsilon} -stopping condition, which evaluates marginal objective gains to prevent functional dilution. We validate our algorithm using time-series transcriptomic data from Arabidopsis thaliana, Zea mays, and Sorghum bicolor focused on drought and developmental stress responses. While a strict topological baseline extracted only fragmented subgraphs limited to 51 homologous tuples, our relaxed heuristic successfully converged on a highly connected 444-tuple module. The resulting topology effectively links strictly conserved upstream transcription factors to their highly duplicated, species-specific downstream pathways. Our algorithm provides a robust, scalable computational methodology for identifying core regulatory logic across complex biological systems, facilitating the translation of conserved network architectures among multiple species. Author summaryIdentifying shared regulatory mechanisms across diverse species is essential for understanding how complex biological systems evolve and adapt. However, traditional computer algorithms struggle to align these biological networks because evolution frequently duplicates genes, breaking simple one-to-one comparisons and producing highly fragmented results. To overcome this limitation, we developed a relaxed cross-species network alignment algorithm. Instead of demanding perfectly identical network shapes, our approach dynamically balances genetic sequence similarity, network structure, and biological function. We demonstrated the performance of our algorithm using plant drought-stress networks as a case study. While strict methods only found tiny, disconnected network fragments, our algorithm uncovered a functionally coherent, interconnected regulatory module across three distinct species. We discovered that while upstream command genes remain strictly conserved, they regulate highly customized, species-specific execution pathways downstream. Ultimately, our framework provides a scalable, species-agnostic method to decode complex systems, allowing researchers to translate conserved biological logic across diverse genomes.

systems biology↗

Physiology-informed regularization enables training of universal differential equation systems for biological applications

Systems biology tackles the challenge of understanding the high complexity in the internal regulation of homeostasis in the human body through mathematical modelling. These models can aid in the discovery of disease mechanisms and potential drug targets. However, on one hand the development and validation of knowledge-based mechanistic models is time-consuming and does not scale well with increasing features in medical data. On the other hand, more data-driven approaches such as machine learning models require large volumes of data to produce generalizable models. The integration of neural networks and mechanistic models, forming universal differential equation (UDE) models, enables the automated learning of unknown model terms with less data than the neural network alone. Nevertheless, estimating parameters for these hybrid models remains difficult with sparse data and limited sampling durations that are common in biological applications. In this work, we propose the use of physiology-informed regularization, penalizing biologically implausible model behavior to guide the UDE towards more physiologically plausible regions of the solution space. In a simulation study we show that physiology-informed regularization not only results in a more accurate forecasting of model behaviour, but also supports training with less data. We also applied this technique to learn a representation of the rate of glucose appearance in the glucose minimal model using meal response data measured in healthy people. In that case, the inclusion of regularization reduces variability between UDE-embedded neural networks that were trained from different initial parameter guesses. Author summarySystems biology concerns the modelling and analysis of biological processes, by viewing these as interconnected systems. Modelling is typically done either using mechanistic differential equations that are derived from experiments and known biology, or using machine learning on large biological datasets. While mathematical modelling from biological experiments can provide useful insights with limited data, building and validating these models takes a long time and often requires highly invasive measurements in humans. Efforts to combine this classical technique with machine learning have resulted in a framework termed universal differential equations, where the model equations contain a neural network to describe unknown biological interactions. While these methods have shown success in numerous fields, applications in biology are more challenging due to limited data-availability, high data sparsity. In this work, we have introduced physiology-informed regularization to overcome these instabilities and to constrain the model to biologically plausible behavior. Our results show that by using physiology-informed regularization, we can accurately predict future unseen observations in a simulated example, with much more limited data than a similar model without regularization. Additionally, we show an application of this technique on human data, applying a neural network to learn the appearance of glucose in the blood plasma after a meal.

systems biology↗

Multi-Omics Regulatory Network Inference in the Presence of Missing Data

A key problem in systems biology is the discovery of regulatory mechanisms that drive phenotypic behaviour of complex biological systems in the form of multi-level networks. Modern multi-omics profiling techniques probe these fundamental regulatory networks but are often hampered by experimental restrictions leading to missing data or partially measured omics types for subsets of individuals due to cost restrictions. In such scenarios, in which missing data is present, classical computational approaches to infer regulatory networks are limited. In recent years, approaches have been proposed to infer sparse regression models in the presence of missing information. Nevertheless, these methods have not been adopted for regulatory network inference yet. In this study, we integrated regression-based methods that can handle missingness into KiMONo, a Knowledge guIded Multi-Omics Network inference approach, and benchmarked their performance on commonly encountered missing data scenarios in single- and multi-omics studies. Overall, two-step approaches that explicitly handle missingness performed best for a wide range of random- and block-missingness scenarios on imbalanced omics-layers dimensions, while methods implicitly handling missingness performed best on balanced omics-layers dimensions. Our results show that robust multi-omics network inference in the presence of missing data with KiMONo is feasible and thus allows users to leverage available multi-omics data to its full extent. Juan Henao is a 3rd year PhD candidate at Computational Health Center at Helmholtz Center Munich working on multi-omics and clinical data integration using both, bulk and single-cell data. Michael Lauber is a PhD Candidate at the Chair of Experimental Bioinformatics at the Technical University Munich. Currently, he is working on an approach for inference of reprogramming transcription factors for trans-differentiation. Manuel Azevedo is a Masters student at the Technical University of Munich in Mathematics with a focus on Biomathematics and Biostatistics. Currently, he is working as a Student Assistant at Helmholtz Munich, where he is also doing his masters thesis. Anastasiia Grekova is a Masters student of bioinformatics at the Technical University of Munich and the Ludwig-Maximilians-University Munich, working on multi-omics data integration in Marsico Lab at HMGU. Fabian Theis is the Head of the Institute of Computational Biology and leading the group for Machine Learning at Helmholtz Center Munich. He also holds the chair of Mathematical modelling of biological systems, Department of Mathematics, Technical University of Munich as an Associate Professor. Markus List obtained his PhD at the University of Southern Denmark and worked as a postdoctoral fellow at the Max Planck Institute for Informatics before starting his group Big Data in BioMedicine at the Technical University of Munich. Christoph Ogris holds a PostDoc position in the Marsico Lab at Helmholtz-Center Munich. His research focuses on predicting and exploiting multi-modal biological networks to identify disease-specific cross-omic interactions. Benjamin Schubert obtained his PhD at the University of Tubingen and worked as a postdoctoral fellow at Harvard Medical School and Dana-Farber Cancer Institute USA before starting his group for Translational Immmunomics at the Helmholtz Center Munich.

systems biology↗

A high-resolution microscopy system for biological studies of cold-adapted species under physiological conditions

The fundamental processes governing life are sensitively dependent on temperature. Whilst much is known about the constraints on how proteins operate at 37{degrees}C, little knowledge exists about how biological function is maintained sub-zero temperature conditions, where proteins are less stable and oxidative damage is high. However, almost 90% of habitable environments on Earth are permanently below 5{degrees}C (i.e. the deep sea and polar regions). This means that we do not understand how a large and diverse proportion of the global biome functions. To address this question at the cellular level, tools are required for imaging biological systems at high resolution under physiological conditions. This poses severe technical challenges that cannot be addressed with traditional optical microscopy techniques. High-resolution imaging objectives require short working distances and the use of immersion media, which lead to rapid heat transfer from the microscope to the sample. This affects the viability of live specimens and the interpretability of the results when the sample function optimally at low temperatures. Condensation and temperature-induced shrinking of components pose further challenges, reducing image resolution and contrast. Here, we address these issues and provide a method for high-fidelity imaging of live biological samples at temperatures of around, or below, 0{degrees}C. Our method is compatible with different microscopy modalities, including super-resolution imaging. It relies on hardware additions to traditional microscopy systems that can be straightforwardly implemented, namely, a cooling collar, 10% ethanol as an immersion medium, and nitrogen flow to mitigate condensation. We demonstrate the method in live cell cultures derived from Antarctic fish species and highlight the need to maintain physiological conditions for these fragile biological samples. Future applications are diverse and include evolutionary biology and the study of cold-adapted organisms, as well as cellular biophysics and several applications in biotechnology.

biophysics↗

Likelihood-free nested sampling for biochemical reaction networks

The development of mechanistic models of biological systems is a central part of Systems Biology. One major challenge in developing these models is the accurate inference of the model parameters. In the past years, nested sampling methods have gained an increasing amount of attention in the Systems Biology community. Some of the rather attractive features of these methods include that they are easily parallelizable and give an estimation of the variance of the final Bayesian evidence estimate from a single run. Still, the applicability of these methods is limited as they require the likelihood to be available and thus cannot be applied to stochastic systems with intractable likelihoods. In this paper, we present a likelihood-free nested sampling formulation that gives an unbiased estimator of the Bayesian evidence as well as samples from the posterior. Unlike most common nested sampling schemes we propose to use the information about the samples from the final prior volume to aid in the approximation of the Bayesian evidence and show how this allows us to formulate a lower bound on the variance of the obtained estimator. We proceed and use this lower bound to formulate a novel termination criterion for nested sampling approaches. We illustrate how our approach is applied to several realistically sized models with simulated data as well as recently published biological data. The presented method provides a viable alternative to other likelihood-free inference schemes such as Sequential Monte Carlo or Approximate Bayesian Computations methods. We also provide an intuitive and performative C++ implementation of our method.

bioinformatics↗

OrthoGuide: A database for rooting inference of orthologous genes

Orthology has proven to be a valuable proxy for the study of the evolution of biological systems, such as metabolic pathways and gene regulatory networks. Genes within the same orthologous group typically share the same evolutionary history, reflecting their common ancestry. To leverage this property, several tools and databases, most notably the COG database, have been developed to support evolutionary analyses based on orthology information. Building on these resources, we previously developed the Bridge algorithm to infer the evolutionary root of genes by analyzing the distribution of orthologous groups in a phylogenetic tree. Here, we introduce OrthoGuide, a database and web application that provides rooting information for all COGs across eight model species, as inferred by the Bridge algorithm. The web application and the database are hosted at https://dalmolingroup.imd.ufrn.br/orthoguide/. Significance StatementUnderstanding the evolutionary origin of genes is fundamental for systems biology but is often obstructed by computationally complex bioinformatic workflows. This creates a bottleneck for many researchers. OrthoGuide directly addresses this challenge by providing a public, pre-computed database of evolutionary rooting data for all genes across eight eukaryotic model organisms. Our web application eliminates the need for user-side computation. OrthoGuide delivers instant results as well as interactive visualizations. This resource democratizes access to evolutionary analyses based on orthology information, enabling a broader scientific community to rapidly translate simple gene lists into insights about the assembly of biological systems.

evolutionary biology↗

ProcessNets: Towards an efficient approach for ensemble analysis of biological networks

Integrative analysis of the properties of multiple networks pertaining to a biological system is a key problem in systems biology. But computing the properties of thousands of large networks poses a challenge. Most techniques that partially address this challenge, such as parallelism and optimized algorithms, treat the analysis of each network as an independent task. However, the networks arising from the same biological system are often similar to each other, and can we harness this similarity to achieve speedup? Towards this end, we propose a phylogeny-like data structure, nc-tree, to compactly represent an ensemble of related biological networks; and a versatile framework, ProcessNets, that runs incremental algorithms over the nc-tree to speedup property computations on the input networks. Our asymptotic analysis of space and time complexity, coupled with empirical evaluations of diverse ensembles of simulated and real-world GTEx gene coexpression networks, demonstrate that ProcessNets leads to significant space and time advantages when computing different network science measures on ensembles of similar networks. For instance, we achieve a compression factor of 2.1x and 8.1x in storing two representative ensembles of GTEx Muscle Skeletal networks with 1000 nodes/genes, and a time speedup of 2.86x to 3.97x over the fastest baseline for computing degree centrality in ensembles of networks with at least 14,500 nodes derived from subsampled GTEx datasets of ten tissues. These results are promising and encourage application of ProcessNets to analyze biological network ensembles derived from rapidly accumulating consortium/biobank-based datasets.

bioinformatics↗

Disease associated protein-protein interaction network reconstruction based on comprehensive influence analysis

Proteins and their interactions are fundamental to biological system. With the scientific paradigm shifting to systems biology, functional study of proteins from a network viewpoint to get a deep understanding of their roles in human life and diseases being increasingly essential. Although several methods already existed for protein-protein interaction (PPI) network building, the precise reconstruction of disease associated PPI network remains a challenge. In this paper we introduce a novel concept of comprehensive influence of proteins in network, in which direct and indirect connections are adopted for the calculation of influential effects of a protein with different weights. With the optimized weights, we calculate and select the important proteins and their interactions to reconstruct the PPI network for further validation and confirmation. To evaluate the performance of the method, we compared our model with the six existed ones by using five standard data sets. The results indicated that our method outperforms the existed ones. We then applied our model to prostate cancer and Parkinsons disease to predict novel disease associated proteins for the future experimental validation. Author SummaryThe diverse protein-protein interaction networks have dramatic effects on biological system. The disease associated PPI networks are generally reconstructed from experimental data with computational models but with limited accuracy. We developed a novel concept of comprehensive influence of proteins in network for reconstructing the PPI network. Our model outperforms the state-of-the-art ones and we then applied our model to identify novel interactions for further validation.

bioinformatics↗

Genetic analysis identifies molecular systems and biological pathways associated with household income

Socio-economic position (SEP) is a multi-dimensional construct reflecting (and influencing) multiple socio-cultural, physical, and environmental factors. Previous genome-wide association studies (GWAS) using household income as a marker of SEP have shown that common genetic variants account for 11% of its variation. Here, in a sample of 286,301 participants from UK Biobank, we identified 30 independent genome-wide significant loci, 29 novel, that are associated with household income. Using a recently-developed method to meta-analyze data that leverages power from genetically-correlated traits, we identified an additional 120 income-associated loci. These loci showed clear evidence of functional enrichment, with transcriptional differences identified across multiple cortical tissues, in addition to links with GABAergic and serotonergic neurotransmission. We identified neurogenesis and the components of the synapse as candidate biological systems that are linked with income. By combining our GWAS on income with data from eQTL studies and chromatin interactions, 24 genes were prioritized for follow up, 18 of which were previously associated with cognitive ability. Using Mendelian Randomization, we identified cognitive ability as one of the causal, partly-heritable phenotypes that bridges the gap between molecular genetic inheritance and phenotypic consequence in terms of income differences. Significant differences between genetic correlations indicated that, the genetic variants associated with income are related to better mental health than those linked to educational attainment (another commonly-used marker of SEP). Finally, we were able to predict 2.5% of income differences using genetic data alone in an independent sample. These results are important for understanding the observed socioeconomic inequalities in Great Britain today.

genetics↗

Estimation of mutual information for real-valued data with error bars and controlled bias

Estimation of mutual information between (multidimensional) real-valued variables is used in analysis of complex systems, biological systems, and recently also quantum systems. This estimation is a hard problem, and universally good estimators provably do not exist. Kraskov et al. (PRE, 2004) introduced a successful mutual information estimation approach based on the statistics of distances between neighboring data points, which empirically works for a wide class of underlying probability distributions. Here we improve this estimator by (i) expanding its range of applicability, and by providing (ii) a self-consistent way of verifying the absence of bias, (iii) a method for estimation of its variance, and (iv) a criterion for choosing the values of the free parameter of the estimator. We demonstrate the performance of our estimator on synthetic data sets, as well as on neurophysiological and systems biology data sets.

bioinformatics↗

A Toolbox for Discrete Modelling of Cell Signalling Dynamics

In an age where the volume of data regarding biological systems exceeds our ability to analyse it, many researchers are looking towards systems biology and computational modelling to help unravel the complexities of gene and protein regulatory networks. In particular, the use of discrete modelling allows generation of signalling networks in the absence of full quantitative descriptions of systems, which are necessary for ordinary differential equation (ODE) models. In order to make such techniques more accessible to mainstream researchers, tools such as the BioModelAnalyzer (BMA) have been developed to provide a user-friendly graphical interface for discrete modelling of biological systems. Here we use the BMA to build a library of discrete target functions of known canonical molecular interactions, translated from ordinary differential equations (ODEs). We then show that these BMA target functions can be used to reconstruct complex networks, which can correctly predict many known genetic perturbations. This new library supports the accessibility ethos behind the creation of BMA, providing a toolbox for the construction of complex cell signalling models without the need for extensive experience in computer programming or mathematical modelling, and allows for construction and simulation of complex biological systems with only small amounts of quantitative data.\n\nAUTHOR SUMMARYOrdinary differential equation (ODE) based models are a popular approach for modelling biological networks. A limitation of ODE models is that they require complete networks and detailed kinetic parameterisation. An alternative is the use of discrete, executable models, in which nodes are assigned discrete value ranges, and the relationship between them defined with simple mathematical operations. One tool for constructing such models is the BioModelAnalyzer (BMA), an open source and publicly available (https://www.biomodelanalyzer.org) software, aimed to be fully usable by researchers without extensive computational or mathematical experience. A fundamental question for executable models is whether the high level of abstraction substantially reduces expressivity relative to continuous approaches. Here, we present a canonical library of biological signalling motifs, initially defined by Tyson et al (2003), translated for the first time into the BMA. We show that; 1) these motifs are easily and fully translatable from continuous to discrete models, 2) Combining these motifs in a computationally naive way generates a fully functional and predictive model of the yeast cell cycle.

systems biology↗

Critical assessment of the ability of Boolean threshold models to describe gene regulatory network dynamics.

The inference of gene regulatory networks (GRNs) from high-throughput data constitutes a fundamental and challenging task in systems biology. Boolean networks are a popular modeling framework to understand the dynamic nature of GRNs. In the absence of reliable methods to infer the regulatory logic of Boolean GRN models, researchers frequently assume threshold logic as a default. Using the largest repository of published expert-curated Boolean GRN models as best proxy of reality, we systematically compare the ability of two popular threshold formalisms, the Ising and the 01 formalism, to truthfully recover biological functions and biological system dynamics. While Ising rules match fewer biological functions exactly than 01 rules, they yield a better average agreement. In general, more complex regulatory logic proves harder to be represented by either threshold formalism. Informed by these results and a meta-analysis of regulatory logic, we propose modified versions for both formalisms, which provide a better function-level and dynamic agreement with biological GRN models than the usual threshold formalisms. For small biological GRN models with low connectivity, corresponding threshold networks exhibit similar dynamics. However, they generally fail to recover the dynamics of large networks or highly-connected networks. In conclusion, this study provides new insights into an important question in computational systems biology: how truthfully do Boolean threshold networks capture the dynamics of GRNs? Significance statementGene regulatory networks (GRNs) describe the complex interactions between genes. GRNs control biological processes, respond to environmental changes, and contribute to diseases. An accurate understanding of the dynamics of GRNs is therefore crucial. Given insufficient data, researchers frequently employ Boolean network models with default threshold logic to study the dynamics of GRNs. We systematically assess the ability of two commonly-used types of threshold networks to recover the true regulatory logic and the dynamics of published expert-curated Boolean GRN models. Inspired by biological insights, we further propose modifications to each threshold formalism that improve their match with biological networks.

systems biology↗

Multiscale Probabilistic Modeling: A Bayesian Approach to Augment Mechanistic Models of Cell Signaling with Machine-Learning Predictions of Binding Affinity

Computational models in systems biology are often underdetermined--that is, there is little data relative to the complexity and size of the model. The lack of data is primarily due to limits in our ability to observe specific biological systems and restricts the utility of computational models. However, there are a growing number of experimental databases in biology. While these databases provide more observations, they often do not have observations that match the system of interest exactly. For example, database measurements might be collected at different experimental conditions or on a different scale compared to the system of interest. Here, we investigate what information can be gleaned from generalizing databases across these differences in the context of modeling a specific system - cell signaling. Ultimately, our goal is to better determine models of specific systems, thereby increasing their utility. To do this, we propose a novel, multiscale, probabilistic framework. We use this framework to integrate measurements of protein structure from the Protein Data Bank and measurements of amino acid sequence from the Universal Protein Resource into the parameter inference of cell signaling models. Then, we quantify exactly what information is gained from these measurements when modeling cell signaling. We choose to investigate the utility of these databases in the context of dynamic cell signaling models because experimental measurements of the variables of interest, protein dynamics, are still quite limited. We find that we can successfully integrate measurements from these databases to significantly improve parameter estimation of signaling models. The impact of sequence and structure measurements on model predictions depends on the sensitivity of the prediction to perturbations in the parameter values. Overall, this study demonstrates that measurements of protein structure and amino acid sequence can be leveraged to better inform parameters in models of cell signaling. Author SummaryComputational models of cell signaling have provided mechanistic insights into complex biological systems, including in physiological and disease settings. Accurate and predictive modeling critically depends on the precise estimation of model parameters, which is often hindered by the limited availability of experimental data. In this study, we present a novel multiscale probabilistic inference framework that broadens the scope of data types that can be leveraged for parameter estimation for models of cell signaling. The framework integrates a machine learning pipeline with a generalizable parameter inference approach, enabling the use of experimental data across scales. Specifically, we demonstrate that incorporating protein amino acid sequence and 3D structural data enhances parameter estimation compared to traditional measurements such as protein concentrations over time. Improving parameter estimation increases the robustness and applicability of cell signaling models. Ultimately, our framework facilitates use of a broader range of data and supports the development of predictive computational models that increase our understanding of cell signaling.

systems biology↗

Beyond protein functions: evaluating completeness, coherence, and consistency of genome-scale function annotations

Protein function annotation has traditionally followed a reductionist approach, assigning functions to individual proteins acting in isolation. This paradigm treats each annotation as an independent fact, disconnected from the broader biological system. However, proteins operate within integrated cellular networks where their functions depend on genomic context and the presence of interacting partners. Here, we develop a genome-scale evaluation framework that assesses whether annotated protein functions could plausibly coexist within a living organism. We formalize three criteria grounded in systems biology principles: completeness (presence of essential functions), coherence (satisfaction of functional dependencies), and consistency (absence of mutually exclusive functions). Applying this framework to bacterial genomes, we evaluated manually curated annotations from six model organisms and computational predictions from six methods. While model organism annotations largely satisfied our constraints -- with violations primarily reflecting host- pathogen interactions -- all computational prediction methods systematically failed to produce biologically plausible genome-scale annotations. Methods achieved high accuracy for individual proteins yet produced incomplete metabolic pathways, incoherent protein complexes, and taxonomically impossible function combinations. These results reveal a fundamental disconnect between the reductionist annotation model and the systems-level requirements of biological organisms. Current computational methods amplify this disconnect as they are optimized for protein-level accuracy while ignoring genome-scale constraints. Our framework provides quantitative metrics for evaluating biological plausibility and establishes a foundation for developing system-aware annotation approaches. The shift from reductionist to systems-level perspectives will be essential for annotating the rapidly growing collection of sequenced genomes and metagenomes. Significance StatementProtein function prediction methods are evaluated by their accuracy on individual proteins, but proteins operate within integrated biological systems with strict functional requirements. We developed a framework that evaluates whether predicted protein functions could plausibly coexist in a living organism by checking for completeness of essential functions, coherence of functional dependencies, and consistency with biological constraints. While manually curated annotations largely satisfy these requirements, all computational prediction methods systematically fail to produce biologically viable genome-scale annotations. This reveals a fundamental disconnect between current evaluation paradigms and the systems-level requirements of biology, highlighting the need for prediction methods that consider genome-scale constraints rather than optimizing for individual protein accuracy.

bioinformatics↗

scPortrait integrates single-cell images into multimodal modeling

Machine learning increasingly uncovers rules of biology directly from data, enabled by large, standardized datasets. Microscopy images provide rich information on cellular architecture and are accessible at scale across biological systems, making them an ideal foundation for modeling cell behavior. However, a standardized image format does not exist at the single-cell level. Here we present scPortrait, an scverse software package for generation, storage, and application of single-cell image datasets. scPortrait reads, stitches and segments raw fields of view with out-of-core computation scaling to larger-than-memory datasets. Parallelization enables rapid extraction of individual cells into a standardized single-cell image format with fast access to accelerate machine learning. scPortrait enables analysis across modalities including images, proteomics and transcriptomics, identifying cancer-associated macrophage subpopulations by morphology and embedding single-cell images into transcriptome atlases. scPortrait turns microscopy images into a reusable resource for integrative cell modeling, establishing single-cell images as a core modality in systems biology.

systems biology↗

ANDOR and beyond: dynamically switchable logic gates as modules for flexible information processing

Understanding how complex (bio-)chemical pathways and regulatory networks may be capable of processing information in efficient, flexible, and robust ways is a key question with implications touching fields across biology, systems biology, biochemistry, synthetic biology, dynamical systems theory, and network science. Considerable effort has been focused on the identification and characterization of structural motifs in these signaling networks, and companion efforts have instead sought to cast their operation as controlled by dynamical modules that appear out of dynamical correlations during information processing. While both these approaches have been successful in many examples of biological information processing, cases in which the signaling or regulatory network exhibits multi-functionality or context dependence remain problematic. We here propose a small set of higher-order effective modules that simultaneously incorporate both network structure and the attendant dynamical landscape. In so doing, we render effective computational units that can perform different logical operations based purely on the basin of attraction in which the network dynamics resides or is steered to. These dynamically switchable biochemical logic gates require fewer chemical components or gene products overall than their traditional analogs where static, separate gates are used for each desired function. We demonstrate the applicability and limits of these flexible gates by determining a robust range of parameters over which they correctly operate and further characterize the resilience of their function against intrinsic noise of the constituent reactions using the theory of large deviations. We also show the capability of this framework for general computations by designing a binary adder/subtractor circuit composed of only six components.

biophysics↗

Merging logical models: An application in Acute Myeloid Leukemia modeling

MotivationGene regulatory network (GRN) models provide mechanistic understanding of genetic interactions that regulate gene expression and, consequently, influence cellular behavior. Dysregulated gene expression plays a critical role in disease progression and treatment response, making GRN models a promising tool for precision medicine. While researchers have built many models to describe specific subsets of gene interactions, more comprehensive models that cover a broader range of genes are challenging to build. This necessitates the development of automated approaches for merging existing models. ResultsWe present LM-Merger, a workflow for semi-automatically merging logical GRN models. The workflow consists of five main steps: (a) model identification, (b) model standardization and annotation, (c) model verification, (d) model merging, and (d) model evaluation. We demonstrate the feasibility and benefit of this workflow with two pairs of published models pertaining to acute myeloid leukemia (AML). The integrated models were able to retain the predictive accuracy of the original models, while expanding coverage of the biological system. Notably, when applied to a new dataset, the integrated models outperformed the individual models in predicting patient response. This study highlights the potential of logical model merging to advance systems biology research and our understanding of complex diseases. Availability and implementationThe workflow and accompanying tools, including modules for model standardization, automated logical model merging, and evaluation, are available at https://github.com/IlyaLab/LogicModelMerger/.

systems biology↗

The BioRECIPE Knowledge Representation Format

AO_SCPLOWBSTRACTC_SCPLOWThe BioRECIPE (Biological system Representation for Evaluation, Curation, Interoperability, Preserving, and Execution) knowledge representation format was introduced to facilitate seamless human-machine interaction while creating, verifying, evaluating, curating, and expanding executable models of intra- and intercellular signaling. This format allows a human user to easily preview and modify any model component, while it is at the same time readable by machines and can be processed by a suite of model development and analysis tools. The BioRECIPE format is compatible with multiple representation formats, natural language processing tools, modeling tools, and databases that are used by the systems biology community. Graphical abstract O_FIG O_LINKSMALLFIG WIDTH=200 HEIGHT=117 SRC="FIGDIR/small/579694v1_ufig1.gif" ALT="Figure 1"> View larger version (38K): org.highwire.dtl.DTLVardef@76a130org.highwire.dtl.DTLVardef@505cb4org.highwire.dtl.DTLVardef@1f64e68org.highwire.dtl.DTLVardef@195bd03_HPS_FORMAT_FIGEXP M_FIG C_FIG

systems biology↗