首页 > 最新文献

ArXiv最新文献

英文 中文
Approximating mutual information of high-dimensional variables using learned representations. 利用学习到的表征逼近高维变量的互信息。
Pub Date : 2024-09-03
Gokul Gowri, Xiao-Kang Lun, Allon M Klein, Peng Yin

Mutual information (MI) is a general measure of statistical dependence with widespread application across the sciences. However, estimating MI between multi-dimensional variables is challenging because the number of samples necessary to converge to an accurate estimate scales unfavorably with dimensionality. In practice, existing techniques can reliably estimate MI in up to tens of dimensions, but fail in higher dimensions, where sufficient sample sizes are infeasible. Here, we explore the idea that underlying low-dimensional structure in high-dimensional data can be exploited to faithfully approximate MI in high-dimensional settings with realistic sample sizes. We develop a method that we call latent MI (LMI) approximation, which applies a nonparametric MI estimator to low-dimensional representations learned by a simple, theoretically-motivated model architecture. Using several benchmarks, we show that unlike existing techniques, LMI can approximate MI well for variables with $> 10^3$ dimensions if their dependence structure has low intrinsic dimensionality. Finally, we showcase LMI on two open problems in biology. First, we approximate MI between protein language model (pLM) representations of interacting proteins, and find that pLMs encode non-trivial information about protein-protein interactions. Second, we quantify cell fate information contained in single-cell RNA-seq (scRNA-seq) measurements of hematopoietic stem cells, and find a sharp transition during neutrophil differentiation when fate information captured by scRNA-seq increases dramatically.

互信息(MI)是统计依赖性的一般度量,广泛应用于各个科学领域。然而,估算多维变量之间的互信息具有挑战性,因为收敛到准确估算所需的样本数量与维度呈负相关。在实践中,现有技术可以可靠地估计多达几十个维度的 MI,但在更高的维度上就会失败,因为在更高的维度上,足够的样本量是不可行的。在这里,我们探讨了这样一种观点,即可以利用高维数据中潜在的低维结构,在具有实际样本量的高维环境中忠实地近似 MI。我们开发了一种称为潜在 MI(LMI)近似的方法,该方法将非参数 MI 估计器应用于通过简单的理论模型架构学习到的低维表示。我们通过几个基准测试表明,与现有技术不同的是,如果变量的依赖结构具有较低的内在维度,那么 LMI 可以很好地逼近 10^3 美元维度的变量的 MI。最后,我们在生物学的两个开放问题上展示了 LMI。首先,我们对相互作用蛋白质的蛋白质语言模型(pLM)表示之间的 MI 进行了近似,并发现 pLM 编码了蛋白质-蛋白质相互作用的非难信息。其次,我们量化了造血干细胞单细胞 RNA-seq(scRNA-seq)测量中包含的细胞命运信息,发现在中性粒细胞分化过程中,scRNA-seq 捕捉到的命运信息急剧增加。
{"title":"Approximating mutual information of high-dimensional variables using learned representations.","authors":"Gokul Gowri, Xiao-Kang Lun, Allon M Klein, Peng Yin","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Mutual information (MI) is a general measure of statistical dependence with widespread application across the sciences. However, estimating MI between multi-dimensional variables is challenging because the number of samples necessary to converge to an accurate estimate scales unfavorably with dimensionality. In practice, existing techniques can reliably estimate MI in up to tens of dimensions, but fail in higher dimensions, where sufficient sample sizes are infeasible. Here, we explore the idea that underlying low-dimensional structure in high-dimensional data can be exploited to faithfully approximate MI in high-dimensional settings with realistic sample sizes. We develop a method that we call latent MI (LMI) approximation, which applies a nonparametric MI estimator to low-dimensional representations learned by a simple, theoretically-motivated model architecture. Using several benchmarks, we show that unlike existing techniques, LMI can approximate MI well for variables with $> 10^3$ dimensions if their dependence structure has low intrinsic dimensionality. Finally, we showcase LMI on two open problems in biology. First, we approximate MI between protein language model (pLM) representations of interacting proteins, and find that pLMs encode non-trivial information about protein-protein interactions. Second, we quantify cell fate information contained in single-cell RNA-seq (scRNA-seq) measurements of hematopoietic stem cells, and find a sharp transition during neutrophil differentiation when fate information captured by scRNA-seq increases dramatically.</p>","PeriodicalId":93888,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11398540/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142303239","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}
引用次数: 0
Computational Methods to Investigate Intrinsically Disordered Proteins and their Complexes. 研究本质上无序的蛋白质及其复合物的计算方法。
Pub Date : 2024-09-03
Zi Hao Liu, Maria Tsanai, Oufan Zhang, Julie Forman-Kay, Teresa Head-Gordon

In 1999 Wright and Dyson highlighted the fact that large sections of the proteome of all organisms are comprised of protein sequences that lack globular folded structures under physiological conditions. Since then the biophysics community has made significant strides in unraveling the intricate structural and dynamic characteristics of intrinsically disordered proteins (IDPs) and intrinsically disordered regions (IDRs). Unlike crystallographic beamlines and their role in streamlining acquisition of structures for folded proteins, an integrated experimental and computational approach aimed at IDPs/IDRs has emerged. In this Perspective we aim to provide a robust overview of current computational tools for IDPs and IDRs, and most recently their complexes and phase separated states, including statistical models, physics-based approaches, and machine learning methods that permit structural ensemble generation and validation against many solution experimental data types.

