Determination of the latent geometry of atorvastatin pharmacokinetics by transfer entropy to identify bottlenecks.

IF 2.8 3区 医学 Q2 PHARMACOLOGY & PHARMACY
Paola Lecca, Angela Re
{"title":"Determination of the latent geometry of atorvastatin pharmacokinetics by transfer entropy to identify bottlenecks.","authors":"Paola Lecca, Angela Re","doi":"10.1186/s40360-025-00948-6","DOIUrl":null,"url":null,"abstract":"<p><strong>Background: </strong>In mathematics, a physical network (e.g. biological network, social network, IT network, communication network) is usually represented by a graph. The determination of the metric space (also referred to as latent geometry) of the graph and the disposition of its nodes on it provide important information on the reaction propensity and consequently on the possible presence of bottlenecks in a system of interacting molecules, such as it happens in pharmacokinetics. To determine the latent geometry and the coordinates of nodes, it is necessary to have the dissimilarity or distance matrix of the network, an input that is not always easy to measure in experiments.</p><p><strong>Results: </strong>The main result of this study is the mathematical and computational procedure for determining the distance/dissimilarity matrix between nodes and for identifying the latent network geometry from experimental time series of node concentrations. Specifically, we show how this matrix can be calculated from the transfer entropy between nodes, which is a measure of the flow of information between nodes and thus indirectly of the reaction propensity between them. We implemented a procedure of spectral graph embedding to embed the distance/dissimilarity matrix in flat and curved metric spaces, and consequently to determine the optimal latent geometry of the network. The distances between nodes in the metric space describing the latent geometry can be analyzed to identify bottlenecks in the reaction system. As a case study for this procedure, we consider the pharmacokinetics of atorvastatin, as described by recent studies and experimental time data.</p><p><strong>Conclusions: </strong>The method of determining distances between nodes from temporal measurements of node concentrations through the calculation of transfer entropy makes it possible to incorporate the information of kinetics (inherent in the time series) in the construction of the distance/dissimilarity matrix, and, consequently, in the determination of the network latent geometry, a characterisation of the network itself that is intimately connected to its dynamics, but which has so far been scarcely investigated and taken into account. The results on the case study of the pharmacokinetics of atorvastatin corroborate the usability and reliability of the method within certain limits of the experimental errors on the data.</p>","PeriodicalId":9023,"journal":{"name":"BMC Pharmacology & Toxicology","volume":"26 Suppl 1","pages":"123"},"PeriodicalIF":2.8000,"publicationDate":"2025-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12188672/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"BMC Pharmacology & Toxicology","FirstCategoryId":"3","ListUrlMain":"https://doi.org/10.1186/s40360-025-00948-6","RegionNum":3,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHARMACOLOGY & PHARMACY","Score":null,"Total":0}
引用次数: 0

Abstract

Background: In mathematics, a physical network (e.g. biological network, social network, IT network, communication network) is usually represented by a graph. The determination of the metric space (also referred to as latent geometry) of the graph and the disposition of its nodes on it provide important information on the reaction propensity and consequently on the possible presence of bottlenecks in a system of interacting molecules, such as it happens in pharmacokinetics. To determine the latent geometry and the coordinates of nodes, it is necessary to have the dissimilarity or distance matrix of the network, an input that is not always easy to measure in experiments.

Results: The main result of this study is the mathematical and computational procedure for determining the distance/dissimilarity matrix between nodes and for identifying the latent network geometry from experimental time series of node concentrations. Specifically, we show how this matrix can be calculated from the transfer entropy between nodes, which is a measure of the flow of information between nodes and thus indirectly of the reaction propensity between them. We implemented a procedure of spectral graph embedding to embed the distance/dissimilarity matrix in flat and curved metric spaces, and consequently to determine the optimal latent geometry of the network. The distances between nodes in the metric space describing the latent geometry can be analyzed to identify bottlenecks in the reaction system. As a case study for this procedure, we consider the pharmacokinetics of atorvastatin, as described by recent studies and experimental time data.

Conclusions: The method of determining distances between nodes from temporal measurements of node concentrations through the calculation of transfer entropy makes it possible to incorporate the information of kinetics (inherent in the time series) in the construction of the distance/dissimilarity matrix, and, consequently, in the determination of the network latent geometry, a characterisation of the network itself that is intimately connected to its dynamics, but which has so far been scarcely investigated and taken into account. The results on the case study of the pharmacokinetics of atorvastatin corroborate the usability and reliability of the method within certain limits of the experimental errors on the data.

用传递熵法确定阿托伐他汀药代动力学的潜在几何特征以识别瓶颈。
背景:在数学中,物理网络(如生物网络、社会网络、IT网络、通信网络)通常用图来表示。图的度量空间(也称为潜在几何)的确定及其节点在其上的配置提供了关于反应倾向的重要信息,从而提供了在相互作用的分子系统中可能存在瓶颈的信息,例如在药代动力学中发生的情况。为了确定潜在的几何形状和节点的坐标,需要有网络的不相似性或距离矩阵,这在实验中并不容易测量。结果:本研究的主要结果是确定节点之间的距离/不相似矩阵以及从节点集中的实验时间序列中识别潜在网络几何的数学和计算过程。具体来说,我们展示了如何从节点之间的传递熵来计算这个矩阵,传递熵是节点之间信息流的度量,因此间接地反映了节点之间的反应倾向。我们实现了一种谱图嵌入程序,将距离/不相似矩阵嵌入到平坦和弯曲的度量空间中,从而确定网络的最佳潜在几何形状。度量空间中描述潜在几何结构的节点之间的距离可以用来分析反应系统中的瓶颈。作为该程序的案例研究,我们考虑阿托伐他汀的药代动力学,正如最近的研究和实验时间数据所描述的那样。结论:通过计算传递熵从节点浓度的时间测量中确定节点之间距离的方法使得在距离/不相似矩阵的构建中纳入动力学信息(固有于时间序列)成为可能,因此,在确定网络潜在几何形状时,网络本身的特征与其动力学密切相关。但到目前为止,这一点几乎没有得到调查和考虑。阿托伐他汀的药代动力学研究结果在一定的实验误差范围内证实了该方法的可用性和可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
BMC Pharmacology & Toxicology
BMC Pharmacology & Toxicology PHARMACOLOGY & PHARMACYTOXICOLOGY&nb-TOXICOLOGY
CiteScore
4.80
自引率
0.00%
发文量
87
审稿时长
12 weeks
期刊介绍: BMC Pharmacology and Toxicology is an open access, peer-reviewed journal that considers articles on all aspects of chemically defined therapeutic and toxic agents. The journal welcomes submissions from all fields of experimental and clinical pharmacology including clinical trials and toxicology.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信