Pub Date : 2024-12-27DOI: 10.1038/s43588-024-00747-9
Hao Tang, Brian Xiao, Wenhao He, Pero Subasic, Avetik R Harutyunyan, Yao Wang, Fang Liu, Haowei Xu, Ju Li
Machine learning plays an important role in quantum chemistry, providing fast-to-evaluate predictive models for various properties of molecules; however, most existing machine learning models for molecular electronic properties use density functional theory (DFT) databases as ground truth in training, and their prediction accuracy cannot surpass that of DFT. In this work we developed a unified machine learning method for electronic structures of organic molecules using the gold-standard CCSD(T) calculations as training data. Tested on hydrocarbon molecules, our model outperforms DFT with several widely used hybrid and double-hybrid functionals in terms of both computational cost and prediction accuracy of various quantum chemical properties. We apply the model to aromatic compounds and semiconducting polymers, evaluating both ground- and excited-state properties. The results demonstrate the model's accuracy and generalization capability to complex systems that cannot be calculated using CCSD(T)-level methods due to scaling.
{"title":"Approaching coupled-cluster accuracy for molecular electronic structures with multi-task learning.","authors":"Hao Tang, Brian Xiao, Wenhao He, Pero Subasic, Avetik R Harutyunyan, Yao Wang, Fang Liu, Haowei Xu, Ju Li","doi":"10.1038/s43588-024-00747-9","DOIUrl":"10.1038/s43588-024-00747-9","url":null,"abstract":"<p><p>Machine learning plays an important role in quantum chemistry, providing fast-to-evaluate predictive models for various properties of molecules; however, most existing machine learning models for molecular electronic properties use density functional theory (DFT) databases as ground truth in training, and their prediction accuracy cannot surpass that of DFT. In this work we developed a unified machine learning method for electronic structures of organic molecules using the gold-standard CCSD(T) calculations as training data. Tested on hydrocarbon molecules, our model outperforms DFT with several widely used hybrid and double-hybrid functionals in terms of both computational cost and prediction accuracy of various quantum chemical properties. We apply the model to aromatic compounds and semiconducting polymers, evaluating both ground- and excited-state properties. The results demonstrate the model's accuracy and generalization capability to complex systems that cannot be calculated using CCSD(T)-level methods due to scaling.</p>","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":" ","pages":""},"PeriodicalIF":12.0,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142900898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-27DOI: 10.1038/s43588-024-00749-7
Chaitanya Joshi, Daniel Hellstein, Cole Wennerholm, Eoghan Downey, Emmett Hamilton, Samuel Hocking, Anca S Andrei, James H Adler, Timothy J Atherton
Soft materials underpin many domains of science and engineering, including soft robotics, structured fluids, and biological and particulate media. In response to applied mechanical, electromagnetic or chemical stimuli, such materials typically change shape, often dramatically. Predicting their structure is of great interest to facilitate design and mechanistic understanding, and can be cast as an optimization problem where a given energy function describing the physics of the material is minimized with respect to the shape of the domain and additional fields. However, shape-optimization problems are very challenging to solve, and there is a lack of suitable simulation tools that are both readily accessible and general in purpose. Here we present an open-source programmable environment, Morpho, and demonstrate its versatility by showcasing a range of applications from different areas of soft-matter physics: swelling hydrogels, complex fluids that form aspherical droplets, soap films and membranes, and filaments.
{"title":"A programmable environment for shape optimization and shapeshifting problems.","authors":"Chaitanya Joshi, Daniel Hellstein, Cole Wennerholm, Eoghan Downey, Emmett Hamilton, Samuel Hocking, Anca S Andrei, James H Adler, Timothy J Atherton","doi":"10.1038/s43588-024-00749-7","DOIUrl":"10.1038/s43588-024-00749-7","url":null,"abstract":"<p><p>Soft materials underpin many domains of science and engineering, including soft robotics, structured fluids, and biological and particulate media. In response to applied mechanical, electromagnetic or chemical stimuli, such materials typically change shape, often dramatically. Predicting their structure is of great interest to facilitate design and mechanistic understanding, and can be cast as an optimization problem where a given energy function describing the physics of the material is minimized with respect to the shape of the domain and additional fields. However, shape-optimization problems are very challenging to solve, and there is a lack of suitable simulation tools that are both readily accessible and general in purpose. Here we present an open-source programmable environment, Morpho, and demonstrate its versatility by showcasing a range of applications from different areas of soft-matter physics: swelling hydrogels, complex fluids that form aspherical droplets, soap films and membranes, and filaments.</p>","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":" ","pages":""},"PeriodicalIF":12.0,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142900892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-23DOI: 10.1038/s43588-024-00748-8
Dongxue Yan, Siqi Bao, Zicheng Zhang, Jie Sun, Meng Zhou
Immune checkpoint inhibitor (ICI) therapies have made considerable advances in cancer immunotherapy, but the complex and diverse spectrum of ICI-induced toxicities poses substantial challenges to treatment outcomes and computational analysis. Here we introduce DySPred, a dynamic graph convolutional network-based deep learning framework, to map and predict the toxicity profiles of ICIs at the population level by leveraging large-scale real-world pharmacovigilance data. DySPred accurately predicts toxicity risks across diverse demographic cohorts and cancer types, demonstrating resilience in small-sample scenarios and revealing toxicity trends over time. Furthermore, DySPred consistently aligns the toxicity-safety profiles of small-molecule antineoplastic agents with their drug-induced transcriptional alterations. Our study provides a versatile methodology for population-level profiling of ICI-induced toxicities, enabling proactive toxicity monitoring and timely tailoring of treatment and intervention strategies in the advancement of cancer immunotherapy.
{"title":"Leveraging pharmacovigilance data to predict population-scale toxicity profiles of checkpoint inhibitor immunotherapy.","authors":"Dongxue Yan, Siqi Bao, Zicheng Zhang, Jie Sun, Meng Zhou","doi":"10.1038/s43588-024-00748-8","DOIUrl":"https://doi.org/10.1038/s43588-024-00748-8","url":null,"abstract":"<p><p>Immune checkpoint inhibitor (ICI) therapies have made considerable advances in cancer immunotherapy, but the complex and diverse spectrum of ICI-induced toxicities poses substantial challenges to treatment outcomes and computational analysis. Here we introduce DySPred, a dynamic graph convolutional network-based deep learning framework, to map and predict the toxicity profiles of ICIs at the population level by leveraging large-scale real-world pharmacovigilance data. DySPred accurately predicts toxicity risks across diverse demographic cohorts and cancer types, demonstrating resilience in small-sample scenarios and revealing toxicity trends over time. Furthermore, DySPred consistently aligns the toxicity-safety profiles of small-molecule antineoplastic agents with their drug-induced transcriptional alterations. Our study provides a versatile methodology for population-level profiling of ICI-induced toxicities, enabling proactive toxicity monitoring and timely tailoring of treatment and intervention strategies in the advancement of cancer immunotherapy.</p>","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":" ","pages":""},"PeriodicalIF":12.0,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142883835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-23DOI: 10.1038/s43588-024-00744-y
Yudeng Lin, Bin Gao, Jianshi Tang, Qingtian Zhang, He Qian, Huaqiang Wu
Labeling data is a time-consuming, labor-intensive and costly procedure for many artificial intelligence tasks. Deep Bayesian active learning (DBAL) boosts labeling efficiency exponentially, substantially reducing costs. However, DBAL demands high-bandwidth data transfer and probabilistic computing, posing great challenges for conventional deterministic hardware. Here we propose a memristor stochastic gradient Langevin dynamics in situ learning method that uses the stochastic of memristor modulation to learn efficiency, enabling DBAL within the computation-in-memory (CIM) framework. To prove the feasibility and effectiveness of the proposed method, we implemented in-memory DBAL on a memristor-based stochastic CIM system and successfully demonstrated a robot’s skill learning task. The inherent stochastic characteristics of memristors allow a four-layer memristor Bayesian deep neural network to efficiently identify and learn from uncertain samples. Compared with cutting-edge conventional complementary metal-oxide-semiconductor-based hardware implementation, the stochastic CIM system achieves a remarkable 44% boost in speed and could conserve 153 times more energy. This study introduces an in-memory deep Bayesian active learning framework that uses the stochastic properties of memristors for in situ probabilistic computations. This framework can greatly improve the efficiency and speed of artificial intelligence learning tasks, as demonstrated with a robot skill-learning task.
{"title":"Deep Bayesian active learning using in-memory computing hardware","authors":"Yudeng Lin, Bin Gao, Jianshi Tang, Qingtian Zhang, He Qian, Huaqiang Wu","doi":"10.1038/s43588-024-00744-y","DOIUrl":"10.1038/s43588-024-00744-y","url":null,"abstract":"Labeling data is a time-consuming, labor-intensive and costly procedure for many artificial intelligence tasks. Deep Bayesian active learning (DBAL) boosts labeling efficiency exponentially, substantially reducing costs. However, DBAL demands high-bandwidth data transfer and probabilistic computing, posing great challenges for conventional deterministic hardware. Here we propose a memristor stochastic gradient Langevin dynamics in situ learning method that uses the stochastic of memristor modulation to learn efficiency, enabling DBAL within the computation-in-memory (CIM) framework. To prove the feasibility and effectiveness of the proposed method, we implemented in-memory DBAL on a memristor-based stochastic CIM system and successfully demonstrated a robot’s skill learning task. The inherent stochastic characteristics of memristors allow a four-layer memristor Bayesian deep neural network to efficiently identify and learn from uncertain samples. Compared with cutting-edge conventional complementary metal-oxide-semiconductor-based hardware implementation, the stochastic CIM system achieves a remarkable 44% boost in speed and could conserve 153 times more energy. This study introduces an in-memory deep Bayesian active learning framework that uses the stochastic properties of memristors for in situ probabilistic computations. This framework can greatly improve the efficiency and speed of artificial intelligence learning tasks, as demonstrated with a robot skill-learning task.","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":"5 1","pages":"27-36"},"PeriodicalIF":12.0,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11774754/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142883834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-20DOI: 10.1038/s43588-024-00734-0
Aarthi Venkat, Sam Leone, Scott E. Youlten, Eric Fagerberg, John Attanasio, Nikhil S. Joshi, Michael Perlmutter, Smita Krishnaswamy
In single-cell sequencing analysis, several computational methods have been developed to map the cellular state space, but little has been done to map or create embeddings of the gene space. Here we formulate the gene embedding problem, design tasks with simulated single-cell data to evaluate representations, and establish ten relevant baselines. We then present a graph signal processing approach, called gene signal pattern analysis (GSPA), that learns rich gene representations from single-cell data using a dictionary of diffusion wavelets on the cell–cell graph. GSPA enables characterization of genes based on their patterning and localization on the cellular manifold. We motivate and demonstrate the efficacy of GSPA as a framework for diverse biological tasks, such as capturing gene co-expression modules, condition-specific enrichment and perturbation-specific gene–gene interactions. Then we showcase the broad utility of gene representations derived from GSPA, including for cell–cell communication (GSPA-LR), spatial transcriptomics (GSPA-multimodal) and patient response (GSPA-Pt) analysis. This work presents a graph signal processing method, gene signal pattern analysis, to embed gene signals from single-cell sequencing data. In diverse experimental set-ups and case studies, GSPA establishes a gene-based framework for single-cell analysis.
{"title":"Mapping the gene space at single-cell resolution with gene signal pattern analysis","authors":"Aarthi Venkat, Sam Leone, Scott E. Youlten, Eric Fagerberg, John Attanasio, Nikhil S. Joshi, Michael Perlmutter, Smita Krishnaswamy","doi":"10.1038/s43588-024-00734-0","DOIUrl":"10.1038/s43588-024-00734-0","url":null,"abstract":"In single-cell sequencing analysis, several computational methods have been developed to map the cellular state space, but little has been done to map or create embeddings of the gene space. Here we formulate the gene embedding problem, design tasks with simulated single-cell data to evaluate representations, and establish ten relevant baselines. We then present a graph signal processing approach, called gene signal pattern analysis (GSPA), that learns rich gene representations from single-cell data using a dictionary of diffusion wavelets on the cell–cell graph. GSPA enables characterization of genes based on their patterning and localization on the cellular manifold. We motivate and demonstrate the efficacy of GSPA as a framework for diverse biological tasks, such as capturing gene co-expression modules, condition-specific enrichment and perturbation-specific gene–gene interactions. Then we showcase the broad utility of gene representations derived from GSPA, including for cell–cell communication (GSPA-LR), spatial transcriptomics (GSPA-multimodal) and patient response (GSPA-Pt) analysis. This work presents a graph signal processing method, gene signal pattern analysis, to embed gene signals from single-cell sequencing data. In diverse experimental set-ups and case studies, GSPA establishes a gene-based framework for single-cell analysis.","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":"4 12","pages":"955-977"},"PeriodicalIF":12.0,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142862464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-20DOI: 10.1038/s43588-024-00746-w
Antonino Greco, Markus Siegel
Understanding how visual information is encoded in biological and artificial systems often requires the generation of appropriate stimuli to test specific hypotheses, but available methods for video generation are scarce. Here we introduce the spatiotemporal style transfer (STST) algorithm, a dynamic visual stimulus generation framework that allows the manipulation and synthesis of video stimuli for vision research. We show how stimuli can be generated that match the low-level spatiotemporal features of their natural counterparts, but lack their high-level semantic features, providing a useful tool to study object recognition. We used these stimuli to probe PredNet, a predictive coding deep network, and found that its next-frame predictions were not disrupted by the omission of high-level information, with human observers also confirming the preservation of low-level features and lack of high-level information in the generated stimuli. We also introduce a procedure for the independent spatiotemporal factorization of dynamic stimuli. Testing such factorized stimuli on humans and deep vision models suggests a spatial bias in how humans and deep vision models encode dynamic visual information. These results showcase potential applications of the STST algorithm as a versatile tool for dynamic stimulus generation in vision science.
{"title":"A spatiotemporal style transfer algorithm for dynamic visual stimulus generation.","authors":"Antonino Greco, Markus Siegel","doi":"10.1038/s43588-024-00746-w","DOIUrl":"https://doi.org/10.1038/s43588-024-00746-w","url":null,"abstract":"<p><p>Understanding how visual information is encoded in biological and artificial systems often requires the generation of appropriate stimuli to test specific hypotheses, but available methods for video generation are scarce. Here we introduce the spatiotemporal style transfer (STST) algorithm, a dynamic visual stimulus generation framework that allows the manipulation and synthesis of video stimuli for vision research. We show how stimuli can be generated that match the low-level spatiotemporal features of their natural counterparts, but lack their high-level semantic features, providing a useful tool to study object recognition. We used these stimuli to probe PredNet, a predictive coding deep network, and found that its next-frame predictions were not disrupted by the omission of high-level information, with human observers also confirming the preservation of low-level features and lack of high-level information in the generated stimuli. We also introduce a procedure for the independent spatiotemporal factorization of dynamic stimuli. Testing such factorized stimuli on humans and deep vision models suggests a spatial bias in how humans and deep vision models encode dynamic visual information. These results showcase potential applications of the STST algorithm as a versatile tool for dynamic stimulus generation in vision science.</p>","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":" ","pages":""},"PeriodicalIF":12.0,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142873616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-20DOI: 10.1038/s43588-024-00758-6
It is time to bring our favorite cover suggestions from 2024 to light.
是时候公布我们最喜欢的2024年封面建议了。
{"title":"Cover runners-up of 2024","authors":"","doi":"10.1038/s43588-024-00758-6","DOIUrl":"10.1038/s43588-024-00758-6","url":null,"abstract":"It is time to bring our favorite cover suggestions from 2024 to light.","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":"4 12","pages":"879-880"},"PeriodicalIF":12.0,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.nature.com/articles/s43588-024-00758-6.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142862469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-19DOI: 10.1038/s43588-024-00731-3
Wenlian Lu, Xin Du, Jiexiang Wang, Longbin Zeng, Leijun Ye, Shitong Xiang, Qibao Zheng, Jie Zhang, Ningsheng Xu, Jianfeng Feng, the DTB Consortium
Here we present the Digital Brain (DB)—a platform for simulating spiking neuronal networks at the large neuron scale of the human brain on the basis of personalized magnetic resonance imaging data and biological constraints. The DB aims to reproduce both the resting state and certain aspects of the action of the human brain. An architecture with up to 86 billion neurons and 14,012 GPUs—including a two-level routing scheme between GPUs to accelerate spike transmission in up to 47.8 trillion neuronal synapses—was implemented as part of the simulations. We show that the DB can reproduce blood-oxygen-level-dependent signals of the resting state of the human brain with a high correlation coefficient, as well as interact with its perceptual input, as demonstrated in a visual task. These results indicate the feasibility of implementing a digital representation of the human brain, which can open the door to a broad range of potential applications. The Digital Brain platform is capable of simulating spiking neuronal networks at the neuronal scale of the human brain. The platform is used to reproduce blood-oxygen-level-dependent signals in both the resting state and action, thereby predicting the visual evaluation scores.
{"title":"Simulation and assimilation of the digital human brain","authors":"Wenlian Lu, Xin Du, Jiexiang Wang, Longbin Zeng, Leijun Ye, Shitong Xiang, Qibao Zheng, Jie Zhang, Ningsheng Xu, Jianfeng Feng, the DTB Consortium","doi":"10.1038/s43588-024-00731-3","DOIUrl":"10.1038/s43588-024-00731-3","url":null,"abstract":"Here we present the Digital Brain (DB)—a platform for simulating spiking neuronal networks at the large neuron scale of the human brain on the basis of personalized magnetic resonance imaging data and biological constraints. The DB aims to reproduce both the resting state and certain aspects of the action of the human brain. An architecture with up to 86 billion neurons and 14,012 GPUs—including a two-level routing scheme between GPUs to accelerate spike transmission in up to 47.8 trillion neuronal synapses—was implemented as part of the simulations. We show that the DB can reproduce blood-oxygen-level-dependent signals of the resting state of the human brain with a high correlation coefficient, as well as interact with its perceptual input, as demonstrated in a visual task. These results indicate the feasibility of implementing a digital representation of the human brain, which can open the door to a broad range of potential applications. The Digital Brain platform is capable of simulating spiking neuronal networks at the neuronal scale of the human brain. The platform is used to reproduce blood-oxygen-level-dependent signals in both the resting state and action, thereby predicting the visual evaluation scores.","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":"4 12","pages":"890-898"},"PeriodicalIF":12.0,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142862421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-19DOI: 10.1038/s43588-024-00743-z
Felix Wang, James B. Aimone
Today’s high-performance computing systems are nearing an ability to simulate the human brain at scale. This presents a new challenge: going forward, will the bigger challenge be the brain’s size or its complexity?
{"title":"On the path toward brain-scale simulations","authors":"Felix Wang, James B. Aimone","doi":"10.1038/s43588-024-00743-z","DOIUrl":"10.1038/s43588-024-00743-z","url":null,"abstract":"Today’s high-performance computing systems are nearing an ability to simulate the human brain at scale. This presents a new challenge: going forward, will the bigger challenge be the brain’s size or its complexity?","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":"4 12","pages":"882-883"},"PeriodicalIF":12.0,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142862449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-19DOI: 10.1038/s43588-024-00745-x
Emmet A. Francis, Justin G. Laughlin, Jørgen S. Dokken, Henrik N. T. Finsberg, Christopher T. Lee, Marie E. Rognes, Padmini Rangamani
Biological cells rely on precise spatiotemporal coordination of biochemical reactions to control their functions. Such cell signaling networks have been a common focus for mathematical models, but they remain challenging to simulate, particularly in realistic cell geometries. Here we present Spatial Modeling Algorithms for Reactions and Transport (SMART), a software package that takes in high-level user specifications about cell signaling networks and then assembles and solves the associated mathematical systems. SMART uses state-of-the-art finite element analysis, via the FEniCS Project software, to efficiently and accurately resolve cell signaling events over discretized cellular and subcellular geometries. We demonstrate its application to several different biological systems, including yes-associated protein (YAP)/PDZ-binding motif (TAZ) mechanotransduction, calcium signaling in neurons and cardiomyocytes, and ATP generation in mitochondria. Throughout, we utilize experimentally derived realistic cellular geometries represented by well-conditioned tetrahedral meshes. These scenarios demonstrate the applicability, flexibility, accuracy and efficiency of SMART across a range of temporal and spatial scales. Spatial Modeling Algorithms for Reactions and Transport (SMART) is a software package that allows users to simulate spatially resolved biochemical signaling networks within realistic geometries of cells and organelles.
生物细胞依靠生化反应的精确时空协调来控制其功能。这种细胞信号网络一直是数学模型的研究重点,但它们的模拟仍然具有挑战性,尤其是在现实的细胞几何结构中。我们在此介绍反应和运输的空间建模算法(SMART),这是一个软件包,可接收用户关于细胞信号网络的高级规格,然后组装并求解相关的数学系统。通过 FEniCS 项目软件,SMART 利用最先进的有限元分析技术,高效、准确地解决离散化细胞和亚细胞几何结构上的细胞信号传导问题。我们展示了它在几个不同生物系统中的应用,包括 yes-associated protein (YAP)/PDZ-binding motif (TAZ) 机械传导、神经元和心肌细胞中的钙信号转导以及线粒体中的 ATP 生成。在整个过程中,我们利用实验得出的现实细胞几何图形,这些几何图形由条件良好的四面体网格表示。这些场景证明了 SMART 在一系列时间和空间尺度上的适用性、灵活性、准确性和效率。
{"title":"Spatial modeling algorithms for reactions and transport in biological cells","authors":"Emmet A. Francis, Justin G. Laughlin, Jørgen S. Dokken, Henrik N. T. Finsberg, Christopher T. Lee, Marie E. Rognes, Padmini Rangamani","doi":"10.1038/s43588-024-00745-x","DOIUrl":"10.1038/s43588-024-00745-x","url":null,"abstract":"Biological cells rely on precise spatiotemporal coordination of biochemical reactions to control their functions. Such cell signaling networks have been a common focus for mathematical models, but they remain challenging to simulate, particularly in realistic cell geometries. Here we present Spatial Modeling Algorithms for Reactions and Transport (SMART), a software package that takes in high-level user specifications about cell signaling networks and then assembles and solves the associated mathematical systems. SMART uses state-of-the-art finite element analysis, via the FEniCS Project software, to efficiently and accurately resolve cell signaling events over discretized cellular and subcellular geometries. We demonstrate its application to several different biological systems, including yes-associated protein (YAP)/PDZ-binding motif (TAZ) mechanotransduction, calcium signaling in neurons and cardiomyocytes, and ATP generation in mitochondria. Throughout, we utilize experimentally derived realistic cellular geometries represented by well-conditioned tetrahedral meshes. These scenarios demonstrate the applicability, flexibility, accuracy and efficiency of SMART across a range of temporal and spatial scales. Spatial Modeling Algorithms for Reactions and Transport (SMART) is a software package that allows users to simulate spatially resolved biochemical signaling networks within realistic geometries of cells and organelles.","PeriodicalId":74246,"journal":{"name":"Nature computational science","volume":"5 1","pages":"76-89"},"PeriodicalIF":12.0,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11774757/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142866530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}