1999 年,赖特和戴森强调了一个事实,即所有生物体的蛋白质组中有很大一部分是由在生理条件下缺乏球状折叠结构的蛋白质序列组成的。从那时起,生物物理学界在揭示本质无序蛋白(IDPs)和本质无序区(IDRs)错综复杂的结构和动态特征方面取得了长足的进步。与晶体学光束线及其在简化折叠蛋白质结构获取方面的作用不同,一种针对固有无序蛋白/固有无序区的综合实验和计算方法已经出现。在本《视角》中,我们将对当前针对 IDPs 和 IDRs 以及最近针对它们的复合物和相分离状态的计算工具进行有力的概述,包括统计模型、基于物理的方法和机器学习方法,这些方法允许根据许多溶液实验数据类型生成和验证结构组合。
{"title":"Computational Methods to Investigate Intrinsically Disordered Proteins and their Complexes.","authors":"Zi Hao Liu, Maria Tsanai, Oufan Zhang, Julie Forman-Kay, Teresa Head-Gordon","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>In 1999 Wright and Dyson highlighted the fact that large sections of the proteome of all organisms are comprised of protein sequences that lack globular folded structures under physiological conditions. Since then the biophysics community has made significant strides in unraveling the intricate structural and dynamic characteristics of intrinsically disordered proteins (IDPs) and intrinsically disordered regions (IDRs). Unlike crystallographic beamlines and their role in streamlining acquisition of structures for folded proteins, an integrated experimental and computational approach aimed at IDPs/IDRs has emerged. In this Perspective we aim to provide a robust overview of current computational tools for IDPs and IDRs, and most recently their complexes and phase separated states, including statistical models, physics-based approaches, and machine learning methods that permit structural ensemble generation and validation against many solution experimental data types.</p>","PeriodicalId":93888,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11398552/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142303241","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}
引用次数: 0
Ground-truth effects in learning-based fiber orientation distribution estimation in neonatal brains. 新生儿大脑中基于学习的纤维方向分布估计中的地面实况效应。
Pub Date : 2024-09-02
Rizhong Lin, Hamza Kebiri, Ali Gholipour, Yufei Chen, Jean-Philippe Thiran, Davood Karimi, Meritxell Bach Cuadra

Diffusion Magnetic Resonance Imaging (dMRI) is a noninvasive method for depicting brain microstructure in vivo. Fiber orientation distributions (FODs) are mathematical representations extensively used to map white matter fiber configurations. Recently, FOD estimation with deep neural networks has seen growing success, in particular, those of neonates estimated with fewer diffusion measurements. These methods are mostly trained on target FODs reconstructed with multi-shell multi-tissue constrained spherical deconvolution (MSMT-CSD), which might not be the ideal ground truth for developing brains. Here, we investigate this hypothesis by training a state-of-the-art model based on the U-Net architecture on both MSMT-CSD and single-shell three-tissue constrained spherical deconvolution (SS3T-CSD). Our results suggest that SS3T-CSD might be more suited for neonatal brains, given that the ratio between single and multiple fiber-estimated voxels with SS3T-CSD is more realistic compared to MSMT-CSD. Additionally, increasing the number of input gradient directions significantly improves performance with SS3T-CSD over MSMT-CSD. Finally, in an age domain-shift setting, SS3T-CSD maintains robust performance across age groups, indicating its potential for more accurate neonatal brain imaging.

弥散磁共振成像(dMRI)是一种描绘体内大脑微观结构的无创方法。纤维定向分布(FOD)是一种数学表示方法,广泛用于绘制白质纤维配置图。最近,利用深度神经网络估算纤维定向分布取得了越来越多的成功,尤其是利用较少的扩散测量估算新生儿的纤维定向分布。这些方法大多是根据多壳多组织约束球形去卷积(MSMT-CSD)重建的目标 FOD 进行训练的,而对于发育中的大脑来说,这可能并不是理想的地面实况。在这里,我们通过在 MSMT-CSD 和单壳三组织约束球面解卷积(SS3T-CSD)上训练基于 U-Net 架构的最先进模型来研究这一假设。我们的研究结果表明,SS3T-CSD 可能更适合新生儿大脑,因为与 MSMT-CSD 相比,SS3T-CSD 估算的单纤维和多纤维体素之间的比例更符合实际情况。此外,与 MSMT-CSD 相比,增加输入梯度方向的数量能显著提高 SS3T-CSD 的性能。最后,在年龄域偏移设置中,SS3T-CSD 在不同年龄组都能保持稳定的性能,这表明它有潜力用于更精确的新生儿大脑成像。
{"title":"Ground-truth effects in learning-based fiber orientation distribution estimation in neonatal brains.","authors":"Rizhong Lin, Hamza Kebiri, Ali Gholipour, Yufei Chen, Jean-Philippe Thiran, Davood Karimi, Meritxell Bach Cuadra","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Diffusion Magnetic Resonance Imaging (dMRI) is a noninvasive method for depicting brain microstructure <i>in vivo</i>. Fiber orientation distributions (FODs) are mathematical representations extensively used to map white matter fiber configurations. Recently, FOD estimation with deep neural networks has seen growing success, in particular, those of neonates estimated with fewer diffusion measurements. These methods are mostly trained on target FODs reconstructed with <i>multi-shell multi-tissue constrained spherical deconvolution</i> (MSMT-CSD), which might not be the ideal ground truth for developing brains. Here, we investigate this hypothesis by training a state-of-the-art model based on the U-Net architecture on both MSMT-CSD and <i>single-shell three-tissue constrained spherical deconvolution</i> (SS3T-CSD). Our results suggest that SS3T-CSD might be more suited for neonatal brains, given that the ratio between single and multiple fiber-estimated voxels with SS3T-CSD is more realistic compared to MSMT-CSD. Additionally, increasing the number of input gradient directions significantly improves performance with SS3T-CSD over MSMT-CSD. Finally, in an age domain-shift setting, SS3T-CSD maintains robust performance across age groups, indicating its potential for more accurate neonatal brain imaging.</p>","PeriodicalId":93888,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11398543/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142303254","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}
引用次数: 0
Equivariant Scalar Fields for Molecular Docking with Fast Fourier Transforms. 利用快速傅立叶变换实现分子对接的等变标量场
Pub Date : 2024-09-01
Bowen Jing, Tommi Jaakkola, Bonnie Berger

