首页 > 最新文献

Journal of Bioinformatics and Computational Biology最新文献

英文 中文
Antimicrobial peptides recognition using weighted physicochemical property encoding. 基于加权理化性质编码的抗菌肽识别。
IF 1 4区 生物学 Q3 Computer Science Pub Date : 2023-04-01 DOI: 10.1142/S0219720023500063
Standa Na, Dhammika Leshan Wannigama, Thammakorn Saethang

Antimicrobial resistance is a major public health concern. Antimicrobial peptides (AMPs) are one of the host defense mechanisms responding efficiently against multidrug-resistant microbes. Since the process of screening AMPs from a large number of peptides is still high-priced and time-consuming, the development of a precise and rapid computer-aided tool is essential for preliminary AMPs selection ahead of laboratory experiments. In this study, we proposed AMPs recognition models using a new peptide encoding method called amino acid index weight (AAIW). Four AMPs recognition models including antimicrobial, antibacterial, antiviral, and antifungal were trained based on datasets combined from the DRAMP and other published databases. These models achieved high performance compared to the preceding AMPs recognition models when evaluated on two independent test sets. All four models yielded over 93% in accuracy and 0.87 in Matthew's correlation coefficient (MCC). An online AMPs recognition server is accessible at https://amppred-aaiw.com.

