首页 > 最新文献

ArXiv最新文献

英文 中文
LinearAlifold: Linear-Time Consensus Structure Prediction for RNA Alignments. LinearAlifold:RNA 对齐的线性时间共识结构预测
Pub Date : 2024-07-05
Apoorv Malik, Liang Zhang, Milan Gautam, Ning Dai, Sizhen Li, He Zhang, David H Mathews, Liang Huang

Predicting the consensus structure of a set of aligned RNA homologs is a convenient method to find conserved structures in an RNA genome, which has many applications including viral diagnostics and therapeutics. However, the most commonly used tool for this task, RNAalifold, is prohibitively slow for long sequences, due to a cubic scaling with the sequence length, taking over a day on 400 SARS-CoV-2 and SARS-related genomes (~30,000nt). We present LinearAlifold, a much faster alternative that scales linearly with both the sequence length and the number of sequences, based on our work LinearFold that folds a single RNA in linear time. Our work is orders of magnitude faster than RNAalifold (0.7 hours on the above 400 genomes, or ~36$times$ speedup) and achieves higher accuracies when compared to a database of known structures. More interestingly, LinearAlifold's prediction on SARS-CoV-2 correlates well with experimentally determined structures, substantially outperforming RNAalifold. Finally, LinearAlifold supports two energy models (Vienna and BL*) and four modes: minimum free energy (MFE), maximum expected accuracy (MEA), ThreshKnot, and stochastic sampling, each of which takes under an hour for hundreds of SARS-CoV variants. Our resource is at: https://github.com/LinearFold/LinearAlifold (code) and http://linearfold.org/linear-alifold (server).