Molecular docking is critical to structure-based virtual screening, yet the throughput of such workflows is limited by the expensive optimization of scoring functions involved in most docking algorithms. We explore how machine learning can accelerate this process by learning a scoring function with a functional form that allows for more rapid optimization. Specifically, we define the scoring function to be the cross-correlation of multi-channel ligand and protein scalar fields parameterized by equivariant graph neural networks, enabling rapid optimization over rigid-body degrees of freedom with fast Fourier transforms. The runtime of our approach can be amortized at several levels of abstraction, and is particularly favorable for virtual screening settings with a common binding pocket. We benchmark our scoring functions on two simplified docking-related tasks: decoy pose scoring and rigid conformer docking. Our method attains similar but faster performance on crystal structures compared to the widely-used Vina and Gnina scoring functions, and is more robust on computationally predicted structures. Code is available at https://github.com/bjing2016/scalar-fields.

分子对接对于基于结构的虚拟筛选至关重要,但由于大多数对接算法都需要对评分函数进行昂贵的优化,因此限制了此类工作流程的吞吐量。我们探讨了机器学习如何通过学习具有更快速优化功能形式的评分函数来加速这一过程。具体来说,我们将评分函数定义为由等变图神经网络参数化的多通道配体和蛋白质标量场的交叉相关性,从而通过快速傅立叶变换对刚体自由度进行快速优化。我们方法的运行时间可在多个抽象层级上摊销,尤其适用于具有共同结合口袋的虚拟筛选设置。我们在两个简化的对接相关任务上对我们的评分函数进行了基准测试:诱饵姿势评分和刚性构象对接。与广泛使用的 Vina 和 Gnina 评分函数相比,我们的方法在晶体结构上取得了相似但更快的性能,而且在计算预测结构上更加稳健。代码见 https://github.com/bjing2016/scalar-fields。
{"title":"Equivariant Scalar Fields for Molecular Docking with Fast Fourier Transforms.","authors":"Bowen Jing, Tommi Jaakkola, Bonnie Berger","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Molecular docking is critical to structure-based virtual screening, yet the throughput of such workflows is limited by the expensive optimization of scoring functions involved in most docking algorithms. We explore how machine learning can accelerate this process by learning a scoring function with a functional form that allows for more rapid optimization. Specifically, we define the scoring function to be the cross-correlation of multi-channel ligand and protein scalar fields parameterized by equivariant graph neural networks, enabling rapid optimization over rigid-body degrees of freedom with fast Fourier transforms. The runtime of our approach can be amortized at several levels of abstraction, and is particularly favorable for virtual screening settings with a common binding pocket. We benchmark our scoring functions on two simplified docking-related tasks: decoy pose scoring and rigid conformer docking. Our method attains similar but faster performance on crystal structures compared to the widely-used Vina and Gnina scoring functions, and is more robust on computationally predicted structures. Code is available at https://github.com/bjing2016/scalar-fields.</p>","PeriodicalId":93888,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10723544/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138806139","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}
引用次数: 0
Hidden Flaws Behind Expert-Level Accuracy of Multimodal GPT-4 Vision in Medicine. GPT-4 医学视觉专家级精确度背后的隐患。
Pub Date : 2024-08-31
Qiao Jin, Fangyuan Chen, Yiliang Zhou, Ziyang Xu, Justin M Cheung, Robert Chen, Ronald M Summers, Justin F Rousseau, Peiyun Ni, Marc J Landsman, Sally L Baxter, Subhi J Al'Aref, Yijia Li, Alexander Chen, Josef A Brejt, Michael F Chiang, Yifan Peng, Zhiyong Lu