抗微生物药物耐药性是一个主要的公共卫生问题。抗菌肽(Antimicrobial peptides, AMPs)是一种有效对抗多重耐药微生物的宿主防御机制。由于从大量肽中筛选amp的过程仍然昂贵且耗时,因此开发一种精确快速的计算机辅助工具对于在实验室实验之前进行amp的初步选择至关重要。在这项研究中,我们提出了一种新的肽编码方法,称为氨基酸指数权重(AAIW)的amp识别模型。基于DRAMP和其他已发表数据库的数据集,对抗菌、抗菌、抗病毒和抗真菌4种抗菌药物识别模型进行了训练。当在两个独立的测试集上进行评估时,这些模型与之前的amp识别模型相比取得了更高的性能。四种模型的准确率均超过93%,马修相关系数(MCC)为0.87。在线amp识别服务器可访问https://amppred-aaiw.com。
{"title":"Antimicrobial peptides recognition using weighted physicochemical property encoding.","authors":"Standa Na,&nbsp;Dhammika Leshan Wannigama,&nbsp;Thammakorn Saethang","doi":"10.1142/S0219720023500063","DOIUrl":"https://doi.org/10.1142/S0219720023500063","url":null,"abstract":"<p><p>Antimicrobial resistance is a major public health concern. Antimicrobial peptides (AMPs) are one of the host defense mechanisms responding efficiently against multidrug-resistant microbes. Since the process of screening AMPs from a large number of peptides is still high-priced and time-consuming, the development of a precise and rapid computer-aided tool is essential for preliminary AMPs selection ahead of laboratory experiments. In this study, we proposed AMPs recognition models using a new peptide encoding method called amino acid index weight (AAIW). Four AMPs recognition models including antimicrobial, antibacterial, antiviral, and antifungal were trained based on datasets combined from the DRAMP and other published databases. These models achieved high performance compared to the preceding AMPs recognition models when evaluated on two independent test sets. All four models yielded over 93% in accuracy and 0.87 in Matthew's correlation coefficient (MCC). An online AMPs recognition server is accessible at https://amppred-aaiw.com.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9528874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Testing and improving the performance of protein thermostability predictors for the engineering of cellulases. 纤维素酶工程中蛋白质热稳定性预测因子的测试与改进。
IF 1 4区 生物学 Q3 Computer Science Pub Date : 2023-04-01 DOI: 10.1142/S0219720023300010
Anna Dotsenko, Jury Denisenko, Dmitrii Osipov, Aleksandra Rozhkova, Ivan Zorov, Arkady Sinitsyn
Thermostability of cellulases can be increased through amino acid substitutions and by protein engineering with predictors of protein thermostability. We have carried out a systematic analysis of the performance of 18 predictors for the engineering of cellulases. The predictors were PoPMuSiC, HoTMuSiC, I-Mutant 2.0, I-Mutant Suite, PremPS, Hotspot, Maestroweb, DynaMut, ENCoM ([Formula: see text] and [Formula: see text], mCSM, SDM, DUET, RosettaDesign, Cupsat (thermal and denaturant approaches), ConSurf, and Voronoia. The highest values of accuracy, F-measure, and MCC were obtained for DynaMut, SDM, RosettaDesign, and PremPS. A combination of the predictors provided an improvement in the performance. F-measure and MCC were improved by 14% and 28%, respectively. Accuracy and sensitivity were also improved by 9% and 20%, respectively, compared to the maximal values of single predictors. The reported values of the performance of the predictors and their combination may aid research in the engineering of thermostable cellulases as well as the further development of thermostability predictors.
纤维素酶的热稳定性可以通过氨基酸取代和蛋白质工程来提高。我们对18种纤维素酶工程预测因子的性能进行了系统的分析。预测因子为PoPMuSiC、HoTMuSiC、I-Mutant 2.0、I-Mutant Suite、PremPS、Hotspot、Maestroweb、DynaMut、ENCoM([公式:见文]和[公式:见文])、mCSM、SDM、DUET、RosettaDesign、Cupsat(热变性方法)、ConSurf和Voronoia。DynaMut、SDM、RosettaDesign和PremPS的准确度、F-measure和MCC值最高。这些预测因素的组合提高了性能。F-measure和MCC分别提高了14%和28%。与单一预测因子的最大值相比,准确度和灵敏度也分别提高了9%和20%。所报道的预测因子及其组合的性能值可能有助于热稳定性纤维素酶的工程研究以及热稳定性预测因子的进一步开发。
{"title":"Testing and improving the performance of protein thermostability predictors for the engineering of cellulases.","authors":"Anna Dotsenko,&nbsp;Jury Denisenko,&nbsp;Dmitrii Osipov,&nbsp;Aleksandra Rozhkova,&nbsp;Ivan Zorov,&nbsp;Arkady Sinitsyn","doi":"10.1142/S0219720023300010","DOIUrl":"https://doi.org/10.1142/S0219720023300010","url":null,"abstract":"Thermostability of cellulases can be increased through amino acid substitutions and by protein engineering with predictors of protein thermostability. We have carried out a systematic analysis of the performance of 18 predictors for the engineering of cellulases. The predictors were PoPMuSiC, HoTMuSiC, I-Mutant 2.0, I-Mutant Suite, PremPS, Hotspot, Maestroweb, DynaMut, ENCoM ([Formula: see text] and [Formula: see text], mCSM, SDM, DUET, RosettaDesign, Cupsat (thermal and denaturant approaches), ConSurf, and Voronoia. The highest values of accuracy, F-measure, and MCC were obtained for DynaMut, SDM, RosettaDesign, and PremPS. A combination of the predictors provided an improvement in the performance. F-measure and MCC were improved by 14% and 28%, respectively. Accuracy and sensitivity were also improved by 9% and 20%, respectively, compared to the maximal values of single predictors. The reported values of the performance of the predictors and their combination may aid research in the engineering of thermostable cellulases as well as the further development of thermostability predictors.","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9473268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A pharmacokinetic model based on the SSA-1DCNN-Attention method. 基于ssa - 1dcnn -注意力法的药代动力学模型。
IF 1 4区 生物学 Q3 Computer Science Pub Date : 2023-02-01 DOI: 10.1142/S021972002350004X
Zi-Yi He, Jie-Yu Yang, Yong Li

To solve the problem of the lack of representativeness of the training set and the poor prediction accuracy due to the limited number of training samples when the machine learning method is used for the classification and prediction of pharmacokinetic indicators, this paper proposes a 1DCNN-Attention concentration prediction model optimized by the sparrow search algorithm (SSA). First, the SMOTE method is used to expand the small sample experimental data to make the data diverse and representative. Then a one-dimensional convolutional neural network (1DCNN) model is established, and the attention mechanism is introduced to calculate the weight of each variable for dividing the importance of each pharmacokinetic indicator by the output drug concentration. The SSA algorithm was used to optimize the parameters in the model to improve the prediction accuracy after data expansion. Taking the pharmacokinetic model of phenobarbital (PHB) combined with Cynanchum otophyllum saponins to treat epilepsy as an example, the concentration changes of PHB were predicted and the effectiveness of the method was verified. The results show that the proposed model has a better prediction effect than other methods.

为解决机器学习方法用于药代动力学指标分类预测时训练集缺乏代表性和训练样本数量有限导致预测精度不高的问题,本文提出了一种采用麻雀搜索算法(SSA)优化的1dcnn -注意力浓度预测模型。首先,采用SMOTE方法对小样本实验数据进行扩充,使数据具有多样性和代表性。然后建立一维卷积神经网络(1DCNN)模型,引入注意机制计算各变量的权重,将各药代动力学指标的重要性除以输出药物浓度。采用SSA算法对模型参数进行优化,提高数据扩展后的预测精度。以苯巴比妥(PHB)联合秦艽皂苷治疗癫痫的药代动力学模型为例,预测了PHB的浓度变化,验证了该方法的有效性。结果表明,该模型具有较好的预测效果。
{"title":"A pharmacokinetic model based on the SSA-1DCNN-Attention method.","authors":"Zi-Yi He,&nbsp;Jie-Yu Yang,&nbsp;Yong Li","doi":"10.1142/S021972002350004X","DOIUrl":"https://doi.org/10.1142/S021972002350004X","url":null,"abstract":"<p><p>To solve the problem of the lack of representativeness of the training set and the poor prediction accuracy due to the limited number of training samples when the machine learning method is used for the classification and prediction of pharmacokinetic indicators, this paper proposes a 1DCNN-Attention concentration prediction model optimized by the sparrow search algorithm (SSA). First, the SMOTE method is used to expand the small sample experimental data to make the data diverse and representative. Then a one-dimensional convolutional neural network (1DCNN) model is established, and the attention mechanism is introduced to calculate the weight of each variable for dividing the importance of each pharmacokinetic indicator by the output drug concentration. The SSA algorithm was used to optimize the parameters in the model to improve the prediction accuracy after data expansion. Taking the pharmacokinetic model of phenobarbital (PHB) combined with <i>Cynanchum otophyllum saponins</i> to treat epilepsy as an example, the concentration changes of PHB were predicted and the effectiveness of the method was verified. The results show that the proposed model has a better prediction effect than other methods.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9473265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
PTGAC Model: A machine learning approach for constructing phylogenetic tree to compare protein sequences. PTGAC模型:一种用于构建系统发育树以比较蛋白质序列的机器学习方法。
IF 1 4区 生物学 Q3 Computer Science Pub Date : 2023-02-01 DOI: 10.1142/S0219720022500287
Jayanta Pal, Sourav Saha, Bansibadan Maji, Dilip Kumar Bhattacharya

This work proposes a machine learning-based phylogenetic tree generation model based on agglomerative clustering (PTGAC) that compares protein sequences considering all known chemical properties of amino acids. The proposed model can serve as a suitable alternative to the Unweighted Pair Group Method with Arithmetic Mean (UPGMA), which is inherently time-consuming in nature. Initially, principal component analysis (PCA) is used in the proposed scheme to reduce the dimensions of 20 amino acids using seven known chemical characteristics, yielding 20 TP (Total Points) values for each amino acid. The approach of cumulative summing is then used to give a non-degenerate numeric representation of the sequences based on these 20 TP values. A special kind of three-component vector is proposed as a descriptor, which consists of a new type of non-central moment of orders one, two, and three. Subsequently, the proposed model uses Euclidean Distance measures among the descriptors to create a distance matrix. Finally, a phylogenetic tree is constructed using hierarchical agglomerative clustering based on the distance matrix. The results are compared with the UPGMA and other existing methods in terms of the quality and time of constructing the phylogenetic tree. Both qualitative and quantitative analysis are performed as key assessment criteria for analyzing the performance of the proposed model. The qualitative analysis of the phylogenetic tree is performed by considering rationalized perception, while the quantitative analysis is performed based on symmetric distance (SD). On both criteria, the results obtained by the proposed model are more satisfactory than those produced earlier on the same species by other methods. Notably, this method is found to be efficient in terms of both time and space requirements and is capable of dealing with protein sequences of varying lengths.

这项工作提出了一种基于聚类(PTGAC)的基于机器学习的系统发育树生成模型,该模型考虑所有已知氨基酸的化学性质来比较蛋白质序列。该模型可以作为一种合适的替代算法,以克服UPGMA算法固有的耗时问题。最初,主成分分析(PCA)在提议的方案中使用七个已知的化学特性来降低20个氨基酸的维数,为每个氨基酸产生20个TP (Total Points)值。然后使用累积求和的方法给出基于这20个TP值的序列的非退化数字表示。提出了一种特殊的三分量矢量作为描述子,它由一、二、三阶的新型非中心矩组成。随后,该模型使用描述符之间的欧几里得距离度量来创建距离矩阵。最后,采用基于距离矩阵的分层聚类方法构建了系统发育树。结果与UPGMA和其他现有方法在构建系统发育树的质量和时间方面进行了比较。定性和定量分析作为分析所提出模型性能的关键评估标准。系统发育树的定性分析是基于理性感知,定量分析是基于对称距离(SD)。在这两个标准下,所提出的模型所得到的结果比以前用其他方法对同一物种所得到的结果更令人满意。值得注意的是,该方法在时间和空间要求方面都是有效的,并且能够处理不同长度的蛋白质序列。
{"title":"PTGAC Model: A machine learning approach for constructing phylogenetic tree to compare protein sequences.","authors":"Jayanta Pal,&nbsp;Sourav Saha,&nbsp;Bansibadan Maji,&nbsp;Dilip Kumar Bhattacharya","doi":"10.1142/S0219720022500287","DOIUrl":"https://doi.org/10.1142/S0219720022500287","url":null,"abstract":"<p><p>This work proposes a machine learning-based phylogenetic tree generation model based on agglomerative clustering (PTGAC) that compares protein sequences considering all known chemical properties of amino acids. The proposed model can serve as a suitable alternative to the Unweighted Pair Group Method with Arithmetic Mean (UPGMA), which is inherently time-consuming in nature. Initially, principal component analysis (PCA) is used in the proposed scheme to reduce the dimensions of 20 amino acids using seven known chemical characteristics, yielding 20 TP (Total Points) values for each amino acid. The approach of cumulative summing is then used to give a non-degenerate numeric representation of the sequences based on these 20 TP values. A special kind of three-component vector is proposed as a descriptor, which consists of a new type of non-central moment of orders one, two, and three. Subsequently, the proposed model uses Euclidean Distance measures among the descriptors to create a distance matrix. Finally, a phylogenetic tree is constructed using hierarchical agglomerative clustering based on the distance matrix. The results are compared with the UPGMA and other existing methods in terms of the quality and time of constructing the phylogenetic tree. Both qualitative and quantitative analysis are performed as key assessment criteria for analyzing the performance of the proposed model. The qualitative analysis of the phylogenetic tree is performed by considering rationalized perception, while the quantitative analysis is performed based on symmetric distance (SD). On both criteria, the results obtained by the proposed model are more satisfactory than those produced earlier on the same species by other methods. Notably, this method is found to be efficient in terms of both time and space requirements and is capable of dealing with protein sequences of varying lengths.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9472273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel method for predicting DNA N4-methylcytosine sites based on deep forest algorithm. 基于深度森林算法的DNA n4 -甲基胞嘧啶位点预测新方法。
IF 1 4区 生物学 Q3 Computer Science Pub Date : 2023-02-01 DOI: 10.1142/S0219720023500038
Yonglin Zhang, Mei Hu, Qi Mo, Wenli Gan, Jiesi Luo

N4-methyladenosine (4mC) methylation is an essential epigenetic modification of deoxyribonucleic acid (DNA) that plays a key role in many biological processes such as gene expression, gene replication and transcriptional regulation. Genome-wide identification and analysis of the 4mC sites can better reveal the epigenetic mechanisms that regulate various biological processes. Although some high-throughput genomic experimental methods can effectively facilitate the identification in a genome-wide scale, they are still too expensive and laborious for routine use. Computational methods can compensate for these disadvantages, but they still leave much room for performance improvement. In this study, we develop a non-NN-style deep learning-based approach for accurately predicting 4mC sites from genomic DNA sequence. We generate various informative features represented sequence fragments around 4mC sites, and subsequently implement them into a deep forest (DF) model. After training the deep model using 10-fold cross-validation, the overall accuracies of 85.0%, 90.0%, and 87.8% were achieved for three representative model organisms, A. thaliana, C. elegans, and D. melanogaster, respectively. In addition, extensive experiment results show that our proposed approach outperforms other existing state-of-the-art predictors in the 4mC identification. Our approach stands for the first DF-based algorithm for the prediction of 4mC sites, providing a novel idea in this field.

n4 -甲基腺苷(4mC)甲基化是脱氧核糖核酸(DNA)必不可少的表观遗传修饰,在基因表达、基因复制和转录调控等许多生物学过程中起着关键作用。4mC位点的全基因组鉴定和分析可以更好地揭示调控各种生物过程的表观遗传机制。虽然一些高通量的基因组实验方法可以有效地促进全基因组范围内的鉴定,但它们仍然过于昂贵和费力,无法常规使用。计算方法可以弥补这些缺点,但它们仍然为性能改进留下了很大的空间。在这项研究中,我们开发了一种非神经网络风格的基于深度学习的方法,用于从基因组DNA序列中准确预测4mC位点。我们在4mC位点附近生成了代表序列片段的各种信息特征,并随后将其实现到深森林(DF)模型中。采用10倍交叉验证对深度模型进行训练后,拟南拟南、秀丽隐杆线虫和黑腹d.m anogaster 3种典型模式生物的总体准确率分别达到85.0%、90.0%和87.8%。此外,大量的实验结果表明,我们提出的方法在4mC识别方面优于其他现有的最先进的预测方法。我们的方法代表了第一个基于df的4mC位点预测算法,为该领域提供了一个新的思路。
{"title":"A novel method for predicting DNA N<sup>4</sup>-methylcytosine sites based on deep forest algorithm.","authors":"Yonglin Zhang,&nbsp;Mei Hu,&nbsp;Qi Mo,&nbsp;Wenli Gan,&nbsp;Jiesi Luo","doi":"10.1142/S0219720023500038","DOIUrl":"https://doi.org/10.1142/S0219720023500038","url":null,"abstract":"<p><p>N<sup>4</sup>-methyladenosine (4mC) methylation is an essential epigenetic modification of deoxyribonucleic acid (DNA) that plays a key role in many biological processes such as gene expression, gene replication and transcriptional regulation. Genome-wide identification and analysis of the 4mC sites can better reveal the epigenetic mechanisms that regulate various biological processes. Although some high-throughput genomic experimental methods can effectively facilitate the identification in a genome-wide scale, they are still too expensive and laborious for routine use. Computational methods can compensate for these disadvantages, but they still leave much room for performance improvement. In this study, we develop a non-NN-style deep learning-based approach for accurately predicting 4mC sites from genomic DNA sequence. We generate various informative features represented sequence fragments around 4mC sites, and subsequently implement them into a deep forest (DF) model. After training the deep model using 10-fold cross-validation, the overall accuracies of 85.0%, 90.0%, and 87.8% were achieved for three representative model organisms, <i>A. thaliana, C. elegans</i>, and <i>D. melanogaster</i>, respectively. In addition, extensive experiment results show that our proposed approach outperforms other existing state-of-the-art predictors in the 4mC identification. Our approach stands for the first DF-based algorithm for the prediction of 4mC sites, providing a novel idea in this field.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9474484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
RiRPSSP: A unified deep learning method for prediction of regular and irregular protein secondary structures. RiRPSSP:用于预测规则和不规则蛋白质二级结构的统一深度学习方法。
IF 1 4区 生物学 Q3 Computer Science Pub Date : 2023-02-01 DOI: 10.1142/S0219720023500014
Mukhtar Ahmad Sofi, M Arif Wani

Protein secondary structure prediction (PSSP) is an important and challenging task in protein bioinformatics. Protein secondary structures (SSs) are categorized in regular and irregular structure classes. Regular SSs, representing nearly 50% of amino acids consist of helices and sheets, whereas the remaining amino acids represent irregular SSs. [Formula: see text]-turns and [Formula: see text]-turns are the most abundant irregular SSs present in proteins. Existing methods are well developed for separate prediction of regular and irregular SSs. However, for more comprehensive PSSP, it is essential to develop a uniform model to predict all types of SSs simultaneously. In this work, using a novel dataset comprising dictionary of secondary structure of protein (DSSP)-based SSs and PROMOTIF-based [Formula: see text]-turns and [Formula: see text]-turns, we propose a unified deep learning model consisting of convolutional neural networks (CNNs) and long short-term memory networks (LSTMs) for simultaneous prediction of regular and irregular SSs. To the best of our knowledge, this is the first study in PSSP covering both regular and irregular structures. The protein sequences in our constructed datasets, RiR6069 and RiR513, have been borrowed from benchmark CB6133 and CB513 datasets, respectively. The results are indicative of increased PSSP accuracy.

蛋白质二级结构预测(PSSP)是蛋白质生物信息学领域的一项重要而富有挑战性的工作。蛋白质二级结构分为规则结构和不规则结构两类。近50%的氨基酸是由螺旋和片状组成的规则SSs,而其余的氨基酸则是不规则SSs。[公式:见文]-turn和[公式:见文]-turn是蛋白质中最丰富的不规则SSs。现有的方法已经发展得很好,可以分别预测规则和不规则的SSs。然而,对于更全面的PSSP,必须建立一个统一的模型来同时预测所有类型的SSs。在这项工作中,我们使用一个新的数据集,包括基于蛋白质二级结构(DSSP)的SSs字典和基于promotifs的[公式:见文本]-turns和[公式:见文本]-turns,我们提出了一个由卷积神经网络(cnn)和长短期记忆网络(LSTMs)组成的统一深度学习模型,用于同时预测规则和不规则的SSs。据我们所知,这是第一次在PSSP中同时研究规则和不规则结构。我们构建的数据集RiR6069和RiR513中的蛋白质序列分别借鉴了基准CB6133和CB513数据集。结果表明PSSP的准确性有所提高。
{"title":"RiRPSSP: A unified deep learning method for prediction of regular and irregular protein secondary structures.","authors":"Mukhtar Ahmad Sofi,&nbsp;M Arif Wani","doi":"10.1142/S0219720023500014","DOIUrl":"https://doi.org/10.1142/S0219720023500014","url":null,"abstract":"<p><p>Protein secondary structure prediction (PSSP) is an important and challenging task in protein bioinformatics. Protein secondary structures (SSs) are categorized in regular and irregular structure classes. Regular SSs, representing nearly 50% of amino acids consist of helices and sheets, whereas the remaining amino acids represent irregular SSs. [Formula: see text]-turns and [Formula: see text]-turns are the most abundant irregular SSs present in proteins. Existing methods are well developed for separate prediction of regular and irregular SSs. However, for more comprehensive PSSP, it is essential to develop a uniform model to predict all types of SSs simultaneously. In this work, using a novel dataset comprising dictionary of secondary structure of protein (DSSP)-based SSs and PROMOTIF-based [Formula: see text]-turns and [Formula: see text]-turns, we propose a unified deep learning model consisting of convolutional neural networks (CNNs) and long short-term memory networks (LSTMs) for simultaneous prediction of regular and irregular SSs. To the best of our knowledge, this is the first study in PSSP covering both regular and irregular structures. The protein sequences in our constructed datasets, RiR6069 and RiR513, have been borrowed from benchmark CB6133 and CB513 datasets, respectively. The results are indicative of increased PSSP accuracy.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9474486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
NuKit: A deep learning platform for fast nucleus segmentation of histopathological images. NuKit:一个深度学习平台,用于组织病理图像的快速核分割。
IF 1 4区 生物学 Q3 Computer Science Pub Date : 2023-02-01 DOI: 10.1142/S0219720023500026
Ching-Nung Lin, Christine H Chung, Aik Choon Tan

Nucleus segmentation represents the initial step for histopathological image analysis pipelines, and it remains a challenge in many quantitative analysis methods in terms of accuracy and speed. Recently, deep learning nucleus segmentation methods have demonstrated to outperform previous intensity- or pattern-based methods. However, the heavy computation of deep learning provides impression of lagging response in real time and hampered the adoptability of these models in routine research. We developed and implemented NuKit a deep learning platform, which accelerates nucleus segmentation and provides prompt results to the users. NuKit platform consists of two deep learning models coupled with an interactive graphical user interface (GUI) to provide fast and automatic nucleus segmentation "on the fly". Both deep learning models provide complementary tasks in nucleus segmentation. The whole image segmentation model performs whole image nucleus whereas the click segmentation model supplements the nucleus segmentation with user-driven input to edits the segmented nuclei. We trained the NuKit whole image segmentation model on a large public training data set and tested its performance in seven independent public image data sets. The whole image segmentation model achieves average [Formula: see text] and [Formula: see text]. The outputs could be exported into different file formats, as well as provides seamless integration with other image analysis tools such as QuPath. NuKit can be executed on Windows, Mac, and Linux using personal computers.

核分割是组织病理图像分析管道的第一步,在准确性和速度方面仍然是许多定量分析方法的挑战。最近,深度学习核分割方法已被证明优于先前基于强度或模式的方法。然而,深度学习的计算量大,给人留下了实时响应滞后的印象,阻碍了这些模型在日常研究中的应用。我们开发并实现了NuKit深度学习平台,加速了核分割,并为用户提供了及时的结果。NuKit平台由两个深度学习模型和一个交互式图形用户界面(GUI)组成,提供快速和自动的“动态”核分割。这两种深度学习模型在核分割中提供了互补的任务。整个图像分割模型执行整个图像核,而点击分割模型通过用户驱动输入来补充核分割,以编辑所分割的核。我们在一个大型的公共训练数据集上训练了NuKit整体图像分割模型,并在7个独立的公共图像数据集上测试了它的性能。整个图像分割模型达到平均[公式:见文]和[公式:见文]。输出可以导出为不同的文件格式,并提供与其他图像分析工具(如QuPath)的无缝集成。NuKit可以在Windows、Mac和Linux的个人电脑上运行。
{"title":"NuKit: A deep learning platform for fast nucleus segmentation of histopathological images.","authors":"Ching-Nung Lin,&nbsp;Christine H Chung,&nbsp;Aik Choon Tan","doi":"10.1142/S0219720023500026","DOIUrl":"https://doi.org/10.1142/S0219720023500026","url":null,"abstract":"<p><p>Nucleus segmentation represents the initial step for histopathological image analysis pipelines, and it remains a challenge in many quantitative analysis methods in terms of accuracy and speed. Recently, deep learning nucleus segmentation methods have demonstrated to outperform previous intensity- or pattern-based methods. However, the heavy computation of deep learning provides impression of lagging response in real time and hampered the adoptability of these models in routine research. We developed and implemented NuKit a deep learning platform, which accelerates nucleus segmentation and provides prompt results to the users. NuKit platform consists of two deep learning models coupled with an interactive graphical user interface (GUI) to provide fast and automatic nucleus segmentation \"on the fly\". Both deep learning models provide complementary tasks in nucleus segmentation. The whole image segmentation model performs whole image nucleus whereas the click segmentation model supplements the nucleus segmentation with user-driven input to edits the segmented nuclei. We trained the NuKit whole image segmentation model on a large public training data set and tested its performance in seven independent public image data sets. The whole image segmentation model achieves average [Formula: see text] and [Formula: see text]. The outputs could be exported into different file formats, as well as provides seamless integration with other image analysis tools such as QuPath. NuKit can be executed on Windows, Mac, and Linux using personal computers.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ftp.ncbi.nlm.nih.gov/pub/pmc/oa_pdf/68/f9/nihms-1915365.PMC10362904.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9852066","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
In silico de novo drug design of a therapeutic peptide inhibitor against UBE2C in breast cancer. 乳腺癌治疗性UBE2C肽抑制剂的硅从头药物设计。
IF 1 4区 生物学 Q3 Computer Science Pub Date : 2023-02-01 DOI: 10.1142/S0219720022500299
Andrea Mae Añonuevo, Marineil Gomez, Lemmuel L Tayo

The World Health Organization (WHO) declared breast cancer (BC) as the most prevalent cancer in the world. With its prevalence and severity, there have been several breakthroughs in developing treatments for the disease. Targeted therapy treatments limit the damage done to healthy tissues. These targeted therapies are especially potent for luminal and HER-2 positive type breast cancer. However, for triple negative breast cancer (TNBC), the lack of defining biomarkers makes it hard to approach with targeted therapy methods. Protein-protein interactions (PPIs) have been studied as possible targets for drug action. However, small molecule drugs are not able to cover the entirety of the PPI binding interface. Peptides were found to be more suited to the large or flat PPI surfaces, in addition to their better pharmacokinetic properties. In this study, computational methods was used in order to verify whether peptide drug inhibitors are good drug candidates against the ubiquitin protein, UBE2C by conducting docking, MD and MMPBSA analyses. Results show that while the lead peptide, T20-M shows good potential as a peptide drug, its binding affinity towards UBE2C is not enough to overcome the natural UBE2C-ANAPC2 interaction. Further studies on modification of T20-M and the analysis of other peptide leads are recommended.

世界卫生组织(WHO)宣布乳腺癌(BC)是世界上最普遍的癌症。由于其普遍性和严重性,在开发治疗该疾病的方法方面取得了几项突破。靶向治疗限制了对健康组织的损害。这些靶向治疗对腔型和HER-2阳性型乳腺癌尤其有效。然而,对于三阴性乳腺癌(TNBC),缺乏明确的生物标志物使其难以采用靶向治疗方法。蛋白质-蛋白质相互作用(PPIs)已被研究作为药物作用的可能靶点。然而,小分子药物并不能覆盖整个PPI结合界面。除了具有更好的药代动力学性质外,肽更适合于大或平坦的PPI表面。本研究采用计算方法,通过对接、MD和MMPBSA分析,验证肽类药物抑制剂是否为抗泛素蛋白UBE2C的良好候选药物。结果表明,虽然先导肽T20-M作为肽药物具有良好的潜力,但其对UBE2C的结合亲和力不足以克服UBE2C- anapc2的天然相互作用。建议进一步研究T20-M的修饰和其他肽导联的分析。
{"title":"<i>In silico de novo</i> drug design of a therapeutic peptide inhibitor against UBE2C in breast cancer.","authors":"Andrea Mae Añonuevo,&nbsp;Marineil Gomez,&nbsp;Lemmuel L Tayo","doi":"10.1142/S0219720022500299","DOIUrl":"https://doi.org/10.1142/S0219720022500299","url":null,"abstract":"<p><p>The World Health Organization (WHO) declared breast cancer (BC) as the most prevalent cancer in the world. With its prevalence and severity, there have been several breakthroughs in developing treatments for the disease. Targeted therapy treatments limit the damage done to healthy tissues. These targeted therapies are especially potent for luminal and HER-2 positive type breast cancer. However, for triple negative breast cancer (TNBC), the lack of defining biomarkers makes it hard to approach with targeted therapy methods. Protein-protein interactions (PPIs) have been studied as possible targets for drug action. However, small molecule drugs are not able to cover the entirety of the PPI binding interface. Peptides were found to be more suited to the large or flat PPI surfaces, in addition to their better pharmacokinetic properties. In this study, computational methods was used in order to verify whether peptide drug inhibitors are good drug candidates against the ubiquitin protein, UBE2C by conducting docking, MD and MMPBSA analyses. Results show that while the lead peptide, T20-M shows good potential as a peptide drug, its binding affinity towards UBE2C is not enough to overcome the natural UBE2C-ANAPC2 interaction. Further studies on modification of T20-M and the analysis of other peptide leads are recommended.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9465490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
ThermalProGAN: A sequence-based thermally stable protein generator trained using unpaired data. ThermalProGAN:一个基于序列的热稳定蛋白质生成器,使用非配对数据进行训练。
IF 1 4区 生物学 Q3 Computer Science Pub Date : 2023-02-01 DOI: 10.1142/S0219720023500087
Hui-Ling Huang, Chong-Heng Weng, Torbjörn E M Nordling, Yi-Fan Liou

Motivation: The synthesis of proteins with novel desired properties is challenging but sought after by the industry and academia. The dominating approach is based on trial-and-error inducing point mutations, assisted by structural information or predictive models built with paired data that are difficult to collect. This study proposes a sequence-based unpaired-sample of novel protein inventor (SUNI) to build ThermalProGAN for generating thermally stable proteins based on sequence information.

Results: The ThermalProGAN can strongly mutate the input sequence with a median number of 32 residues. A known normal protein, 1RG0, was used to generate a thermally stable form by mutating 51 residues. After superimposing the two structures, high similarity is shown, indicating that the basic function would be conserved. Eighty four molecular dynamics simulation results of 1RG0 and the COVID-19 vaccine candidates with a total simulation time of 840[Formula: see text]ns indicate that the thermal stability increased.

Conclusion: This proof of concept demonstrated that transfer of a desired protein property from one set of proteins is feasible. Availability and implementation: The source code of ThermalProGAN can be freely accessed at https://github.com/markliou/ThermalProGAN/ with an MIT license. The website is https://thermalprogan.markliou.tw:433. Supplementary information: Supplementary data are available on Github.

动机:合成具有新特性的蛋白质具有挑战性,但受到工业界和学术界的追捧。主要的方法是基于试错诱导点突变,辅以结构信息或用难以收集的成对数据建立的预测模型。本研究提出了一种基于序列的新蛋白发明人(SUNI)的未配对样本来构建ThermalProGAN,用于基于序列信息生成热稳定蛋白。结果:ThermalProGAN可以对输入序列进行强突变,中位数为32个残基。一种已知的正常蛋白,1RG0,通过突变51个残基来产生一种热稳定的形式。两种结构叠加后显示出较高的相似性,表明基本函数是守恒的。1RG0和COVID-19候选疫苗的84个分子动力学模拟结果表明,总模拟时间为840[公式:见文]ns,热稳定性有所提高。结论:这一概念证明了从一组蛋白质转移所需的蛋白质特性是可行的。可用性和实现:ThermalProGAN的源代码可以通过MIT许可免费访问https://github.com/markliou/ThermalProGAN/。网址是https://thermalprogan.markliou.tw:433。补充信息:在Github上可以获得补充数据。
{"title":"ThermalProGAN: A sequence-based thermally stable protein generator trained using unpaired data.","authors":"Hui-Ling Huang,&nbsp;Chong-Heng Weng,&nbsp;Torbjörn E M Nordling,&nbsp;Yi-Fan Liou","doi":"10.1142/S0219720023500087","DOIUrl":"https://doi.org/10.1142/S0219720023500087","url":null,"abstract":"<p><strong>Motivation: </strong>The synthesis of proteins with novel desired properties is challenging but sought after by the industry and academia. The dominating approach is based on trial-and-error inducing point mutations, assisted by structural information or predictive models built with paired data that are difficult to collect. This study proposes a sequence-based unpaired-sample of novel protein inventor (SUNI) to build ThermalProGAN for generating thermally stable proteins based on sequence information.</p><p><strong>Results: </strong>The ThermalProGAN can strongly mutate the input sequence with a median number of 32 residues. A known normal protein, 1RG0, was used to generate a thermally stable form by mutating 51 residues. After superimposing the two structures, high similarity is shown, indicating that the basic function would be conserved. Eighty four molecular dynamics simulation results of 1RG0 and the COVID-19 vaccine candidates with a total simulation time of 840[Formula: see text]ns indicate that the thermal stability increased.</p><p><strong>Conclusion: </strong>This proof of concept demonstrated that transfer of a desired protein property from one set of proteins is feasible. <b>Availability and implementation:</b> The source code of ThermalProGAN can be freely accessed at https://github.com/markliou/ThermalProGAN/ with an MIT license. The website is https://thermalprogan.markliou.tw:433. <b>Supplementary information:</b> Supplementary data are available on Github.</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9466541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Evaluating network-based missing protein prediction using p-values, Bayes Factors, and probabilities. 使用p值、贝叶斯因子和概率评估基于网络的缺失蛋白预测。
IF 1 4区 生物学 Q3 Computer Science Pub Date : 2023-02-01 DOI: 10.1142/S0219720023500051
Wilson Wen Bin Goh, Weijia Kong, Limsoon Wong

Some prediction methods use probability to rank their predictions, while some other prediction methods do not rank their predictions and instead use [Formula: see text]-values to support their predictions. This disparity renders direct cross-comparison of these two kinds of methods difficult. In particular, approaches such as the Bayes Factor upper Bound (BFB) for [Formula: see text]-value conversion may not make correct assumptions for this kind of cross-comparisons. Here, using a well-established case study on renal cancer proteomics and in the context of missing protein prediction, we demonstrate how to compare these two kinds of prediction methods using two different strategies. The first strategy is based on false discovery rate (FDR) estimation, which does not make the same naïve assumptions as BFB conversions. The second strategy is a powerful approach which we colloquially call "home ground testing". Both strategies perform better than BFB conversions. Thus, we recommend comparing prediction methods by standardization to a common performance benchmark such as a global FDR. And where this is not possible, we recommend reciprocal "home ground testing".

一些预测方法使用概率对其预测进行排序,而其他一些预测方法不对其预测进行排序,而是使用[公式:见文本]-值来支持其预测。这种差异使得对这两种方法进行直接交叉比较变得困难。特别是,诸如[公式:见文本]值转换的贝叶斯因子上限(BFB)等方法可能无法对这种交叉比较做出正确的假设。在此,我们利用一个关于肾癌蛋白质组学的成熟案例研究,并在缺失蛋白预测的背景下,展示了如何使用两种不同的策略来比较这两种预测方法。第一种策略是基于错误发现率(FDR)估计,它不做与BFB转换相同的naïve假设。第二种策略是一种强大的方法,我们通俗地称之为“主场测试”。这两种策略都比BFB转换效果更好。因此,我们建议将标准化的预测方法与通用的性能基准(如全局FDR)进行比较。如果这是不可能的,我们建议互惠的“主场测试”。
{"title":"Evaluating network-based missing protein prediction using <i>p</i>-values, Bayes Factors, and probabilities.","authors":"Wilson Wen Bin Goh,&nbsp;Weijia Kong,&nbsp;Limsoon Wong","doi":"10.1142/S0219720023500051","DOIUrl":"https://doi.org/10.1142/S0219720023500051","url":null,"abstract":"<p><p>Some prediction methods use probability to rank their predictions, while some other prediction methods do not rank their predictions and instead use [Formula: see text]-values to support their predictions. This disparity renders direct cross-comparison of these two kinds of methods difficult. In particular, approaches such as the Bayes Factor upper Bound (BFB) for [Formula: see text]-value conversion may not make correct assumptions for this kind of cross-comparisons. Here, using a well-established case study on renal cancer proteomics and in the context of missing protein prediction, we demonstrate how to compare these two kinds of prediction methods using two different strategies. The first strategy is based on false discovery rate (FDR) estimation, which does not make the same naïve assumptions as BFB conversions. The second strategy is a powerful approach which we colloquially call \"home ground testing\". Both strategies perform better than BFB conversions. Thus, we recommend comparing prediction methods by standardization to a common performance benchmark such as a global FDR. And where this is not possible, we recommend reciprocal \"home ground testing\".</p>","PeriodicalId":48910,"journal":{"name":"Journal of Bioinformatics and Computational Biology","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9474482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
期刊
Journal of Bioinformatics and Computational Biology
全部 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