预测一组对齐的 RNA 同源物的共识结构是发现 RNA 基因组中保守结构的一种便捷方法,它在病毒诊断和治疗等方面有很多应用。然而,最常用的工具 RNAalifold 在处理长序列时速度太慢,因为序列长度呈立方缩放,处理 400 个 SARS-CoV-2 和 SARS 相关基因组(约 30,000nt )需要一天多的时间。我们提出的 LinearAlifold 是一种更快的替代方法,它与序列长度和序列数量成线性比例,基于我们在线性时间内折叠单个 RNA 的工作 LinearFold。我们的工作比 RNAalifold 快了几个数量级(在上述 400 个基因组上只用了 0.7 个小时,即加快了约 36 倍),而且与已知结构数据库相比,达到了更高的精确度。更有趣的是,LinearAlifold 对 SARS-CoV-2 的预测与实验确定的结构有很好的相关性,大大超过了 RNAalifold。最后,LinearAlifold 支持两种能量模型(Vienna 和 BL*)和四种模式:最小自由能 (MFE)、最大预期准确度 (MEA)、ThreshKnot 和随机抽样,其中每种模式对数百种 SARS-CoV 变体的预测时间都不超过一小时。我们的资源位于:https://github.com/LinearFold/LinearAlifold(代码)和 http://linearfold.org/linear-alifold(服务器)。
{"title":"LinearAlifold: Linear-Time Consensus Structure Prediction for RNA Alignments.","authors":"Apoorv Malik, Liang Zhang, Milan Gautam, Ning Dai, Sizhen Li, He Zhang, David H Mathews, Liang Huang","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Predicting the consensus structure of a set of aligned RNA homologs is a convenient method to find conserved structures in an RNA genome, which has many applications including viral diagnostics and therapeutics. However, the most commonly used tool for this task, RNAalifold, is prohibitively slow for long sequences, due to a cubic scaling with the sequence length, taking over a day on 400 SARS-CoV-2 and SARS-related genomes (~30,000nt). We present LinearAlifold, a much faster alternative that scales linearly with both the sequence length and the number of sequences, based on our work LinearFold that folds a single RNA in linear time. Our work is orders of magnitude faster than RNAalifold (0.7 hours on the above 400 genomes, or ~36$times$ speedup) and achieves higher accuracies when compared to a database of known structures. More interestingly, LinearAlifold's prediction on SARS-CoV-2 correlates well with experimentally determined structures, substantially outperforming RNAalifold. Finally, LinearAlifold supports two energy models (Vienna and BL*) and four modes: minimum free energy (MFE), maximum expected accuracy (MEA), ThreshKnot, and stochastic sampling, each of which takes under an hour for hundreds of SARS-CoV variants. Our resource is at: https://github.com/LinearFold/LinearAlifold (code) and http://linearfold.org/linear-alifold (server).</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9258297/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40566128","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
Gene Set Summarization Using Large Language Models. 使用大型语言模型的基因集摘要。
Pub Date : 2024-07-04
Marcin P Joachimiak, J Harry Caufield, Nomi L Harris, Hyeongsik Kim, Christopher J Mungall

Molecular biologists frequently interpret gene lists derived from high-throughput experiments and computational analysis. This is typically done as a statistical enrichment analysis that measures the over- or under-representation of biological function terms associated with genes or their properties, based on curated assertions from a knowledge base (KB) such as the Gene Ontology (GO). Interpreting gene lists can also be framed as a textual summarization task, enabling Large Language Models (LLMs) to use scientific texts directly and avoid reliance on a KB. TALISMAN (Terminological ArtificiaL Intelligence SuMmarization of Annotation and Narratives) uses generative AI to perform gene set function summarization as a complement to standard enrichment analysis. This method can use different sources of gene functional information: (1) structured text derived from curated ontological KB annotations, (2) ontology-free narrative gene summaries, or (3) direct retrieval from the model. We demonstrate that these methods are able to generate plausible and biologically valid summary GO term lists for an input gene set. However, LLM-based approaches are unable to deliver reliable scores or p-values and often return terms that are not statistically significant. Crucially, in our experiments these methods were rarely able to recapitulate the most precise and informative term from standard enrichment analysis. We also observe minor differences depending on prompt input information, with GO term descriptions leading to higher recall but lower precision. However, newer LLM models perform statistically significantly better than the oldest model across all performance metrics, suggesting that future models may lead to further improvements. Overall, the results are nondeterministic, with minor variations in prompt resulting in radically different term lists, true to the stochastic nature of LLMs. Our results show that at this point, LLM-based methods are unsuitable as a replacement for standard term enrichment analysis, however they may provide summarization benefits for implicit knowledge integration across extant but unstandardized knowledge, for large sets of features, and where the amount of information is difficult for humans to process.

分子生物学家经常解读来自高通量实验和计算分析的基因列表。这通常是作为一种统计富集分析来完成的,该分析基于来自知识库(KB)(如基因本体论(GO))的精心策划的断言,测量与基因或其特性相关的生物功能术语的过度或不足表示。解释基因列表也可以被定义为一项文本摘要任务,从而能够使用大型语言模型(LLM),有可能直接利用科学文本,避免对知识库的依赖。我们开发了SPINDOCTOR(用于本体报告的受控术语的自然语言描述的结构化提示插值),这是一种使用GPT模型执行基因集功能摘要的方法,作为标准富集分析的补充。该方法可以使用不同的基因功能信息来源:(1)从精心策划的本体论知识库注释中导出的结构化文本,(2)无本体论的叙述性基因摘要,或(3)直接模型检索。我们证明,这些方法能够为基因集生成合理且生物学有效的GO术语汇总表。然而,基于GPT的方法无法提供可靠的分数或p值,并且经常返回不具有统计意义的术语。至关重要的是,这些方法很少能够从标准丰富中概括出最精确、信息最丰富的术语,这可能是由于无法使用本体进行概括和推理。结果是高度不确定性的,提示中的微小变化导致了完全不同的术语列表。我们的结果表明,在这一点上,基于LLM的方法不适合作为标准术语丰富分析的替代品,本体论断言的手动管理仍然是必要的。
{"title":"Gene Set Summarization Using Large Language Models.","authors":"Marcin P Joachimiak, J Harry Caufield, Nomi L Harris, Hyeongsik Kim, Christopher J Mungall","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Molecular biologists frequently interpret gene lists derived from high-throughput experiments and computational analysis. This is typically done as a statistical enrichment analysis that measures the over- or under-representation of biological function terms associated with genes or their properties, based on curated assertions from a knowledge base (KB) such as the Gene Ontology (GO). Interpreting gene lists can also be framed as a textual summarization task, enabling Large Language Models (LLMs) to use scientific texts directly and avoid reliance on a KB. TALISMAN (Terminological ArtificiaL Intelligence SuMmarization of Annotation and Narratives) uses generative AI to perform gene set function summarization as a complement to standard enrichment analysis. This method can use different sources of gene functional information: (1) structured text derived from curated ontological KB annotations, (2) ontology-free narrative gene summaries, or (3) direct retrieval from the model. We demonstrate that these methods are able to generate plausible and biologically valid summary GO term lists for an input gene set. However, LLM-based approaches are unable to deliver reliable scores or p-values and often return terms that are not statistically significant. Crucially, in our experiments these methods were rarely able to recapitulate the most precise and informative term from standard enrichment analysis. We also observe minor differences depending on prompt input information, with GO term descriptions leading to higher recall but lower precision. However, newer LLM models perform statistically significantly better than the oldest model across all performance metrics, suggesting that future models may lead to further improvements. Overall, the results are nondeterministic, with minor variations in prompt resulting in radically different term lists, true to the stochastic nature of LLMs. Our results show that at this point, LLM-based methods are unsuitable as a replacement for standard term enrichment analysis, however they may provide summarization benefits for implicit knowledge integration across extant but unstandardized knowledge, for large sets of features, and where the amount of information is difficult for humans to process.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10246080/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9622249","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
Joint regional uptake quantification of Thorium-227 and Radium-223 using a multiple-energy-window projection-domain quantitative SPECT method. 使用多能量窗投影域定量 SPECT 方法联合量化钍-227 和镭-223 的区域摄取量。
Pub Date : 2024-07-01
Zekun Li, Nadia Benabdallah, Richard Laforest, Richard L Wahl, Daniel L J Thorek, Abhinav K Jha

Thorium-227-based alpha-particle radiopharmaceutical therapies ({alpha}-RPTs) are being investigated in several clinical and pre-clinical studies. After administration, Thorium-227 decays to Radium-223, another alpha-particle-emitting isotope, which redistributes within the patient. Reliable dose quantification of both Thorium-227 and Radium-223 is clinically important, and SPECT may perform this quantification as these isotopes also emit X- and gamma-ray photons. However, reliable quantification is challenged by the orders-of-magnitude lower activity compared to conventional SPECT, resulting in a very low number of detected counts, the presence of multiple photopeaks, substantial overlap in the emission spectra of these isotopes, and the image-degrading effects in SPECT. To address these issues, we propose a multiple-energy-window projection-domain quantification (MEW-PDQ) method that jointly estimates the regional activity uptake of both Thorium-227 and Radium-223 directly using the SPECT projection from multiple energy windows. We evaluated the method with realistic simulation studies using anthropomorphic digital phantoms, in the context of imaging patients with bone metastases of prostate cancer and treated with Thorium-227-based {alpha}-RPTs. The proposed method yielded reliable (accurate and precise) regional uptake estimates of both isotopes and outperformed state-of-the-art methods across different lesion sizes and contrasts, in a virtual imaging trial, as well as with moderate levels of intra-regional heterogeneous uptake and with moderate inaccuracies in the definitions of the support of various regions. Additionally, we demonstrated the effectiveness of using multiple energy windows and the variance of the estimated uptake using the proposed method approached the Cram'er-Rao-lower-bound-defined theoretical limit.

一些临床和临床前研究正在对基于钍-227的α粒子放射性药物疗法({alpha}-RPTs)进行研究。给药后,钍-227 会衰变为镭-223(另一种发射阿尔法粒子的同位素),并在患者体内重新分布。钍-227 和镭-223 的可靠剂量定量在临床上非常重要,SPECT 可以进行这种定量,因为这些同位素也发射 X 射线和伽马射线光子。然而,与传统的 SPECT 相比,这些同位素的放射性活度低了几个数量级,导致检测到的计数数量非常低、存在多个光峰、发射光谱大量重叠以及 SPECT 中的图像衰减效应,这些都给可靠的定量带来了挑战。为了解决这些问题,我们提出了一种多能量窗投影域量化(MEW-PDQ)方法,该方法直接利用多个能量窗的 SPECT 投影来联合估算钍-227 和镭-223 的区域活性吸收。我们利用拟人数字模型进行了真实的模拟研究,在对前列腺癌骨转移患者进行钍-227基{alpha}-RPTs成像时对该方法进行了评估。在虚拟成像试验中,在不同病灶大小和对比度的情况下,以及在中度区域内异质摄取和中度区域支持定义不准确的情况下,所提出的方法对两种同位素的区域摄取量都做出了可靠(准确和精确)的估计,并优于最先进的方法。此外,我们还证明了使用多个能量窗口的有效性,而且使用所提方法估计的摄取量方差接近 Cram'er-Rao-lower-bound 定义的理论极限。
{"title":"Joint regional uptake quantification of Thorium-227 and Radium-223 using a multiple-energy-window projection-domain quantitative SPECT method.","authors":"Zekun Li, Nadia Benabdallah, Richard Laforest, Richard L Wahl, Daniel L J Thorek, Abhinav K Jha","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Thorium-227-based alpha-particle radiopharmaceutical therapies ({alpha}-RPTs) are being investigated in several clinical and pre-clinical studies. After administration, Thorium-227 decays to Radium-223, another alpha-particle-emitting isotope, which redistributes within the patient. Reliable dose quantification of both Thorium-227 and Radium-223 is clinically important, and SPECT may perform this quantification as these isotopes also emit X- and gamma-ray photons. However, reliable quantification is challenged by the orders-of-magnitude lower activity compared to conventional SPECT, resulting in a very low number of detected counts, the presence of multiple photopeaks, substantial overlap in the emission spectra of these isotopes, and the image-degrading effects in SPECT. To address these issues, we propose a multiple-energy-window projection-domain quantification (MEW-PDQ) method that jointly estimates the regional activity uptake of both Thorium-227 and Radium-223 directly using the SPECT projection from multiple energy windows. We evaluated the method with realistic simulation studies using anthropomorphic digital phantoms, in the context of imaging patients with bone metastases of prostate cancer and treated with Thorium-227-based {alpha}-RPTs. The proposed method yielded reliable (accurate and precise) regional uptake estimates of both isotopes and outperformed state-of-the-art methods across different lesion sizes and contrasts, in a virtual imaging trial, as well as with moderate levels of intra-regional heterogeneous uptake and with moderate inaccuracies in the definitions of the support of various regions. Additionally, we demonstrated the effectiveness of using multiple energy windows and the variance of the estimated uptake using the proposed method approached the Cram'er-Rao-lower-bound-defined theoretical limit.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10246079/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9608651","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
Gene activity fully predicts transcriptional bursting dynamics. 常见的爆发关系是真核生物转录动力学的基础。
Pub Date : 2024-06-28
Po-Ta Chen, Michal Levo, Benjamin Zoller, Thomas Gregor

Transcription commonly occurs in bursts, with alternating productive (ON) and quiescent (OFF) periods, governing mRNA production rates. Yet, how transcription is regulated through bursting dynamics remains unresolved. Here, we conduct real-time measurements of endogenous transcriptional bursting with single-mRNA sensitivity. Leveraging the diverse transcriptional activities in early fly embryos, we uncover stringent relationships between bursting parameters. Specifically, we find that the durations of ON and OFF periods are linked. Regardless of the developmental stage or body-axis position, gene activity levels predict individual alleles' average ON and OFF periods. Lowly transcribing alleles predominantly modulate OFF periods (burst frequency), while highly transcribing alleles primarily tune ON periods (burst size). These relationships persist even under perturbations of cis-regulatory elements or trans-factors and account for bursting dynamics measured in other species. Our results suggest a novel mechanistic constraint governing bursting dynamics rather than a modular control of distinct parameters by distinct regulatory processes.

转录通常发生在由交替的生产期(ON)和静止期(OFF)引起的爆发中。然而,如何调节转录爆发来确定时空转录活性仍不清楚。在这里,我们对苍蝇胚胎中的关键发育基因进行了实时转录成像,具有单一聚合酶敏感性。单等位基因转录率和多聚合酶爆发的量化揭示了所有基因之间在时间和空间上的共同爆发关系,以及顺式和反式扰动。我们确定等位基因的ON概率是转录速率的主要决定因素,而转录起始速率的变化是有限的。任何给定的开启概率都决定了平均开启和关闭时间的特定组合,从而保持恒定的特征爆破时间尺度。我们的研究结果表明,主要影响开启概率的各种调节过程的趋同,从而控制mRNA的产生,而不是开启和关闭时间的机制特异性调节。因此,我们的研究结果激励并指导了对实现这些爆发规则和调控转录调控机制的新研究。
{"title":"Gene activity fully predicts transcriptional bursting dynamics.","authors":"Po-Ta Chen, Michal Levo, Benjamin Zoller, Thomas Gregor","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Transcription commonly occurs in bursts, with alternating productive (ON) and quiescent (OFF) periods, governing mRNA production rates. Yet, how transcription is regulated through bursting dynamics remains unresolved. Here, we conduct real-time measurements of endogenous transcriptional bursting with single-mRNA sensitivity. Leveraging the diverse transcriptional activities in early fly embryos, we uncover stringent relationships between bursting parameters. Specifically, we find that the durations of ON and OFF periods are linked. Regardless of the developmental stage or body-axis position, gene activity levels predict individual alleles' average ON and OFF periods. Lowly transcribing alleles predominantly modulate OFF periods (burst frequency), while highly transcribing alleles primarily tune ON periods (burst size). These relationships persist even under perturbations of cis-regulatory elements or trans-factors and account for bursting dynamics measured in other species. Our results suggest a novel mechanistic constraint governing bursting dynamics rather than a modular control of distinct parameters by distinct regulatory processes.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10153294/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9807592","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
The Multiscale Surface Vision Transformer. 多尺度表面视觉转换器。
Pub Date : 2024-06-11
Simon Dahan, Logan Z J Williams, Daniel Rueckert, Emma C Robinson

Surface meshes are a favoured domain for representing structural and functional information on the human cortex, but their complex topology and geometry pose significant challenges for deep learning analysis. While Transformers have excelled as domainagnostic architectures for sequence-to-sequence learning, the quadratic cost of the self-attention operation remains an obstacle for many dense prediction tasks. Inspired by some of the latest advances in hierarchical modelling with vision transformers, we introduce the Multiscale Surface Vision Transformer (MS-SiT) as a backbone architecture for surface deep learning. The self-attention mechanism is applied within local-mesh-windows to allow for high-resolution sampling of the underlying data, while a shifted-window strategy improves the sharing of information between windows. Neighbouring patches are successively merged, allowing the MS-SiT to learn hierarchical representations suitable for any prediction task. Results demonstrate that the MS-SiT outperforms existing surface deep learning methods for neonatal phenotyping prediction tasks using the Developing Human Connectome Project (dHCP) dataset. Furthermore, building the MS-SiT backbone into a U-shaped architecture for surface segmentation demonstrates competitive results on cortical parcellation using the UK Biobank (UKB) and manually-annotated MindBoggle datasets. Code and trained models are publicly available at https://github.com/metrics-lab/surface-vision-transformers.

表面网格是表示人类皮层结构和功能信息的一个受欢迎的领域,但其复杂的拓扑结构和几何结构对深度学习分析提出了重大挑战。虽然Transformers在序列到序列学习的领域不可知架构方面表现出色,尤其是在卷积运算的转换不是平凡的结构中,但自注意运算的二次代价仍然是许多密集预测任务的障碍。受视觉转换器分层建模的一些最新进展的启发,我们引入了多尺度表面视觉转换器(MS-SiT)作为表面深度学习的主干架构。自注意机制应用于局部网格窗口中,以允许对底层数据进行高分辨率采样,而移位窗口策略则改善了窗口之间的信息共享。相邻的补丁被连续地合并,从而允许MS-SiT学习适用于任何预测任务的分层表示。结果表明,在使用开发人类连接体项目(dHCP)数据集进行新生儿表型预测任务方面,MS-SiT优于现有的表面深度学习方法。此外,使用英国生物库(UKB)和手动注释的MindBoggle数据集,将MS-SiT主干构建成用于表面分割的U形架构,证明了皮层分割的竞争结果。代码和经过训练的模型可在https://github.com/metrics-lab/surface-vision-transformers.
{"title":"The Multiscale Surface Vision Transformer.","authors":"Simon Dahan, Logan Z J Williams, Daniel Rueckert, Emma C Robinson","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Surface meshes are a favoured domain for representing structural and functional information on the human cortex, but their complex topology and geometry pose significant challenges for deep learning analysis. While Transformers have excelled as domainagnostic architectures for sequence-to-sequence learning, the quadratic cost of the self-attention operation remains an obstacle for many dense prediction tasks. Inspired by some of the latest advances in hierarchical modelling with vision transformers, we introduce the Multiscale Surface Vision Transformer (MS-SiT) as a backbone architecture for surface deep learning. The self-attention mechanism is applied within local-mesh-windows to allow for high-resolution sampling of the underlying data, while a shifted-window strategy improves the sharing of information between windows. Neighbouring patches are successively merged, allowing the MS-SiT to learn hierarchical representations suitable for any prediction task. Results demonstrate that the MS-SiT outperforms existing surface deep learning methods for neonatal phenotyping prediction tasks using the Developing Human Connectome Project (dHCP) dataset. Furthermore, building the MS-SiT backbone into a U-shaped architecture for surface segmentation demonstrates competitive results on cortical parcellation using the UK Biobank (UKB) and manually-annotated MindBoggle datasets. Code and trained models are publicly available at https://github.com/metrics-lab/surface-vision-transformers.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10055498/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9239375","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
Geometry-Complete Diffusion for 3D Molecule Generation and Optimization. 用于三维分子生成和优化的几何完全扩散。
Pub Date : 2024-05-24
Alex Morehead, Jianlin Cheng

Motivation: Generative deep learning methods have recently been proposed for generating 3D molecules using equivariant graph neural networks (GNNs) within a denoising diffusion framework. However, such methods are unable to learn important geometric properties of 3D molecules, as they adopt molecule-agnostic and non-geometric GNNs as their 3D graph denoising networks, which notably hinders their ability to generate valid large 3D molecules.

Results: In this work, we address these gaps by introducing the Geometry-Complete Diffusion Model (GCDM) for 3D molecule generation, which outperforms existing 3D molecular diffusion models by significant margins across conditional and unconditional settings for the QM9 dataset and the larger GEOM-Drugs dataset, respectively. Importantly, we demonstrate that GCDM's generative denoising process enables the model to generate a significant proportion of valid and energetically-stable large molecules at the scale of GEOM-Drugs, whereas previous methods fail to do so with the features they learn. Additionally, we show that extensions of GCDM can not only effectively design 3D molecules for specific protein pockets but can be repurposed to consistently optimize the geometry and chemical composition of existing 3D molecules for molecular stability and property specificity, demonstrating new versatility of molecular diffusion models.

Availability: Code and data are freely available on GitHub.

去噪扩散概率模型(DDPM)最近在生成建模领域掀起了风暴,在计算机视觉和计算生物学等学科中开创了从文本引导的图像生成到结构引导的蛋白质设计等各种任务的最新成果。沿着后一条研究路线,最近提出了在DDPM框架内使用等变图神经网络(GNN)生成3D分子的方法。然而,这种方法无法在分子图生成过程中学习3D分子的重要几何和物理特性,因为它们采用分子不可知和非几何GNN作为其3D图去噪网络,这对它们有效扩展到大型3D分子数据集的能力产生了负面影响。在这项工作中,我们通过引入用于3D分子生成的几何完全扩散模型(GCDM)来解决这些差距,该模型在QM9数据集以及更大的GEOM Drugs数据集的条件和无条件设置方面显著优于现有的3D分子扩散模型。重要的是,我们证明了GCDM学习的用于3D分子生成的几何完整去噪过程允许模型以GEOM Drugs的规模生成真实稳定的大分子,而以前的方法在学习的特征上无法做到这一点。此外,我们还表明,GCDM的几何特征可以有效地重新调整用途,直接优化现有3D分子的几何结构和化学组成,以获得特定的分子特性,从而展示了分子扩散模型在现实世界中的新的多功能性。我们的源代码、数据和再现性说明可在https://github.com/BioinfoMachineLearning/bio-diffusion.
{"title":"Geometry-Complete Diffusion for 3D Molecule Generation and Optimization.","authors":"Alex Morehead, Jianlin Cheng","doi":"","DOIUrl":"","url":null,"abstract":"<p><strong>Motivation: </strong>Generative deep learning methods have recently been proposed for generating 3D molecules using equivariant graph neural networks (GNNs) within a denoising diffusion framework. However, such methods are unable to learn important geometric properties of 3D molecules, as they adopt molecule-agnostic and non-geometric GNNs as their 3D graph denoising networks, which notably hinders their ability to generate valid large 3D molecules.</p><p><strong>Results: </strong>In this work, we address these gaps by introducing the Geometry-Complete Diffusion Model (GCDM) for 3D molecule generation, which outperforms existing 3D molecular diffusion models by significant margins across conditional and unconditional settings for the QM9 dataset and the larger GEOM-Drugs dataset, respectively. Importantly, we demonstrate that GCDM's generative denoising process enables the model to generate a significant proportion of valid and energetically-stable large molecules at the scale of GEOM-Drugs, whereas previous methods fail to do so with the features they learn. Additionally, we show that extensions of GCDM can not only effectively design 3D molecules for specific protein pockets but can be repurposed to consistently optimize the geometry and chemical composition of existing 3D molecules for molecular stability and property specificity, demonstrating new versatility of molecular diffusion models.</p><p><strong>Availability: </strong>Code and data are freely available on GitHub.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9934735/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9740776","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
The Brain Tumor Segmentation (BraTS) Challenge 2023: Focus on Pediatrics (CBTN-CONNECT-DIPGR-ASNR-MICCAI BraTS-PEDs). 2023年脑肿瘤分割(BraTS)挑战:专注儿科(CBTN-CONNECT-DIPGR-ASNR-MICAI BraTS PEDs)。
Pub Date : 2024-05-23
Anahita Fathi Kazerooni, Nastaran Khalili, Xinyang Liu, Debanjan Haldar, Zhifan Jiang, Syed Muhammed Anwar, Jake Albrecht, Maruf Adewole, Udunna Anazodo, Hannah Anderson, Sina Bagheri, Ujjwal Baid, Timothy Bergquist, Austin J Borja, Evan Calabrese, Verena Chung, Gian-Marco Conte, Farouk Dako, James Eddy, Ivan Ezhov, Ariana Familiar, Keyvan Farahani, Shuvanjan Haldar, Juan Eugenio Iglesias, Anastasia Janas, Elaine Johansen, Blaise V Jones, Florian Kofler, Dominic LaBella, Hollie Anne Lai, Koen Van Leemput, Hongwei Bran Li, Nazanin Maleki, Aaron S McAllister, Zeke Meier, Bjoern Menze, Ahmed W Moawad, Khanak K Nandolia, Julija Pavaine, Marie Piraud, Tina Poussaint, Sanjay P Prabhu, Zachary Reitman, Andres Rodriguez, Jeffrey D Rudie, Ibraheem Salman Shaikh, Lubdha M Shah, Nakul Sheth, Russel Taki Shinohara, Wenxin Tu, Karthik Viswanathan, Chunhao Wang, Jeffrey B Ware, Benedikt Wiestler, Walter Wiggins, Anna Zapaishchykova, Mariam Aboian, Miriam Bornhorst, Peter de Blank, Michelle Deutsch, Maryam Fouladi, Lindsey Hoffman, Benjamin Kann, Margot Lazow, Leonie Mikael, Ali Nabavizadeh, Roger Packer, Adam Resnick, Brian Rood, Arastoo Vossough, Spyridon Bakas, Marius George Linguraru

Pediatric tumors of the central nervous system are the most common cause of cancer-related death in children. The five-year survival rate for high-grade gliomas in children is less than 20%. Due to their rarity, the diagnosis of these entities is often delayed, their treatment is mainly based on historic treatment concepts, and clinical trials require multi-institutional collaborations. The MICCAI Brain Tumor Segmentation (BraTS) Challenge is a landmark community benchmark event with a successful history of 12 years of resource creation for the segmentation and analysis of adult glioma. Here we present the CBTN-CONNECT-DIPGR-ASNR-MICCAI BraTS-PEDs 2023 challenge, which represents the first BraTS challenge focused on pediatric brain tumors with data acquired across multiple international consortia dedicated to pediatric neuro-oncology and clinical trials. The BraTS-PEDs 2023 challenge focuses on benchmarking the development of volumentric segmentation algorithms for pediatric brain glioma through standardized quantitative performance evaluation metrics utilized across the BraTS 2023 cluster of challenges. Models gaining knowledge from the BraTS-PEDs multi-parametric structural MRI (mpMRI) training data will be evaluated on separate validation and unseen test mpMRI dataof high-grade pediatric glioma. The CBTN-CONNECT-DIPGR-ASNR-MICCAI BraTS-PEDs 2023 challenge brings together clinicians and AI/imaging scientists to lead to faster development of automated segmentation techniques that could benefit clinical trials, and ultimately the care of children with brain tumors.

儿童中枢神经系统肿瘤是导致儿童癌症相关死亡的最常见原因。儿童高级别胶质瘤的五年生存率不到20%。由于其罕见性,这些实体的诊断往往被推迟,它们的治疗主要基于历史治疗理念,临床试验需要多机构合作。MICCAI脑肿瘤分割(BraTS)挑战赛是一项具有里程碑意义的社区基准活动,在成人神经胶质瘤的分割和分析方面有着12年的成功资源创建历史。在这里,我们提出了CBTN-CONNECT-DIPGR-ASNR-MICAI BraTS PEDs 2023挑战,这是第一个专注于儿童脑肿瘤的BraTS挑战,数据是通过多个致力于儿童神经肿瘤学和临床试验的国际联盟获得的。BraTS PEDs 2023挑战集中于通过在BraTS 2023挑战集群中使用的标准化定量性能评估指标,对儿童脑胶质瘤的体积中心分割算法的开发进行基准测试。从BraTS PEDs多参数结构MRI(mpMRI)训练数据中获得知识的模型将在高级儿童神经胶质瘤的单独验证和未公开测试mpMRI数据上进行评估。CBTN-CONNECT-DIPGR-ASNR-MICAI BraTS PEDs 2023挑战将临床医生和人工智能/成像科学家聚集在一起,更快地开发自动化分割技术,这可能有利于临床试验,并最终有利于脑肿瘤儿童的护理。
{"title":"The Brain Tumor Segmentation (BraTS) Challenge 2023: <i>Focus on Pediatrics (CBTN-CONNECT-DIPGR-ASNR-MICCAI BraTS-PEDs)</i>.","authors":"Anahita Fathi Kazerooni, Nastaran Khalili, Xinyang Liu, Debanjan Haldar, Zhifan Jiang, Syed Muhammed Anwar, Jake Albrecht, Maruf Adewole, Udunna Anazodo, Hannah Anderson, Sina Bagheri, Ujjwal Baid, Timothy Bergquist, Austin J Borja, Evan Calabrese, Verena Chung, Gian-Marco Conte, Farouk Dako, James Eddy, Ivan Ezhov, Ariana Familiar, Keyvan Farahani, Shuvanjan Haldar, Juan Eugenio Iglesias, Anastasia Janas, Elaine Johansen, Blaise V Jones, Florian Kofler, Dominic LaBella, Hollie Anne Lai, Koen Van Leemput, Hongwei Bran Li, Nazanin Maleki, Aaron S McAllister, Zeke Meier, Bjoern Menze, Ahmed W Moawad, Khanak K Nandolia, Julija Pavaine, Marie Piraud, Tina Poussaint, Sanjay P Prabhu, Zachary Reitman, Andres Rodriguez, Jeffrey D Rudie, Ibraheem Salman Shaikh, Lubdha M Shah, Nakul Sheth, Russel Taki Shinohara, Wenxin Tu, Karthik Viswanathan, Chunhao Wang, Jeffrey B Ware, Benedikt Wiestler, Walter Wiggins, Anna Zapaishchykova, Mariam Aboian, Miriam Bornhorst, Peter de Blank, Michelle Deutsch, Maryam Fouladi, Lindsey Hoffman, Benjamin Kann, Margot Lazow, Leonie Mikael, Ali Nabavizadeh, Roger Packer, Adam Resnick, Brian Rood, Arastoo Vossough, Spyridon Bakas, Marius George Linguraru","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Pediatric tumors of the central nervous system are the most common cause of cancer-related death in children. The five-year survival rate for high-grade gliomas in children is less than 20%. Due to their rarity, the diagnosis of these entities is often delayed, their treatment is mainly based on historic treatment concepts, and clinical trials require multi-institutional collaborations. The MICCAI Brain Tumor Segmentation (BraTS) Challenge is a landmark community benchmark event with a successful history of 12 years of resource creation for the segmentation and analysis of adult glioma. Here we present the CBTN-CONNECT-DIPGR-ASNR-MICCAI BraTS-PEDs 2023 challenge, which represents the first BraTS challenge focused on pediatric brain tumors with data acquired across multiple international consortia dedicated to pediatric neuro-oncology and clinical trials. The BraTS-PEDs 2023 challenge focuses on benchmarking the development of volumentric segmentation algorithms for pediatric brain glioma through standardized quantitative performance evaluation metrics utilized across the BraTS 2023 cluster of challenges. Models gaining knowledge from the BraTS-PEDs multi-parametric structural MRI (mpMRI) training data will be evaluated on separate validation and unseen test mpMRI dataof high-grade pediatric glioma. The CBTN-CONNECT-DIPGR-ASNR-MICCAI BraTS-PEDs 2023 challenge brings together clinicians and AI/imaging scientists to lead to faster development of automated segmentation techniques that could benefit clinical trials, and ultimately the care of children with brain tumors.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10246083/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9959581","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
Fibration symmetries and cluster synchronization in the Caenorhabditis elegans connectome. 秀丽隐杆线虫连接体中的纤维对称性和簇同步性。
Pub Date : 2024-05-03
Bryant Avila, Pedro Augusto, Manuel Zimmer, Matteo Serafino, Hernán A Makse

Capturing how the Caenorhabditis elegans connectome structure gives rise to its neuron functionality remains unclear. It is through fiber symmetries found in its neuronal connectivity that synchronization of a group of neurons can be determined. To understand these we investigate graph symmetries and search for such in the symmetrized versions of the forward and backward locomotive sub-networks of the Caenorhabditi elegans worm neuron network. The use of ordinarily differential equations simulations admissible to these graphs are used to validate the predictions of these fiber symmetries and are compared to the more restrictive orbit symmetries. Additionally fibration symmetries are used to decompose these graphs into their fundamental building blocks which reveal units formed by nested loops or multilayered fibers. It is found that fiber symmetries of the connectome can accurately predict neuronal synchronization even under not idealized connectivity as long as the dynamics are within stable regimes of simulations.

目前尚不清楚秀丽隐杆线虫连接体结构是如何产生其神经元功能的。正是通过在神经元连接中发现的纤维对称性,才能确定一组神经元的同步性。为了理解这些,我们研究了图的对称性,并在秀丽隐杆线虫蠕虫神经元网络的前向和后向机车子网络的对称化版本中寻找这种对称性。使用可用于这些图的常微分方程模拟来验证这些纤维对称性的预测,并与更严格的轨道对称性进行比较。此外,纤维对称性被用来将这些图分解为它们的基本构建块,这些构建块揭示了由嵌套环或多层纤维形成的单元。研究发现,即使在非理想连接的情况下,只要动力学处于稳定的模拟范围内,连接体的纤维对称性也可以准确预测神经元同步。
{"title":"Fibration symmetries and cluster synchronization in the <i>Caenorhabditis elegans</i> connectome.","authors":"Bryant Avila, Pedro Augusto, Manuel Zimmer, Matteo Serafino, Hernán A Makse","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Capturing how the <i>Caenorhabditis elegans</i> connectome structure gives rise to its neuron functionality remains unclear. It is through fiber symmetries found in its neuronal connectivity that synchronization of a group of neurons can be determined. To understand these we investigate graph symmetries and search for such in the symmetrized versions of the forward and backward locomotive sub-networks of the <i>Caenorhabditi elegans</i> worm neuron network. The use of ordinarily differential equations simulations admissible to these graphs are used to validate the predictions of these fiber symmetries and are compared to the more restrictive orbit symmetries. Additionally fibration symmetries are used to decompose these graphs into their fundamental building blocks which reveal units formed by nested loops or multilayered fibers. It is found that fiber symmetries of the connectome can accurately predict neuronal synchronization even under not idealized connectivity as long as the dynamics are within stable regimes of simulations.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10312817/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10117030","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
Leak Proof PDBBind: A Reorganized Dataset of Protein-Ligand Complexes for More Generalizable Binding Affinity Prediction. 防漏PDBBind:蛋白质配体复合物的重组数据集,用于更通用的结合亲和力预测。
Pub Date : 2024-05-03
Jie Li, Xingyi Guan, Oufan Zhang, Kunyang Sun, Yingze Wang, Dorian Bagni, Teresa Head-Gordon

Many physics-based and machine-learned scoring functions (SFs) used to predict protein-ligand binding free energies have been trained on the PDBBind dataset. However, it is controversial as to whether new SFs are actually improving since the general, refined, and core datasets of PDBBind are cross-contaminated with proteins and ligands with high similarity, and hence they may not perform comparably well in binding prediction of new protein-ligand complexes. In this work we have carefully prepared a cleaned PDBBind data set of non-covalent binders that are split into training, validation, and test datasets to control for data leakage, defined as proteins and ligands with high sequence and structural similarity. The resulting leak-proof (LP)-PDBBind data is used to retrain four popular SFs: AutoDock Vina, Random Forest (RF)-Score, InteractionGraphNet (IGN), and DeepDTA, to better test their capabilities when applied to new protein-ligand complexes. In particular we have formulated a new independent data set, BDB2020+, by matching high quality binding free energies from BindingDB with co-crystalized ligand-protein complexes from the PDB that have been deposited since 2020. Based on all the benchmark results, the retrained models using LP-PDBBind consistently perform better, with IGN especially being recommended for scoring and ranking applications for new protein-ligand systems.

已经在PDBBind数据集上训练了许多用于预测蛋白质配体结合自由能的基于物理和机器学习的评分函数(SF)。然而,对于新的SF是否真的在改善,这是有争议的,因为PDBBind的通用、精炼和核心数据集被具有高度相似性的蛋白质和配体交叉污染,因此它们在新的蛋白质-配体复合物的结合预测中可能表现得不太好。在这项工作中,我们仔细准备了一个非共价结合物的清洁PDBBind数据集,该数据集被划分为训练、验证和测试数据集,以控制数据泄露。由此产生的防漏(LP)-PDBBind数据用于重新训练四种流行的SF:AutoDock vina、Random Forest(RF)-Score、InteractionGraphNet(IGN)和DeepDTA,以更好地测试它们在应用于新的蛋白质-配体复合物时的能力。特别是,我们通过将BindingDB的高质量结合自由能与自2020年以来沉积的PDB的共结晶配体-蛋白质复合物相匹配,制定了一个新的独立数据集BDB2020+。基于所有的基准结果,使用依赖3D信息的LP PDBBind的再训练模型始终处于最佳状态,IGN尤其被推荐用于新蛋白质配体系统的评分和排名应用。
{"title":"Leak Proof PDBBind: A Reorganized Dataset of Protein-Ligand Complexes for More Generalizable Binding Affinity Prediction.","authors":"Jie Li, Xingyi Guan, Oufan Zhang, Kunyang Sun, Yingze Wang, Dorian Bagni, Teresa Head-Gordon","doi":"","DOIUrl":"","url":null,"abstract":"<p><p>Many physics-based and machine-learned scoring functions (SFs) used to predict protein-ligand binding free energies have been trained on the PDBBind dataset. However, it is controversial as to whether new SFs are actually improving since the general, refined, and core datasets of PDBBind are cross-contaminated with proteins and ligands with high similarity, and hence they may not perform comparably well in binding prediction of new protein-ligand complexes. In this work we have carefully prepared a cleaned PDBBind data set of non-covalent binders that are split into training, validation, and test datasets to control for data leakage, defined as proteins and ligands with high sequence and structural similarity. The resulting leak-proof (LP)-PDBBind data is used to retrain four popular SFs: AutoDock Vina, Random Forest (RF)-Score, InteractionGraphNet (IGN), and DeepDTA, to better test their capabilities when applied to new protein-ligand complexes. In particular we have formulated a new independent data set, BDB2020+, by matching high quality binding free energies from BindingDB with co-crystalized ligand-protein complexes from the PDB that have been deposited since 2020. Based on all the benchmark results, the retrained models using LP-PDBBind consistently perform better, with IGN especially being recommended for scoring and ranking applications for new protein-ligand systems.</p>","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10462179/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10134134","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
CarcassFormer: An End-to-end Transformer-based Framework for Simultaneous Localization, Segmentation and Classification of Poultry Carcass Defect CarcassFormer:基于端到端变压器的家禽胴体缺陷同时定位、分割和分类框架
Pub Date : 2024-05-01 DOI: 10.48550/arXiv.2404.11429
Minh Q. Tran, Sang Truong, Arthur F. A. Fernandes, Michael Kidd, Ngan Le
{"title":"CarcassFormer: An End-to-end Transformer-based Framework for Simultaneous Localization, Segmentation and Classification of Poultry Carcass Defect","authors":"Minh Q. Tran, Sang Truong, Arthur F. A. Fernandes, Michael Kidd, Ngan Le","doi":"10.48550/arXiv.2404.11429","DOIUrl":"https://doi.org/10.48550/arXiv.2404.11429","url":null,"abstract":"","PeriodicalId":8425,"journal":{"name":"ArXiv","volume":"302 9","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141144492","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}
引用次数: 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