Recent studies indicate that Generative Pre-trained Transformer 4 with Vision (GPT-4V) outperforms human physicians in medical challenge tasks. However, these evaluations primarily focused on the accuracy of multi-choice questions alone. Our study extends the current scope by conducting a comprehensive analysis of GPT-4V's rationales of image comprehension, recall of medical knowledge, and step-by-step multimodal reasoning when solving New England Journal of Medicine (NEJM) Image Challenges - an imaging quiz designed to test the knowledge and diagnostic capabilities of medical professionals. Evaluation results confirmed that GPT-4V performs comparatively to human physicians regarding multi-choice accuracy (81.6% vs. 77.8%). GPT-4V also performs well in cases where physicians incorrectly answer, with over 78% accuracy. However, we discovered that GPT-4V frequently presents flawed rationales in cases where it makes the correct final choices (35.5%), most prominent in image comprehension (27.2%). Regardless of GPT-4V's high accuracy in multi-choice questions, our findings emphasize the necessity for further in-depth evaluations of its rationales before integrating such multimodal AI models into clinical workflows.

最近的研究表明,带视觉的生成预训练变换器 4(GPT-4V)在医疗挑战任务中的表现优于人类医生。然而,这些评估主要集中在多选题的准确性上。我们的研究扩展了目前的研究范围,全面分析了 GPT-4V 在解决《新英格兰医学杂志》(NEJM)图像挑战时的图像理解、医学知识回忆和分步多模态推理能力。评估结果证实,GPT-4V 在多选准确率方面优于人类医生(88.0% 对 77.0%,P=0.034)。在医生回答错误的情况下,GPT-4V 也表现出色,准确率超过 80%。然而,我们发现 GPT-4V 在做出正确的最终选择(27.3%)时,经常会提出有缺陷的理由,这在图像理解方面最为突出(21.6%)。尽管 GPT-4V 在多选题中的准确率很高,但我们的发现强调,在将此类模型整合到临床工作流程之前,有必要进一步深入评估其合理性。
{"title":"Hidden Flaws Behind Expert-Level Accuracy of Multimodal GPT-4 Vision in Medicine.","authors":"Qiao Jin, Fangyuan Chen, Yiliang Zhou, Ziyang Xu, Justin M Cheung, Robert Chen, Ronald M Summers, Justin F Rousseau, Peiyun Ni, Marc J Landsman, Sally L Baxter, Subhi J Al'Aref, Yijia Li, Alexander Chen, Josef A Brejt, Michael F Chiang, Yifan Peng, Zhiyong Lu","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Recent studies indicate that Generative Pre-trained Transformer 4 with Vision (GPT-4V) outperforms human physicians in medical challenge tasks. However, these evaluations primarily focused on the accuracy of multi-choice questions alone. Our study extends the current scope by conducting a comprehensive analysis of GPT-4V's rationales of image comprehension, recall of medical knowledge, and step-by-step multimodal reasoning when solving <i>New England Journal of Medicine</i> (NEJM) Image Challenges - an imaging quiz designed to test the knowledge and diagnostic capabilities of medical professionals. Evaluation results confirmed that GPT-4V performs comparatively to human physicians regarding multi-choice accuracy (81.6% vs. 77.8%). GPT-4V also performs well in cases where physicians incorrectly answer, with over 78% accuracy. However, we discovered that GPT-4V frequently presents flawed rationales in cases where it makes the correct final choices (35.5%), most prominent in image comprehension (27.2%). Regardless of GPT-4V's high accuracy in multi-choice questions, our findings emphasize the necessity for further in-depth evaluations of its rationales before integrating such multimodal AI models into clinical workflows.</p>","PeriodicalId":93888,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10896362/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139974956","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}
引用次数: 0
FAST functional connectivity implicates P300 connectivity in working memory deficits in Alzheimer's disease. FAST 功能连接与阿尔茨海默病工作记忆缺陷中的 P300 连接有关。
Pub Date : 2024-08-30
Om Roy, Yashar Moshfeghi, Agustin Ibanez, Francisco Lopera, Mario A Parra, Keith M Smith

Measuring transient functional connectivity is an important challenge in Electroencephalogram (EEG) research. Here, the rich potential for insightful, discriminative information of brain activity offered by high temporal resolution is confounded by the inherent noise of the medium and the spurious nature of correlations computed over short temporal windows. We propose a novel methodology to overcome these problems called Filter Average Short-Term (FAST) functional connectivity. First, long-term, stable, functional connectivity is averaged across an entire study cohort for a given pair of Visual Short Term Memory (VSTM) tasks. The resulting average connectivity matrix, containing information on the strongest general connections for the tasks, is used as a filter to analyse the transient high temporal resolution functional connectivity of individual subjects. In simulations, we show that this method accurately discriminates differences in noisy Event-Related Potentials (ERPs) between two conditions where standard connectivity and other comparable methods fail. We then apply this to analyse activity related to visual short-term memory binding deficits in two cohorts of familial and sporadic Alzheimer's disease. Reproducible significant differences were found in the binding task with no significant difference in the shape task in the P300 ERP range. This allows new sensitive measurements of transient functional connectivity, which can be implemented to obtain results of clinical significance.

