首页 > 最新文献

Interdisciplinary Sciences: Computational Life Sciences最新文献

英文 中文
Deep Clustering-Based Metabolic Stratification of Non-Small Cell Lung Cancer Patients Through Integration of Somatic Mutation Profile and Network Propagation Algorithm. 基于体细胞突变谱和网络传播算法的非小细胞肺癌患者深度聚类代谢分层
IF 3.9 2区 生物学 Q1 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-12-01 Epub Date: 2025-03-18 DOI: 10.1007/s12539-025-00699-2
Xu Luo, Xinpeng Zhang, Dongqing Su, Honghao Li, Min Zou, Yuqiang Xiong, Lei Yang

As a common malignancy of the lower respiratory tract, non-small cell lung cancer (NSCLC) represents a major oncological challenge globally, characterized by high incidence and mortality rates. Recent research highlights the critical involvement of somatic mutations in the onset and development of NSCLC. Stratification of NSCLC patients based on somatic mutation data could facilitate the identification of patients likely to respond to personalized therapeutic strategies. However, stratification of NSCLC patients using somatic mutation data is challenging due to the sparseness of this data. In this study, based on sparse somatic mutation data from 4581 NSCLC patients from the Memorial Sloan Kettering Cancer Center (MSKCC) database, we systematically evaluate the metabolic pathway activity in NSCLC patients through the application of network propagation algorithm and computational biology algorithms. Based on these metabolic pathways associated with prognosis, as recognized through univariate Cox regression analysis, NSCLC patients are stratified using the deep clustering algorithm to explore the optimal classification strategy, thereby establishing biologically meaningful metabolic subtypes of NSCLC patients. The precise NSCLC metabolic subtypes obtained from the network propagation algorithm and deep clustering algorithm are systematically evaluated and validated for survival benefits of immunotherapy. Our research marks progress towards developing a universal approach for classifying NSCLC patients based solely on somatic mutation profiles, employing deep clustering algorithm. The implementation of our research will help to deepen the analysis of NSCLC patients' metabolic subtypes from the perspective of tumor microenvironment, providing a strong basis for the formulation of more precise personalized treatment plans.