测量瞬时功能连接是脑电图(EEG)研究中的一项重要挑战。在这里,高时间分辨率所提供的大脑活动的洞察力和鉴别信息的巨大潜力受到了介质固有噪声和短时窗计算相关性的虚假性的干扰。我们提出了一种克服这些问题的新方法,称为滤波平均短时(FAST)功能连接。首先,针对给定的一对视觉短时记忆(VSTM)任务,对整个研究队列中的长期、稳定的功能连通性进行平均。由此产生的平均连通性矩阵包含任务中最强的一般连通性信息,可用作过滤器来分析单个受试者的瞬时高时间分辨率功能连通性。在模拟实验中,我们发现这种方法能准确区分两种情况下的噪声事件相关电位(ERPs)差异,而标准连通性和其他类似方法都无法做到这一点。然后,我们将此方法应用于分析与家族性和散发性阿尔茨海默病两个队列中视觉短期记忆结合缺陷相关的活动。在 P300 ERP 范围内,结合任务中发现了可重复的显著差异,而形状任务中则没有显著差异。这样就可以对瞬时功能连通性进行新的敏感测量,从而获得具有临床意义的结果。
{"title":"FAST functional connectivity implicates P300 connectivity in working memory deficits in Alzheimer's disease.","authors":"Om Roy, Yashar Moshfeghi, Agustin Ibanez, Francisco Lopera, Mario A Parra, Keith M Smith","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Measuring transient functional connectivity is an important challenge in Electroencephalogram (EEG) research. Here, the rich potential for insightful, discriminative information of brain activity offered by high temporal resolution is confounded by the inherent noise of the medium and the spurious nature of correlations computed over short temporal windows. We propose a novel methodology to overcome these problems called Filter Average Short-Term (FAST) functional connectivity. First, long-term, stable, functional connectivity is averaged across an entire study cohort for a given pair of Visual Short Term Memory (VSTM) tasks. The resulting average connectivity matrix, containing information on the strongest general connections for the tasks, is used as a filter to analyse the transient high temporal resolution functional connectivity of individual subjects. In simulations, we show that this method accurately discriminates differences in noisy Event-Related Potentials (ERPs) between two conditions where standard connectivity and other comparable methods fail. We then apply this to analyse activity related to visual short-term memory binding deficits in two cohorts of familial and sporadic Alzheimer's disease. Reproducible significant differences were found in the binding task with no significant difference in the shape task in the P300 ERP range. This allows new sensitive measurements of transient functional connectivity, which can be implemented to obtain results of clinical significance.</p>","PeriodicalId":93888,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10925378/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140095350","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}
引用次数: 0
BioBricks.ai: A Versioned Data Registry for Life Sciences Data Assets. BioBricks.ai:生命科学数据资产的版本化数据注册中心。
Pub Date : 2024-08-30
Yifan Gao, Zakariyya Mughal, Jose A Jaramillo-Villegas, Marie Corradi, Alexandre Borrel, Ben Lieberman, Suliman Sharif, John Shaffer, Karamarie Fecho, Ajay Chatrath, Alexandra Maertens, Marc A T Teunis, Nicole Kleinstreuer, Thomas Hartung, Thomas Luechtefeld

Researchers in biomedical research, public health and the life sciences often spend weeks or months discovering, accessing, curating, and integrating data from disparate sources, significantly delaying the onset of actual analysis and innovation. Instead of countless developers creating redundant and inconsistent data pipelines, BioBricks.ai offers a centralized data repository and a suite of developer-friendly tools to simplify access to scientific data. Currently, BioBricks.ai delivers over ninety biological and chemical datasets. It provides a package manager-like system for installing and managing dependencies on data sources. Each 'brick' is a Data Version Control git repository that supports an updateable pipeline for extraction, transformation, and loading data into the BioBricks.ai backend at https://biobricks.ai. Use cases include accelerating data science workflows and facilitating the creation of novel data assets by integrating multiple datasets into unified, harmonized resources. In conclusion, BioBricks.ai offers an opportunity to accelerate access and use of public data through a single open platform.

生物医学研究、公共卫生和生命科学领域的研究人员往往需要花费数周或数月的时间来发现、访问、整理和整合来自不同来源的数据,这大大延误了实际分析和创新的开始。BioBricks.ai 提供了一个集中式数据存储库和一套开发人员友好型工具来简化科学数据的访问,而不是让无数开发人员创建冗余且不一致的数据管道。目前,BioBricks.ai 提供九十多个生物和化学数据集。它提供了一个类似于软件包管理器的系统,用于安装和管理数据源的依赖关系。每个 "砖块 "都是一个数据版本控制 git 仓库,它支持一个可更新的管道,用于提取、转换数据并将数据加载到 BioBricks.ai 的后端 https://biobricks.ai。使用案例包括加速数据科学工作流程,以及通过将多个数据集整合到统一协调的资源中来促进新型数据资产的创建。总之,BioBricks.ai 提供了一个通过单一开放平台加速访问和使用公共数据的机会。
{"title":"BioBricks.ai: A Versioned Data Registry for Life Sciences Data Assets.","authors":"Yifan Gao, Zakariyya Mughal, Jose A Jaramillo-Villegas, Marie Corradi, Alexandre Borrel, Ben Lieberman, Suliman Sharif, John Shaffer, Karamarie Fecho, Ajay Chatrath, Alexandra Maertens, Marc A T Teunis, Nicole Kleinstreuer, Thomas Hartung, Thomas Luechtefeld","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Researchers in biomedical research, public health and the life sciences often spend weeks or months discovering, accessing, curating, and integrating data from disparate sources, significantly delaying the onset of actual analysis and innovation. Instead of countless developers creating redundant and inconsistent data pipelines, BioBricks.ai offers a centralized data repository and a suite of developer-friendly tools to simplify access to scientific data. Currently, BioBricks.ai delivers over ninety biological and chemical datasets. It provides a package manager-like system for installing and managing dependencies on data sources. Each 'brick' is a Data Version Control git repository that supports an updateable pipeline for extraction, transformation, and loading data into the BioBricks.ai backend at https://biobricks.ai. Use cases include accelerating data science workflows and facilitating the creation of novel data assets by integrating multiple datasets into unified, harmonized resources. In conclusion, BioBricks.ai offers an opportunity to accelerate access and use of public data through a single open platform.</p>","PeriodicalId":93888,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11383443/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142303240","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}
引用次数: 0
Harmonizing the Generation and Pre-publication Stewardship of FAIR bioimage data. 统一 FAIR 图像数据的生成和出版前管理。
Pub Date : 2024-08-30
Nikki Bialy, Frank Alber, Brenda Andrews, Michael Angelo, Brian Beliveau, Lacramioara Bintu, Alistair Boettiger, Ulrike Boehm, Claire M Brown, Mahmoud Bukar Maina, James J Chambers, Beth A Cimini, Kevin Eliceiri, Rachel Errington, Orestis Faklaris, Nathalie Gaudreault, Ronald N Germain, Wojtek Goscinski, David Grunwald, Michael Halter, Dorit Hanein, John W Hickey, Judith Lacoste, Alex Laude, Emma Lundberg, Jian Ma, Leonel Malacrida, Josh Moore, Glyn Nelson, Elizabeth Kathleen Neumann, Roland Nitschke, Shuichi Onami, Jaime A Pimentel, Anne L Plant, Andrea J Radtke, Bikash Sabata, Denis Schapiro, Johannes Schöneberg, Jeffrey M Spraggins, Damir Sudar, Wouter-Michiel Adrien Maria Vierdag, Niels Volkmann, Carolina Wählby, Siyuan Steven Wang, Ziv Yaniv, Caterina Strambio-De-Castillia