作为一种常见的下呼吸道恶性肿瘤,非小细胞肺癌(NSCLC)以其高发病率和高死亡率为特征,是全球肿瘤学的一大挑战。最近的研究强调了体细胞突变在非小细胞肺癌的发生和发展中的关键作用。基于体细胞突变数据的非小细胞肺癌患者分层可以促进识别可能对个性化治疗策略有反应的患者。然而,由于这些数据的稀疏性,使用体细胞突变数据对NSCLC患者进行分层是具有挑战性的。本研究基于美国Memorial Sloan Kettering Cancer Center (MSKCC)数据库中4581例NSCLC患者的稀疏体细胞突变数据,应用网络传播算法和计算生物学算法,系统评估NSCLC患者代谢通路活性。基于这些与预后相关的代谢途径,通过单变量Cox回归分析,采用深度聚类算法对NSCLC患者进行分层,探索最佳分类策略,从而建立具有生物学意义的NSCLC患者代谢亚型。通过网络传播算法和深度聚类算法获得的精确NSCLC代谢亚型被系统地评估和验证免疫治疗的生存效益。我们的研究标志着开发一种基于体细胞突变谱、采用深度聚类算法对非小细胞肺癌患者进行分类的通用方法的进展。本研究的实施将有助于从肿瘤微环境角度深化对NSCLC患者代谢亚型的分析,为制定更精准的个性化治疗方案提供有力依据。
{"title":"Deep Clustering-Based Metabolic Stratification of Non-Small Cell Lung Cancer Patients Through Integration of Somatic Mutation Profile and Network Propagation Algorithm.","authors":"Xu Luo, Xinpeng Zhang, Dongqing Su, Honghao Li, Min Zou, Yuqiang Xiong, Lei Yang","doi":"10.1007/s12539-025-00699-2","DOIUrl":"10.1007/s12539-025-00699-2","url":null,"abstract":"<p><p>As a common malignancy of the lower respiratory tract, non-small cell lung cancer (NSCLC) represents a major oncological challenge globally, characterized by high incidence and mortality rates. Recent research highlights the critical involvement of somatic mutations in the onset and development of NSCLC. Stratification of NSCLC patients based on somatic mutation data could facilitate the identification of patients likely to respond to personalized therapeutic strategies. However, stratification of NSCLC patients using somatic mutation data is challenging due to the sparseness of this data. In this study, based on sparse somatic mutation data from 4581 NSCLC patients from the Memorial Sloan Kettering Cancer Center (MSKCC) database, we systematically evaluate the metabolic pathway activity in NSCLC patients through the application of network propagation algorithm and computational biology algorithms. Based on these metabolic pathways associated with prognosis, as recognized through univariate Cox regression analysis, NSCLC patients are stratified using the deep clustering algorithm to explore the optimal classification strategy, thereby establishing biologically meaningful metabolic subtypes of NSCLC patients. The precise NSCLC metabolic subtypes obtained from the network propagation algorithm and deep clustering algorithm are systematically evaluated and validated for survival benefits of immunotherapy. Our research marks progress towards developing a universal approach for classifying NSCLC patients based solely on somatic mutation profiles, employing deep clustering algorithm. The implementation of our research will help to deepen the analysis of NSCLC patients' metabolic subtypes from the perspective of tumor microenvironment, providing a strong basis for the formulation of more precise personalized treatment plans.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"948-969"},"PeriodicalIF":3.9,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143657203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Identify Modules Associated with Immunotherapy Response from Mouse Tumor Profiles for Stratifying Cancer Patients. 从小鼠肿瘤谱中识别与免疫治疗反应相关的模块,用于分层癌症患者。
IF 3.9 2区 生物学 Q1 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-12-01 Epub Date: 2025-05-09 DOI: 10.1007/s12539-025-00719-1
Dechen Xu, Jie Li, Li Zhou, Jiahuan Jin

Immune checkpoint inhibitors (ICIs) have demonstrated significant clinical benefits in cancer treatment, but only a minority of patients exhibit favorable response, highlighting the importance of determining patients who will benefit from immunotherapy. Currently, patient datasets regarding immunotherapy response are scarce, while ample experiments can be performed on syngeneic mouse tumor models to generate valuable data. Therefore, how to effectively utilize mouse data to identify predictors of immunotherapy response and subsequently transfer relevant knowledge to predict human response to ICIs is a question worth studying. In this study, we propose a novel methodology to address this issue. Firstly, we identify gene modules associated with immunotherapy response from mouse tumor profiles based on cancer gene panels. Subsequently, these identified modules are employed to build prediction models for immunotherapy response based on mouse data. Furthermore, we transfer these models to predict ICIs responses of human cancer patients. Experimental results demonstrate that the gene modules identified from mouse data are reliable predictors of immunotherapy response. The mouse-based models built on these modules could be transferred to humans, effectively predicting drug responses and survival outcomes for cancer patients. Compared to conventional cancer biomarkers and existing prediction models based on mouse data, our method exhibits superior performance. These findings provide a valuable reference for further in-depth research on immunotherapy response prediction model based on mouse tumor profiles, with the potential for transfer applications in human cancer therapy.

免疫检查点抑制剂(ICIs)在癌症治疗中显示出显著的临床益处,但只有少数患者表现出良好的反应,这突出了确定哪些患者将从免疫治疗中受益的重要性。目前,关于免疫治疗反应的患者数据集很少,而在同基因小鼠肿瘤模型上进行大量的实验可以产生有价值的数据。因此,如何有效地利用小鼠数据识别免疫治疗反应的预测因子,并将相关知识转移到预测人类对ICIs的反应是一个值得研究的问题。在这项研究中,我们提出了一种新的方法来解决这个问题。首先,我们从基于癌症基因面板的小鼠肿瘤谱中识别出与免疫治疗反应相关的基因模块。随后,利用这些识别出的模块构建基于小鼠数据的免疫治疗反应预测模型。此外,我们将这些模型转移到预测人类癌症患者的ICIs反应。实验结果表明,从小鼠数据中鉴定的基因模块是免疫治疗反应的可靠预测因子。建立在这些模块上的小鼠模型可以转移到人类身上,有效地预测癌症患者的药物反应和生存结果。与传统的癌症生物标志物和现有的基于小鼠数据的预测模型相比,我们的方法表现出优越的性能。这些发现为进一步深入研究基于小鼠肿瘤特征的免疫治疗反应预测模型提供了有价值的参考,具有在人类癌症治疗中转移应用的潜力。
{"title":"Identify Modules Associated with Immunotherapy Response from Mouse Tumor Profiles for Stratifying Cancer Patients.","authors":"Dechen Xu, Jie Li, Li Zhou, Jiahuan Jin","doi":"10.1007/s12539-025-00719-1","DOIUrl":"10.1007/s12539-025-00719-1","url":null,"abstract":"<p><p>Immune checkpoint inhibitors (ICIs) have demonstrated significant clinical benefits in cancer treatment, but only a minority of patients exhibit favorable response, highlighting the importance of determining patients who will benefit from immunotherapy. Currently, patient datasets regarding immunotherapy response are scarce, while ample experiments can be performed on syngeneic mouse tumor models to generate valuable data. Therefore, how to effectively utilize mouse data to identify predictors of immunotherapy response and subsequently transfer relevant knowledge to predict human response to ICIs is a question worth studying. In this study, we propose a novel methodology to address this issue. Firstly, we identify gene modules associated with immunotherapy response from mouse tumor profiles based on cancer gene panels. Subsequently, these identified modules are employed to build prediction models for immunotherapy response based on mouse data. Furthermore, we transfer these models to predict ICIs responses of human cancer patients. Experimental results demonstrate that the gene modules identified from mouse data are reliable predictors of immunotherapy response. The mouse-based models built on these modules could be transferred to humans, effectively predicting drug responses and survival outcomes for cancer patients. Compared to conventional cancer biomarkers and existing prediction models based on mouse data, our method exhibits superior performance. These findings provide a valuable reference for further in-depth research on immunotherapy response prediction model based on mouse tumor profiles, with the potential for transfer applications in human cancer therapy.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"1074-1082"},"PeriodicalIF":3.9,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143963774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Generation-Based Few-Shot BioNER via Local Knowledge Index and Dual Prompts. 基于局部知识索引和双提示的基于代的少射生物识别。
IF 3.9 2区 生物学 Q1 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-12-01 Epub Date: 2025-05-10 DOI: 10.1007/s12539-025-00709-3
Weixin Li, Hong Wang, Wei Li, Jun Zhao, Yanshen Sun

Few-shot Biomedical Named Entity Recognition (BioNER) presents significant challenges due to limited training data and the presence of nested and discontinuous entities. To tackle these issues, a novel approach GKP-BioNER, Generation-based Few-Shot BioNER via Local Knowledge Index and Dual Prompts, is proposed. It redefines BioNER as a generation task by integrating hard and soft prompts. Specifically, GKP-BioNER constructs a localized knowledge index using a Wikipedia dump, facilitating the retrieval of semantically relevant texts to the original sentence. These texts are then reordered to prioritize the most semantically relevant content to the input data, serving as hard prompts. This helps the model to address challenges demanding domain-specific insights. Simultaneously, GKP-BioNER preserves the integrity of the pre-trained models while introducing learnable parameters as soft prompts to guide the self-attention layer, allowing the model to adapt to the context. Moreover, a soft prompt mechanism is designed to support knowledge transfer across domains. Extensive experiments on five datasets demonstrate that GKP-BioNER significantly outperforms eight state-of-the-art methods. It shows robust performance in low-resource and complex scenarios across various domains, highlighting its strength in knowledge transfer and broad applicability.

由于有限的训练数据以及嵌套和不连续实体的存在,少量生物医学命名实体识别(BioNER)提出了重大挑战。为了解决这些问题,提出了一种基于局部知识索引和双提示的基于代的少针生物识别方法GKP-BioNER。它通过集成硬提示和软提示将BioNER重新定义为生成任务。具体来说,GKP-BioNER使用维基百科转储构建了一个本地化的知识索引,便于检索与原始句子语义相关的文本。然后对这些文本进行重新排序,以优先考虑与输入数据语义最相关的内容,作为硬提示。这有助于模型处理需要特定领域洞察力的挑战。同时,GKP-BioNER保留了预训练模型的完整性,同时引入了可学习的参数作为软提示来引导自注意层,允许模型适应上下文。此外,还设计了软提示机制,支持跨领域知识转移。在5个数据集上进行的大量实验表明,GKP-BioNER显著优于8种最先进的方法。该方法在多领域低资源复杂场景下表现出稳健的性能,突出了知识转移的优势和广泛的适用性。
{"title":"Generation-Based Few-Shot BioNER via Local Knowledge Index and Dual Prompts.","authors":"Weixin Li, Hong Wang, Wei Li, Jun Zhao, Yanshen Sun","doi":"10.1007/s12539-025-00709-3","DOIUrl":"10.1007/s12539-025-00709-3","url":null,"abstract":"<p><p>Few-shot Biomedical Named Entity Recognition (BioNER) presents significant challenges due to limited training data and the presence of nested and discontinuous entities. To tackle these issues, a novel approach GKP-BioNER, Generation-based Few-Shot BioNER via Local Knowledge Index and Dual Prompts, is proposed. It redefines BioNER as a generation task by integrating hard and soft prompts. Specifically, GKP-BioNER constructs a localized knowledge index using a Wikipedia dump, facilitating the retrieval of semantically relevant texts to the original sentence. These texts are then reordered to prioritize the most semantically relevant content to the input data, serving as hard prompts. This helps the model to address challenges demanding domain-specific insights. Simultaneously, GKP-BioNER preserves the integrity of the pre-trained models while introducing learnable parameters as soft prompts to guide the self-attention layer, allowing the model to adapt to the context. Moreover, a soft prompt mechanism is designed to support knowledge transfer across domains. Extensive experiments on five datasets demonstrate that GKP-BioNER significantly outperforms eight state-of-the-art methods. It shows robust performance in low-resource and complex scenarios across various domains, highlighting its strength in knowledge transfer and broad applicability.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"970-986"},"PeriodicalIF":3.9,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143963773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhancing the Feature Representation of Protein Sequence Descriptors in Protein-Protein Interaction Prediction. 增强蛋白质-蛋白质相互作用预测中蛋白质序列描述子的特征表示。
IF 3.9 2区 生物学 Q1 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-12-01 Epub Date: 2025-06-02 DOI: 10.1007/s12539-025-00723-5
Hoai-Nhan Tran, Nguyen-Phuc-Xuan Quynh, Haochen Zhao, Jianxin Wang

In recent years, computational methods such as machine learning and deep learning have been increasingly used to solve various bioinformatics problems related to protein sequence data, such as predicting protein interaction, protein function, subcellular location, and so on. The first crucial step in applying these methods is how to represent a protein sequence as an input feature vector, as the feature vector quality significantly impacts the performance of those methods. A range of protein sequence descriptors has been proposed to enhance the quality of protein sequence representation. Existing descriptors extract information that can be obtained from sequences, such as composition, distribution, spatial correlation between amino acids, and so on. However, improvements can still be made in spatial correlation to capture better sequence similarity, which is valuable for Protein-Protein Interaction (PPI) prediction tasks. In this study, our aim is to develop new descriptors based on six well-known sequence descriptors to improve the ability to represent protein sequences. We evaluate the performance of the new descriptors on various PPI datasets. The results demonstrate that the proposed descriptors outperform their original versions in terms of PPI prediction performance. This work also introduces ProtSeqDesc (protein sequence descriptors), a flexible Python package that includes 51 types of feature vectors, covering all proposed descriptors. The software package is aimed at meeting the demand for the application of computational methods in bioinformatics.

近年来,机器学习和深度学习等计算方法被越来越多地用于解决与蛋白质序列数据相关的各种生物信息学问题,如预测蛋白质相互作用、蛋白质功能、亚细胞定位等。应用这些方法的第一个关键步骤是如何将蛋白质序列表示为输入特征向量,因为特征向量的质量显著影响这些方法的性能。为了提高蛋白质序列表示的质量,已经提出了一系列的蛋白质序列描述符。现有的描述符提取的信息可以从序列中获得,如组成、分布、氨基酸之间的空间相关性等。然而,空间相关性仍然可以得到改进,以获得更好的序列相似性,这对蛋白质-蛋白质相互作用(PPI)预测任务很有价值。在这项研究中,我们的目标是在六个已知的序列描述子的基础上开发新的描述子,以提高表示蛋白质序列的能力。我们评估了新描述符在各种PPI数据集上的性能。结果表明,所提出的描述符在PPI预测性能方面优于其原始版本。这项工作还介绍了ProtSeqDesc(蛋白质序列描述符),这是一个灵活的Python包,包含51种类型的特征向量,涵盖了所有提议的描述符。该软件包旨在满足计算方法在生物信息学中的应用需求。
{"title":"Enhancing the Feature Representation of Protein Sequence Descriptors in Protein-Protein Interaction Prediction.","authors":"Hoai-Nhan Tran, Nguyen-Phuc-Xuan Quynh, Haochen Zhao, Jianxin Wang","doi":"10.1007/s12539-025-00723-5","DOIUrl":"10.1007/s12539-025-00723-5","url":null,"abstract":"<p><p>In recent years, computational methods such as machine learning and deep learning have been increasingly used to solve various bioinformatics problems related to protein sequence data, such as predicting protein interaction, protein function, subcellular location, and so on. The first crucial step in applying these methods is how to represent a protein sequence as an input feature vector, as the feature vector quality significantly impacts the performance of those methods. A range of protein sequence descriptors has been proposed to enhance the quality of protein sequence representation. Existing descriptors extract information that can be obtained from sequences, such as composition, distribution, spatial correlation between amino acids, and so on. However, improvements can still be made in spatial correlation to capture better sequence similarity, which is valuable for Protein-Protein Interaction (PPI) prediction tasks. In this study, our aim is to develop new descriptors based on six well-known sequence descriptors to improve the ability to represent protein sequences. We evaluate the performance of the new descriptors on various PPI datasets. The results demonstrate that the proposed descriptors outperform their original versions in terms of PPI prediction performance. This work also introduces ProtSeqDesc (protein sequence descriptors), a flexible Python package that includes 51 types of feature vectors, covering all proposed descriptors. The software package is aimed at meeting the demand for the application of computational methods in bioinformatics.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"1018-1037"},"PeriodicalIF":3.9,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144208491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
NTMFF-DTA: Prediction of Drug-Target Affinity Based on Network Topology and Multi-feature Fusion. NTMFF-DTA:基于网络拓扑和多特征融合的药物-靶标亲和力预测。
IF 3.9 2区 生物学 Q1 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-12-01 Epub Date: 2025-02-25 DOI: 10.1007/s12539-025-00692-9
Yuandong Liu, Youzhi Liu, Haoqin Yang, Longbo Zhang, Kai Che, Linlin Xing

Predicting drug-target binding affinity (DTA) is an important step in the complex process of drug discovery or drug repositioning. A large number of computational methods proposed for the task of DTA prediction utilize single features of proteins to measure drug-protein or protein-protein interactions, ignoring multi-feature fusion between protein-related features (e.g., solvent accessibility, protein pockets, secondary structures, and distance maps, etc.). To address the aforementioned constraints, we propose a new network topology and multi-feature fusion based approach for DTA prediction (NTMFF-DTA), which deeply mines protein multiple types of data and propagates drug information across domains. Data in drug-target interactions are often sparse, and multi-feature fusion can enrich data information by integrating multiple features, thus overcoming the data sparsity problem to some extent. The proposed approach offers two main contributions: (1) constructing a relationship-aware GAT that selectively focuses on the connections between nodes and edges in the molecular graph to capture the more central roles of nodes and edges in DTA prediction and (2) constructing an information propagation channel between different feature domains of drug proteins to achieve the sharing of the importance weight of drug atoms and edges, and combining with a multi-head self-attention mechanism to capture residue-enhancing features. The NTMFF-DTA model was comparatively tested against several leading baseline technologies on commonly used datasets. Experimental show that NTMFF-DTA can effectively and accurately predict DTA and outperform existing comparative models.

预测药物靶标结合亲和力(DTA)是药物发现或重新定位的复杂过程中的重要步骤。为DTA预测任务提出的大量计算方法利用蛋白质的单一特征来测量药物-蛋白质或蛋白质-蛋白质相互作用,忽略了蛋白质相关特征(例如,溶剂可及性,蛋白质口袋,二级结构和距离图等)之间的多特征融合。为了解决上述限制,我们提出了一种新的基于网络拓扑和多特征融合的DTA预测方法(NTMFF-DTA),该方法深入挖掘蛋白质多种类型的数据并跨域传播药物信息。药物-靶标相互作用中的数据往往是稀疏的,多特征融合可以通过整合多个特征来丰富数据信息,从而在一定程度上克服了数据稀疏性问题。拟议的方法提供了两个主要贡献:(1)构建关系感知GAT,选择性地关注分子图中节点和边之间的连接,捕捉节点和边在DTA预测中更为中心的作用;(2)构建药物蛋白不同特征域之间的信息传播通道,实现药物原子和边的重要权重共享,并结合头部自关注机制捕捉残差增强特征。NTMFF-DTA模型在常用数据集上与几种领先的基线技术进行了比较测试。实验表明,NTMFF-DTA能够有效、准确地预测DTA,优于现有的比较模型。
{"title":"NTMFF-DTA: Prediction of Drug-Target Affinity Based on Network Topology and Multi-feature Fusion.","authors":"Yuandong Liu, Youzhi Liu, Haoqin Yang, Longbo Zhang, Kai Che, Linlin Xing","doi":"10.1007/s12539-025-00692-9","DOIUrl":"10.1007/s12539-025-00692-9","url":null,"abstract":"<p><p>Predicting drug-target binding affinity (DTA) is an important step in the complex process of drug discovery or drug repositioning. A large number of computational methods proposed for the task of DTA prediction utilize single features of proteins to measure drug-protein or protein-protein interactions, ignoring multi-feature fusion between protein-related features (e.g., solvent accessibility, protein pockets, secondary structures, and distance maps, etc.). To address the aforementioned constraints, we propose a new network topology and multi-feature fusion based approach for DTA prediction (NTMFF-DTA), which deeply mines protein multiple types of data and propagates drug information across domains. Data in drug-target interactions are often sparse, and multi-feature fusion can enrich data information by integrating multiple features, thus overcoming the data sparsity problem to some extent. The proposed approach offers two main contributions: (1) constructing a relationship-aware GAT that selectively focuses on the connections between nodes and edges in the molecular graph to capture the more central roles of nodes and edges in DTA prediction and (2) constructing an information propagation channel between different feature domains of drug proteins to achieve the sharing of the importance weight of drug atoms and edges, and combining with a multi-head self-attention mechanism to capture residue-enhancing features. The NTMFF-DTA model was comparatively tested against several leading baseline technologies on commonly used datasets. Experimental show that NTMFF-DTA can effectively and accurately predict DTA and outperform existing comparative models.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"935-947"},"PeriodicalIF":3.9,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143491929","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MFFBi-Unet: Merging Dynamic Sparse Attention and Multi-scale Feature Fusion for Medical Image Segmentation. MFFBi-Unet:融合动态稀疏关注和多尺度特征融合的医学图像分割。
IF 3.9 2区 生物学 Q1 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-12-01 Epub Date: 2025-07-29 DOI: 10.1007/s12539-025-00740-4
Baoshan Sun, Chunfei Liu, Qiuyan Wang, Kaiyu Bi, Wenxue Zhang

The advancement of deep learning has driven extensive research validating the effectiveness of U-Net-style symmetric encoder-decoder architectures based on Transformers for medical image segmentation. However, the inherent design requiring attention mechanisms to compute token affinities across all spatial locations leads to prohibitive computational complexity and substantial memory demands. Recent efforts have attempted to address these limitations through sparse attention mechanisms. However, existing approaches employing artificial, content-agnostic sparse attention patterns demonstrate limited capability in modeling long-range dependencies effectively. We propose MFFBi-Unet, a novel architecture incorporating dynamic sparse attention through bi-level routing, enabling context-aware computation allocation with enhanced adaptability. The encoder-decoder module integrates BiFormer to optimize semantic feature extraction and facilitate high-fidelity feature map reconstruction. A novel Multi-scale Feature Fusion (MFF) module in skip connections synergistically combines multi-level contextual information with processed multi-scale features. Extensive evaluations on multiple public medical benchmarks demonstrate that our method consistently exhibits significant advantages. Notably, our method achieves statistically significant improvements, outperforming state-of-the-art approaches like MISSFormer by 2.02% and 1.28% Dice scores on respective benchmarks.

深度学习的进步推动了广泛的研究,验证了基于transformer的u - net风格对称编码器-解码器架构在医学图像分割中的有效性。然而,固有的设计需要注意机制来计算所有空间位置上的标记亲和力,这导致了令人望而却步的计算复杂性和大量的内存需求。最近的努力试图通过稀疏注意机制来解决这些限制。然而,采用人工的、与内容无关的稀疏注意模式的现有方法在有效建模远程依赖关系方面表现出有限的能力。我们提出了一种新的MFFBi-Unet架构,通过双级路由结合动态稀疏注意力,使上下文感知的计算分配具有增强的适应性。编码器-解码器模块集成了BiFormer优化语义特征提取和促进高保真特征图重建。一种新型的多尺度特征融合(MFF)模块将多层次上下文信息与处理后的多尺度特征协同结合。对多个公共医疗基准的广泛评估表明,我们的方法始终显示出显著的优势。值得注意的是,我们的方法在统计上取得了显著的进步,在各自的基准测试中,比MISSFormer等最先进的方法分别高出2.02%和1.28%。
{"title":"MFFBi-Unet: Merging Dynamic Sparse Attention and Multi-scale Feature Fusion for Medical Image Segmentation.","authors":"Baoshan Sun, Chunfei Liu, Qiuyan Wang, Kaiyu Bi, Wenxue Zhang","doi":"10.1007/s12539-025-00740-4","DOIUrl":"10.1007/s12539-025-00740-4","url":null,"abstract":"<p><p>The advancement of deep learning has driven extensive research validating the effectiveness of U-Net-style symmetric encoder-decoder architectures based on Transformers for medical image segmentation. However, the inherent design requiring attention mechanisms to compute token affinities across all spatial locations leads to prohibitive computational complexity and substantial memory demands. Recent efforts have attempted to address these limitations through sparse attention mechanisms. However, existing approaches employing artificial, content-agnostic sparse attention patterns demonstrate limited capability in modeling long-range dependencies effectively. We propose MFFBi-Unet, a novel architecture incorporating dynamic sparse attention through bi-level routing, enabling context-aware computation allocation with enhanced adaptability. The encoder-decoder module integrates BiFormer to optimize semantic feature extraction and facilitate high-fidelity feature map reconstruction. A novel Multi-scale Feature Fusion (MFF) module in skip connections synergistically combines multi-level contextual information with processed multi-scale features. Extensive evaluations on multiple public medical benchmarks demonstrate that our method consistently exhibits significant advantages. Notably, our method achieves statistically significant improvements, outperforming state-of-the-art approaches like MISSFormer by 2.02% and 1.28% Dice scores on respective benchmarks.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"892-905"},"PeriodicalIF":3.9,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144742015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Top 10 Research Advances in Artificial Intelligence and Biomedical Science (2025). 人工智能与生物医学十大研究进展(2025)。
IF 3.9 2区 生物学 Q1 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-12-01 DOI: 10.1007/s12539-025-00791-7
Dong-Qing Wei
{"title":"Top 10 Research Advances in Artificial Intelligence and Biomedical Science (2025).","authors":"Dong-Qing Wei","doi":"10.1007/s12539-025-00791-7","DOIUrl":"10.1007/s12539-025-00791-7","url":null,"abstract":"","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"771-772"},"PeriodicalIF":3.9,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145587348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Domain Adaptive Interpretable Substructure-Aware Graph Attention Network for Drug-Drug Interaction Prediction. 用于药物-药物相互作用预测的领域自适应可解释子结构感知图注意网络。
IF 3.9 2区 生物学 Q1 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-12-01 Epub Date: 2025-01-07 DOI: 10.1007/s12539-024-00680-5
Qi Zhang, Yuxiao Wei, Liwei Liu

Accurate prediction of drug-drug interaction (DDI) is essential to improve clinical efficacy, avoid adverse effects of drug combination therapy, and enhance drug safety. Recently researchers have developed several computer-aided methods for DDI prediction. However, these methods lack the substructural features that are critical to drug interactions and are not effective in generalizing across domains and different distribution data. In this work, we present SAGAN, a domain adaptive interpretable substructure-aware graph attention network for DDI prediction. Based on attention mechanism and unsupervised clustering algorithm, we propose a new substructure segmentation method, which segments the drug molecule into multiple substructures, learns the mechanism of drug interaction from the perspective of interaction, and identifies important interaction regions between drugs. To enhance the generalization ability of the model, we improve and apply a conditional domain adversarial network to achieve cross-domain generalization by alternately optimizing the cross-entropy loss on the source domain and the adversarial loss of the domain discriminator. We evaluate and compare SAGAN with the state-of-the-art DDI prediction model on four real-world datasets for both in-domain and cross-domain scenarios, and show that SAGAN achieves the best overall performance. Moreover, the visualization results of the model show that SAGAN has achieved pharmacologically significant substructure extraction, which can help drug developers screen for some undiscovered local interaction sites, and provide important information for further drug structure optimization. The codes and datasets are available online at https://github.com/wyx2012/SAGAN .

准确预测药物相互作用(DDI)对提高临床疗效、避免药物联合治疗不良反应、提高药物安全性至关重要。最近,研究人员开发了几种计算机辅助的DDI预测方法。然而,这些方法缺乏对药物相互作用至关重要的亚结构特征,并且在跨域和不同分布数据的推广中不有效。在这项工作中,我们提出了SAGAN,一个用于DDI预测的领域自适应可解释子结构感知图注意网络。基于注意机制和无监督聚类算法,提出了一种新的子结构分割方法,将药物分子分割成多个子结构,从相互作用的角度学习药物相互作用的机制,识别药物之间重要的相互作用区域。为了提高模型的泛化能力,我们改进并应用了一个条件域对抗网络,通过交替优化源域上的交叉熵损失和域鉴别器的对抗损失来实现跨域泛化。我们在4个真实数据集上对SAGAN与最先进的DDI预测模型进行了评估和比较,并在域内和跨域场景下进行了比较,结果表明SAGAN达到了最佳的整体性能。此外,该模型的可视化结果表明,SAGAN已经实现了具有药理意义的亚结构提取,这可以帮助药物开发人员筛选一些未被发现的局部相互作用位点,并为进一步优化药物结构提供重要信息。代码和数据集可在https://github.com/wyx2012/SAGAN上在线获得。
{"title":"A Domain Adaptive Interpretable Substructure-Aware Graph Attention Network for Drug-Drug Interaction Prediction.","authors":"Qi Zhang, Yuxiao Wei, Liwei Liu","doi":"10.1007/s12539-024-00680-5","DOIUrl":"10.1007/s12539-024-00680-5","url":null,"abstract":"<p><p>Accurate prediction of drug-drug interaction (DDI) is essential to improve clinical efficacy, avoid adverse effects of drug combination therapy, and enhance drug safety. Recently researchers have developed several computer-aided methods for DDI prediction. However, these methods lack the substructural features that are critical to drug interactions and are not effective in generalizing across domains and different distribution data. In this work, we present SAGAN, a domain adaptive interpretable substructure-aware graph attention network for DDI prediction. Based on attention mechanism and unsupervised clustering algorithm, we propose a new substructure segmentation method, which segments the drug molecule into multiple substructures, learns the mechanism of drug interaction from the perspective of interaction, and identifies important interaction regions between drugs. To enhance the generalization ability of the model, we improve and apply a conditional domain adversarial network to achieve cross-domain generalization by alternately optimizing the cross-entropy loss on the source domain and the adversarial loss of the domain discriminator. We evaluate and compare SAGAN with the state-of-the-art DDI prediction model on four real-world datasets for both in-domain and cross-domain scenarios, and show that SAGAN achieves the best overall performance. Moreover, the visualization results of the model show that SAGAN has achieved pharmacologically significant substructure extraction, which can help drug developers screen for some undiscovered local interaction sites, and provide important information for further drug structure optimization. The codes and datasets are available online at https://github.com/wyx2012/SAGAN .</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"773-790"},"PeriodicalIF":3.9,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142948364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Semantic Consistency Network with Edge Learner and Connectivity Enhancer for Cervical Tumor Segmentation from Histopathology Images. 基于边缘学习器和连接增强器的语义一致性网络在组织病理图像中分割子宫颈肿瘤。
IF 3.9 2区 生物学 Q1 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-12-01 Epub Date: 2025-04-23 DOI: 10.1007/s12539-025-00691-w
Lisha Pang, Peng He, Yue Han, Hao Cui, Peng Feng, Chi Zhang, Pan Huang, Sukun Tian

Accurate tumor grading and regional identification of cervical tumors are important for diagnosis and prognosis. Traditional manual microscopy methods suffer from time-consuming, labor-intensive, and subjective bias problems, so tumor segmentation methods based on deep learning are gradually becoming a hotspot in current research. Cervical tumors have diverse morphologies, which leads to low similarity between the mask edge and ground-truth edge of existing semantic segmentation models. Moreover, the texture and geometric arrangement features of normal tissues and tumors are highly similar, which causes poor pixel connectivity in the mask of the segmentation model. To this end, we propose an end-to-end semantic consistency network with the edge learner and the connectivity enhancer, i.e., ERNet. First, the edge learner consists of a stacked shallow convolutional neural network, so it can effectively enhance the ability of ERNet to learn and represent polymorphic tumor edges. Second, the connectivity enhancer learns detailed information and contextual information of tumor images, so it can enhance the pixel connectivity of the masks. Finally, edge features and pixel-level features are adaptively coupled, and the segmentation results are additionally optimized by the tumor classification task as a whole. The results show that, compared with those of other state-of-the-art segmentation models, the structural similarity and the mean intersection over union of ERNet are improved to 88.17% and 83.22%, respectively, which reflects the excellent edge similarity and pixel connectivity of the proposed model. Finally, we conduct a generalization experiment on laryngeal tumor images. Therefore, the ERNet network has good clinical popularization and practical value.

宫颈肿瘤的准确分级和区域识别对诊断和预后具有重要意义。传统的人工显微镜方法存在耗时、费力、主观偏倚等问题,因此基于深度学习的肿瘤分割方法逐渐成为当前研究的热点。宫颈肿瘤形态多样,导致现有语义分割模型的掩模边缘与真值边缘相似度较低。此外,正常组织和肿瘤的纹理和几何排列特征高度相似,导致分割模型掩模中像素连通性差。为此,我们提出了一个包含边缘学习器和连通性增强器的端到端语义一致性网络,即ERNet。首先,边缘学习器由一个堆叠的浅卷积神经网络组成,因此可以有效增强ERNet学习和表示多态肿瘤边缘的能力。其次,连通性增强器学习肿瘤图像的细节信息和上下文信息,从而增强掩模的像素连通性。最后,对边缘特征和像素级特征进行自适应耦合,并对分割结果进行整体优化。结果表明,与其他最先进的分割模型相比,ERNet的结构相似度和平均交联度分别提高到88.17%和83.22%,这反映了该模型具有良好的边缘相似度和像素连通性。最后,我们对喉部肿瘤图像进行了泛化实验。因此,ERNet网络具有良好的临床推广和实用价值。
{"title":"Semantic Consistency Network with Edge Learner and Connectivity Enhancer for Cervical Tumor Segmentation from Histopathology Images.","authors":"Lisha Pang, Peng He, Yue Han, Hao Cui, Peng Feng, Chi Zhang, Pan Huang, Sukun Tian","doi":"10.1007/s12539-025-00691-w","DOIUrl":"10.1007/s12539-025-00691-w","url":null,"abstract":"<p><p>Accurate tumor grading and regional identification of cervical tumors are important for diagnosis and prognosis. Traditional manual microscopy methods suffer from time-consuming, labor-intensive, and subjective bias problems, so tumor segmentation methods based on deep learning are gradually becoming a hotspot in current research. Cervical tumors have diverse morphologies, which leads to low similarity between the mask edge and ground-truth edge of existing semantic segmentation models. Moreover, the texture and geometric arrangement features of normal tissues and tumors are highly similar, which causes poor pixel connectivity in the mask of the segmentation model. To this end, we propose an end-to-end semantic consistency network with the edge learner and the connectivity enhancer, i.e., ERNet. First, the edge learner consists of a stacked shallow convolutional neural network, so it can effectively enhance the ability of ERNet to learn and represent polymorphic tumor edges. Second, the connectivity enhancer learns detailed information and contextual information of tumor images, so it can enhance the pixel connectivity of the masks. Finally, edge features and pixel-level features are adaptively coupled, and the segmentation results are additionally optimized by the tumor classification task as a whole. The results show that, compared with those of other state-of-the-art segmentation models, the structural similarity and the mean intersection over union of ERNet are improved to 88.17% and 83.22%, respectively, which reflects the excellent edge similarity and pixel connectivity of the proposed model. Finally, we conduct a generalization experiment on laryngeal tumor images. Therefore, the ERNet network has good clinical popularization and practical value.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"917-934"},"PeriodicalIF":3.9,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144006689","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
HAFMMDA: HIN2vec-Based Attentional Factorization Machines for Predicting Microbe-Drug Associations. HAFMMDA:基于hin2vec的注意力因子分解机器预测微生物与药物的关联。
IF 3.9 2区 生物学 Q1 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-12-01 Epub Date: 2025-07-30 DOI: 10.1007/s12539-025-00710-w
Bo Wang, Junqi Wang, Xiaoxin Du, Jianfei Zhang, Yang He, Fangjian Ma

Emerging research continues to reveal the fundamental contributions of microbial communities to maintaining human physiological balance and advancing drug discovery. However, established wet-lab investigation techniques require significant time and resources. Contemporary research efforts have predominantly concentrated on establishing robust computational architectures to predict microbe-drug associations. Our research establishes a neural network architecture that synthesizes heterogeneous biological relationships with attentional factorization machines (HAFMMDA) to predict undiscovered microbe-drug linkages. The initial step involves assembling a heterogeneous network architecture integrating three key components: microbe similarity networks, drug similarity networks, and established microbe-drug interaction networks. HAFMMDA utilizes HIN2vec to extract feature representations of microbe-drug pairs. Finally, it combines second-order feature interactions and attention mechanism to perform comprehensive prediction. Five-fold cross-validation results confirmed excellent predictive performance with an AUC score of 0.9805, demonstrating statistically significant improvements over five contemporary baseline approaches. These findings corroborate HAFMMDA's effectiveness in uncovering verified drug-microorganism associations while simultaneously predicting innovative therapeutic-microbe relationships.

新兴研究不断揭示微生物群落在维持人体生理平衡和推进药物发现方面的基本贡献。然而,现有的湿实验室调查技术需要大量的时间和资源。当代的研究工作主要集中在建立强大的计算架构来预测微生物与药物的关联。我们的研究建立了一个神经网络架构,通过注意因子分解机器(HAFMMDA)综合异质生物关系来预测未发现的微生物-药物联系。第一步包括组装一个异构网络架构,集成三个关键组件:微生物相似网络、药物相似网络和已建立的微生物-药物相互作用网络。HAFMMDA利用HIN2vec提取微生物-药物对的特征表示。最后,结合二阶特征交互和注意机制进行综合预测。五重交叉验证结果证实了良好的预测性能,AUC得分为0.9805,与五种当代基线方法相比,具有统计学上的显著改善。这些发现证实了HAFMMDA在揭示已证实的药物-微生物关联同时预测创新治疗-微生物关系方面的有效性。
{"title":"HAFMMDA: HIN2vec-Based Attentional Factorization Machines for Predicting Microbe-Drug Associations.","authors":"Bo Wang, Junqi Wang, Xiaoxin Du, Jianfei Zhang, Yang He, Fangjian Ma","doi":"10.1007/s12539-025-00710-w","DOIUrl":"10.1007/s12539-025-00710-w","url":null,"abstract":"<p><p>Emerging research continues to reveal the fundamental contributions of microbial communities to maintaining human physiological balance and advancing drug discovery. However, established wet-lab investigation techniques require significant time and resources. Contemporary research efforts have predominantly concentrated on establishing robust computational architectures to predict microbe-drug associations. Our research establishes a neural network architecture that synthesizes heterogeneous biological relationships with attentional factorization machines (HAFMMDA) to predict undiscovered microbe-drug linkages. The initial step involves assembling a heterogeneous network architecture integrating three key components: microbe similarity networks, drug similarity networks, and established microbe-drug interaction networks. HAFMMDA utilizes HIN2vec to extract feature representations of microbe-drug pairs. Finally, it combines second-order feature interactions and attention mechanism to perform comprehensive prediction. Five-fold cross-validation results confirmed excellent predictive performance with an AUC score of 0.9805, demonstrating statistically significant improvements over five contemporary baseline approaches. These findings corroborate HAFMMDA's effectiveness in uncovering verified drug-microorganism associations while simultaneously predicting innovative therapeutic-microbe relationships.</p>","PeriodicalId":13670,"journal":{"name":"Interdisciplinary Sciences: Computational Life Sciences","volume":" ","pages":"1083-1100"},"PeriodicalIF":3.9,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144753273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Interdisciplinary Sciences: Computational Life Sciences
全部 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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1