Together with the molecular knowledge of genes and proteins, biological images promise to significantly enhance the scientific understanding of complex cellular systems and to advance predictive and personalized therapeutic products for human health. For this potential to be realized, quality-assured bioimage data must be shared among labs at a global scale to be compared, pooled, and reanalyzed, thus unleashing untold potential beyond the original purpose for which the data was generated. There are two broad sets of requirements to enable bioimage data sharing in the life sciences. One set of requirements is articulated in the companion White Paper entitled "Enabling Global Image Data Sharing in the Life Sciences," which is published in parallel and addresses the need to build the cyberinfrastructure for sharing bioimage data (arXiv:2401.13023 [q-bio.OT], https://doi.org/10.48550/arXiv.2401.13023). Here, we detail a broad set of requirements, which involves collecting, managing, presenting, and propagating contextual information essential to assess the quality, understand the content, interpret the scientific implications, and reuse bioimage data in the context of the experimental details. We start by providing an overview of the main lessons learned to date through international community activities, which have recently made generating community standard practices for imaging Quality Control (QC) and metadata (Faklaris et al., 2022; Hammer et al., 2021; Huisman et al., 2021; Microscopy Australia, 2016; Montero Llopis et al., 2021; Rigano et al., 2021; Sarkans et al., 2021). We then provide a clear set of recommendations for amplifying this work. The driving goal is to address remaining challenges and democratize access to common practices and tools for a spectrum of biomedical researchers, regardless of their expertise, access to resources, and geographical location.

生物图像与基因和蛋白质的分子知识一起,有望极大地提高人们对复杂细胞系统的科学认识,并为人类健康提供预测性和个性化的治疗产品。要实现这一潜力,实验室之间必须在全球范围内共享有质量保证的图像数据,以便进行比较、汇集和重新分析,从而释放出超出数据生成原始目的的巨大潜力。要实现生命科学领域的图像数据共享,需要满足两大类要求。其中一组要求在题为 "促进生命科学领域的全球图像数据共享 "的配套白皮书中有所阐述,该白皮书同时发布,旨在满足建立共享数字阵列数据的网络基础设施的需求。在本白皮书中,我们详细介绍了一系列广泛的要求,其中包括收集、管理、展示和传播背景信息,这些信息对于评估质量、理解内容、解释科学意义以及在实验细节背景下重复使用图像数据至关重要。我们首先概述了迄今为止从国际社区活动中吸取的主要经验教训,这些活动最近在制定成像质量控制(QC)和元数据的社区标准实践方面取得了重大进展。然后,我们提出了一系列明确的建议,以扩大这项工作。推动这项工作的目标是解决剩余的挑战,并使各种生物医学研究人员都能获得日常实践和工具,无论他们的专业知识、资源获取能力和地理位置如何。
{"title":"Harmonizing the Generation and Pre-publication Stewardship of FAIR bioimage data.","authors":"Nikki Bialy, Frank Alber, Brenda Andrews, Michael Angelo, Brian Beliveau, Lacramioara Bintu, Alistair Boettiger, Ulrike Boehm, Claire M Brown, Mahmoud Bukar Maina, James J Chambers, Beth A Cimini, Kevin Eliceiri, Rachel Errington, Orestis Faklaris, Nathalie Gaudreault, Ronald N Germain, Wojtek Goscinski, David Grunwald, Michael Halter, Dorit Hanein, John W Hickey, Judith Lacoste, Alex Laude, Emma Lundberg, Jian Ma, Leonel Malacrida, Josh Moore, Glyn Nelson, Elizabeth Kathleen Neumann, Roland Nitschke, Shuichi Onami, Jaime A Pimentel, Anne L Plant, Andrea J Radtke, Bikash Sabata, Denis Schapiro, Johannes Schöneberg, Jeffrey M Spraggins, Damir Sudar, Wouter-Michiel Adrien Maria Vierdag, Niels Volkmann, Carolina Wählby, Siyuan Steven Wang, Ziv Yaniv, Caterina Strambio-De-Castillia","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Together with the molecular knowledge of genes and proteins, biological images promise to significantly enhance the scientific understanding of complex cellular systems and to advance predictive and personalized therapeutic products for human health. For this potential to be realized, quality-assured bioimage data must be shared among labs at a global scale to be compared, pooled, and reanalyzed, thus unleashing untold potential beyond the original purpose for which the data was generated. There are two broad sets of requirements to enable bioimage data sharing in the life sciences. One set of requirements is articulated in the companion White Paper entitled \"Enabling Global Image Data Sharing in the Life Sciences,\" which is published in parallel and addresses the need to build the cyberinfrastructure for sharing bioimage data (arXiv:2401.13023 [q-bio.OT], https://doi.org/10.48550/arXiv.2401.13023). Here, we detail a broad set of requirements, which involves collecting, managing, presenting, and propagating contextual information essential to assess the quality, understand the content, interpret the scientific implications, and reuse bioimage data in the context of the experimental details. We start by providing an overview of the main lessons learned to date through international community activities, which have recently made generating community standard practices for imaging Quality Control (QC) and metadata (Faklaris et al., 2022; Hammer et al., 2021; Huisman et al., 2021; <i>Microscopy Australia</i>, 2016; Montero Llopis et al., 2021; Rigano et al., 2021; Sarkans et al., 2021). We then provide a clear set of recommendations for amplifying this work. The driving goal is to address remaining challenges and democratize access to common practices and tools for a spectrum of biomedical researchers, regardless of their expertise, access to resources, and geographical location.</p>","PeriodicalId":93888,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10862930/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139731191","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}
引用次数: 0
CONNECTING MASS-ACTION MODELS AND NETWORK MODELS FOR INFECTIOUS DISEASES. 将传染病的大规模效应模型和网络模型联系起来。
Pub Date : 2024-08-27
Thien-Minh Le, Jukka-Pekka Onnela

Infectious disease modeling is used to forecast epidemics and assess the effectiveness of intervention strategies. Although the core assumption of mass-action models of homogeneously mixed population is often implausible, they are nevertheless routinely used in studying epidemics and provide useful insights. Network models can account for the heterogeneous mixing of populations, which is especially important for studying sexually transmitted diseases. Despite the abundance of research on mass-action and network models, the relationship between them is not well understood. Here, we attempt to bridge the gap by first identifying a spreading rule that results in an exact match between disease spreading on a fully connected network and the classic mass-action models. We then propose a method for mapping epidemic spread on arbitrary networks to a form similar to that of mass-action models. We also provide a theoretical justification for the procedure. Finally, we show the advantages of the proposed methods using synthetic data that is based on an empirical network. These findings help us understand when mass-action models and network models are expected to provide similar results and identify reasons when they do not.

传染病模型用于预测流行病和评估干预策略的有效性。虽然质量作用模型的核心假设是人口的同质混合,但这一假设往往是不可信的,不过,这些模型还是经常被用于研究流行病,并提供了有用的见解。网络模型可以解释人口的异质混合,这对研究性传播疾病尤为重要。尽管有关质量作用模型和网络模型的研究很多,但人们对它们之间的关系还不甚了解。在这里,我们试图弥补这一差距,首先找出一种传播规则,使疾病在全连接网络上的传播与经典的质量-作用模型完全吻合。然后,我们提出一种方法,将任意网络上的流行病传播映射为与质量-作用模型类似的形式。我们还为这一程序提供了理论依据。最后,我们利用基于经验网络的合成数据展示了所提方法的优势。这些发现有助于我们理解什么情况下质量-作用模型和网络模型有望提供相似的结果,并找出它们不能提供相似结果的原因。
{"title":"CONNECTING MASS-ACTION MODELS AND NETWORK MODELS FOR INFECTIOUS DISEASES.","authors":"Thien-Minh Le, Jukka-Pekka Onnela","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Infectious disease modeling is used to forecast epidemics and assess the effectiveness of intervention strategies. Although the core assumption of mass-action models of homogeneously mixed population is often implausible, they are nevertheless routinely used in studying epidemics and provide useful insights. Network models can account for the heterogeneous mixing of populations, which is especially important for studying sexually transmitted diseases. Despite the abundance of research on mass-action and network models, the relationship between them is not well understood. Here, we attempt to bridge the gap by first identifying a spreading rule that results in an exact match between disease spreading on a fully connected network and the classic mass-action models. We then propose a method for mapping epidemic spread on arbitrary networks to a form similar to that of mass-action models. We also provide a theoretical justification for the procedure. Finally, we show the advantages of the proposed methods using synthetic data that is based on an empirical network. These findings help us understand when mass-action models and network models are expected to provide similar results and identify reasons when they do not.</p>","PeriodicalId":93888,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11383442/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142303242","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}
引用次数: 0
Streamline tractography of the fetal brain in utero with machine learning. 利用机器学习对宫内胎儿大脑进行流线型束描。
Pub Date : 2024-08-26
Weide Liu, Camilo Calixto, Simon K Warfield, Davood Karimi

Diffusion-weighted magnetic resonance imaging (dMRI) is the only non-invasive tool for studying white matter tracts and structural connectivity of the brain. These assessments rely heavily on tractography techniques, which reconstruct virtual streamlines representing white matter fibers. Much effort has been devoted to improving tractography methodology for adult brains, while tractography of the fetal brain has been largely neglected. Fetal tractography faces unique difficulties due to low dMRI signal quality, immature and rapidly developing brain structures, and paucity of reference data. To address these challenges, this work presents the first machine learning model, based on a deep neural network, for fetal tractography. The model input consists of five different sources of information: (1) Voxel-wise fiber orientation, inferred from a diffusion tensor fit to the dMRI signal; (2) Directions of recent propagation steps; (3) Global spatial information, encoded as normalized distances to keypoints in the brain cortex; (4) Tissue segmentation information; and (5) Prior information about the expected local fiber orientations supplied with an atlas. In order to mitigate the local tensor estimation error, a large spatial context around the current point in the diffusion tensor image is encoded using convolutional and attention neural network modules. Moreover, the diffusion tensor information at a hypothetical next point is included in the model input. Filtering rules based on anatomically constrained tractography are applied to prune implausible streamlines. We trained the model on manually-refined whole-brain fetal tractograms and validated the trained model on an independent set of 11 test scans with gestational ages between 23 and 36 weeks. Results show that our proposed method achieves superior performance across all evaluated tracts. The new method can significantly advance the capabilities of dMRI for studying normal and abnormal brain development in utero.

弥散加权磁共振成像(dMRI)是研究大脑白质束和结构连接的唯一无创工具。这些评估在很大程度上依赖于束成像技术,该技术可重建代表白质纤维的虚拟流线。人们一直在努力改进成人大脑的束流成像方法,而胎儿大脑的束流成像却在很大程度上被忽视了。由于 dMRI 信号质量低、大脑结构尚未成熟且发育迅速、参考数据匮乏等原因,胎儿脑束流成像面临着独特的困难。为了应对这些挑战,这项研究首次提出了基于深度神经网络的胎儿脑束成像机器学习模型。该模型的输入由五个不同的信息源组成:(1)从扩散张量拟合 dMRI 信号推断出的体素纤维方向;(2)最近传播步骤的方向;(3)全局空间信息,编码为到大脑皮层关键点的归一化距离;(4)组织分割信息;以及(5)通过图谱提供的预期局部纤维方向的先验信息。为了减少局部张量估计误差,使用卷积和注意力神经网络模块对扩散张量图像中当前点周围的大空间背景进行编码。此外,模型输入还包括假设下一点的扩散张量信息。基于解剖学约束束学的过滤规则被应用于修剪难以置信的流线。我们在人工改进的全脑胎儿牵引图上对模型进行了训练,并在一组独立的 11 个测试扫描(胎龄在 23 到 36 周之间)上对训练后的模型进行了验证。结果表明,我们提出的方法在所有被评估的神经束中都取得了优异的性能。这种新方法能大大提高 dMRI 研究宫内正常和异常大脑发育的能力。
{"title":"Streamline tractography of the fetal brain in utero with machine learning.","authors":"Weide Liu, Camilo Calixto, Simon K Warfield, Davood Karimi","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Diffusion-weighted magnetic resonance imaging (dMRI) is the only non-invasive tool for studying white matter tracts and structural connectivity of the brain. These assessments rely heavily on tractography techniques, which reconstruct virtual streamlines representing white matter fibers. Much effort has been devoted to improving tractography methodology for adult brains, while tractography of the fetal brain has been largely neglected. Fetal tractography faces unique difficulties due to low dMRI signal quality, immature and rapidly developing brain structures, and paucity of reference data. To address these challenges, this work presents the first machine learning model, based on a deep neural network, for fetal tractography. The model input consists of five different sources of information: (1) Voxel-wise fiber orientation, inferred from a diffusion tensor fit to the dMRI signal; (2) Directions of recent propagation steps; (3) Global spatial information, encoded as normalized distances to keypoints in the brain cortex; (4) Tissue segmentation information; and (5) Prior information about the expected local fiber orientations supplied with an atlas. In order to mitigate the local tensor estimation error, a large spatial context around the current point in the diffusion tensor image is encoded using convolutional and attention neural network modules. Moreover, the diffusion tensor information at a hypothetical next point is included in the model input. Filtering rules based on anatomically constrained tractography are applied to prune implausible streamlines. We trained the model on manually-refined whole-brain fetal tractograms and validated the trained model on an independent set of 11 test scans with gestational ages between 23 and 36 weeks. Results show that our proposed method achieves superior performance across all evaluated tracts. The new method can significantly advance the capabilities of dMRI for studying normal and abnormal brain development in utero.</p>","PeriodicalId":93888,"journal":{"name":"ArXiv","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11383324/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142303265","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}
引用次数: 0
期刊
ArXiv
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1