首页 > 最新文献

Bioinformatics advances最新文献

英文 中文
ProtFun: a protein function prediction model using graph attention networks with a protein large language model. ProtFun:一个蛋白质功能预测模型,使用带有蛋白质大语言模型的图注意网络。
IF 2.8 Q2 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-10-11 eCollection Date: 2025-01-01 DOI: 10.1093/bioadv/vbaf245
Muhammed Talo, Serdar Bozdag

Motivation: Understanding protein functions facilitates the identification of the underlying causes of many diseases and guides the research for discovering new therapeutic targets and medications. With the advancement of high throughput technologies, obtaining novel protein sequences has been a routine process. However, determining protein functions experimentally is cost- and labor-prohibitive. Therefore, it is crucial to develop computational methods for automatic protein function prediction.

Results: In this study, we propose a multimodal deep learning architecture called ProtFun to predict protein functions. ProtFun integrates protein large language model embeddings as node features in a protein family network. Employing graph attention networks on this protein family network, ProtFun learns protein embeddings, which are integrated with protein signature representations from InterPro to train a protein function prediction model. We evaluated our architecture using three benchmark datasets. Our results showed that our proposed approach outperformed current state-of-the-art methods for most cases. An ablation study also highlighted the importance of different components of ProtFun.

Availability and implementation: The data and source code of ProtFun is available at https://github.com/bozdaglab/ProtFun under Creative Commons Attribution Non Commercial 4.0 International Public License.

动机:了解蛋白质功能有助于识别许多疾病的潜在原因,并指导发现新的治疗靶点和药物的研究。随着高通量技术的发展,获得新的蛋白质序列已成为一个常规过程。然而,通过实验来确定蛋白质的功能是成本和劳动力的限制。因此,开发蛋白质功能自动预测的计算方法至关重要。结果:在这项研究中,我们提出了一个名为ProtFun的多模态深度学习架构来预测蛋白质功能。ProtFun将蛋白质大语言模型嵌入作为蛋白质家族网络的节点特征。ProtFun在该蛋白质家族网络上使用图关注网络,学习蛋白质嵌入,并将其与InterPro的蛋白质签名表示相结合,以训练蛋白质功能预测模型。我们使用三个基准数据集评估我们的架构。我们的结果表明,我们提出的方法在大多数情况下优于当前最先进的方法。消融研究也强调了ProtFun不同组成部分的重要性。可用性和实现:ProtFun的数据和源代码可在https://github.com/bozdaglab/ProtFun上获得,遵循知识共享署名非商业4.0国际公共许可协议。
{"title":"ProtFun: a protein function prediction model using graph attention networks with a protein large language model.","authors":"Muhammed Talo, Serdar Bozdag","doi":"10.1093/bioadv/vbaf245","DOIUrl":"10.1093/bioadv/vbaf245","url":null,"abstract":"<p><strong>Motivation: </strong>Understanding protein functions facilitates the identification of the underlying causes of many diseases and guides the research for discovering new therapeutic targets and medications. With the advancement of high throughput technologies, obtaining novel protein sequences has been a routine process. However, determining protein functions experimentally is cost- and labor-prohibitive. Therefore, it is crucial to develop computational methods for automatic protein function prediction.</p><p><strong>Results: </strong>In this study, we propose a multimodal deep learning architecture called ProtFun to predict protein functions. ProtFun integrates protein large language model embeddings as node features in a protein family network. Employing graph attention networks on this protein family network, ProtFun learns protein embeddings, which are integrated with protein signature representations from InterPro to train a protein function prediction model. We evaluated our architecture using three benchmark datasets. Our results showed that our proposed approach outperformed current state-of-the-art methods for most cases. An ablation study also highlighted the importance of different components of ProtFun.</p><p><strong>Availability and implementation: </strong>The data and source code of ProtFun is available at https://github.com/bozdaglab/ProtFun under Creative Commons Attribution Non Commercial 4.0 International Public License.</p>","PeriodicalId":72368,"journal":{"name":"Bioinformatics advances","volume":"5 1","pages":"vbaf245"},"PeriodicalIF":2.8,"publicationDate":"2025-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12571506/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145410839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Nextpie: a web-based reporting tool and database for reproducible nextflow pipelines. Nextpie:一个基于网络的报告工具和数据库,用于可复制的nextflow管道。
IF 2.8 Q2 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-10-10 eCollection Date: 2025-01-01 DOI: 10.1093/bioadv/vbaf252
Bishwa Ghimire, Nicholas Booth, Tapio Lönnberg, Tero Aittokallio

Motivation: High-throughput genomic data analysis consists of the inexorably intertwined inputs and outputs of a vast array of bioinformatic analysis tools. To guarantee streamlined and reproducible analyses, the often complex data analysis pipelines need to be run using workflow management tools. Nextflow is one popular tool commonly used to automate such pipelines. Nextflow records key pipeline data, such as the submission time, start time, completion time, CPU usage, memory usage, and disk usage for each task run. These data are stored in log files, often scattered across a file system. Therefore, aggregating information about resource usage critical for the optimization of Nextflow pipelines and improving reproducibility, as well as parsing and managing such log data, can quickly become cumbersome.

Results: Here, we present a web-based tool, Nextpie, which provides both a database and a reporting tool for Nextflow pipelines. Nextpie stores comprehensive resource usage information in a relational database, thus facilitating and accelerating the performance of a variety of data analyses and interactive visualizations, providing an easily comprehensible overview of a pipeline's resource usage.

Availability and implementation: The Nextpie source code, user documentation, an SQLite database with test data, and a Nextflow example pipeline are available at GitHub (https://github.com/bishwaG/Nextpie).

动机:高通量基因组数据分析由大量生物信息学分析工具不可避免地交织在一起的输入和输出组成。为了保证分析的流线型和可再现性,通常需要使用工作流管理工具来运行复杂的数据分析管道。Nextflow是一种常用的自动化管道工具。Nextflow记录每个任务运行时的关键管道数据,如提交时间、开始时间、完成时间、CPU使用情况、内存使用情况和磁盘使用情况。这些数据存储在日志文件中,通常分散在文件系统中。因此,对Nextflow管道优化和提高可重复性至关重要的资源使用信息的聚合,以及对此类日志数据的解析和管理,很快就会变得很麻烦。结果:在这里,我们提出了一个基于网络的工具Nextpie,它为Nextflow管道提供了数据库和报告工具。Nextpie在关系数据库中存储了全面的资源使用信息,从而促进和加速了各种数据分析和交互式可视化的性能,提供了一个易于理解的管道资源使用概况。可用性和实现:Nextpie源代码、用户文档、带有测试数据的SQLite数据库和Nextflow示例管道可在GitHub (https://github.com/bishwaG/Nextpie)获得。
{"title":"Nextpie: a web-based reporting tool and database for reproducible nextflow pipelines.","authors":"Bishwa Ghimire, Nicholas Booth, Tapio Lönnberg, Tero Aittokallio","doi":"10.1093/bioadv/vbaf252","DOIUrl":"10.1093/bioadv/vbaf252","url":null,"abstract":"<p><strong>Motivation: </strong>High-throughput genomic data analysis consists of the inexorably intertwined inputs and outputs of a vast array of bioinformatic analysis tools. To guarantee streamlined and reproducible analyses, the often complex data analysis pipelines need to be run using workflow management tools. Nextflow is one popular tool commonly used to automate such pipelines. Nextflow records key pipeline data, such as the submission time, start time, completion time, CPU usage, memory usage, and disk usage for each task run. These data are stored in log files, often scattered across a file system. Therefore, aggregating information about resource usage critical for the optimization of Nextflow pipelines and improving reproducibility, as well as parsing and managing such log data, can quickly become cumbersome.</p><p><strong>Results: </strong>Here, we present a web-based tool, Nextpie, which provides both a database and a reporting tool for Nextflow pipelines. Nextpie stores comprehensive resource usage information in a relational database, thus facilitating and accelerating the performance of a variety of data analyses and interactive visualizations, providing an easily comprehensible overview of a pipeline's resource usage.</p><p><strong>Availability and implementation: </strong>The Nextpie source code, user documentation, an SQLite database with test data, and a Nextflow example pipeline are available at GitHub (https://github.com/bishwaG/Nextpie).</p>","PeriodicalId":72368,"journal":{"name":"Bioinformatics advances","volume":"5 1","pages":"vbaf252"},"PeriodicalIF":2.8,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12574971/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145433163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
GeoGenIE: a deep learning approach to predict geographic provenance of biodiversity samples from genomic SNPs. GeoGenIE:一种深度学习方法,用于从基因组snp中预测生物多样性样本的地理来源。
IF 2.8 Q2 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-10-09 eCollection Date: 2025-01-01 DOI: 10.1093/bioadv/vbaf250
Bradley T Martin, Zachery D Zbinden, Michael E Douglas, Marlis R Douglas, Tyler K Chafin

Motivation: Determining geographic origin of samples is a common objective in wildlife management, forensics, and conservation. Current methods often assume evolutionary models or require extensive reference datasets, which are costly and difficult to develop, that perform poorly with uneven or biased sampling. Supervised deep learning offers a promising alternative by learning complex patterns without prior model specifications. Combined with novel geo-genetic data augmentation and preprocessing techniques, it can reduce reference panel demands and improve performance across diverse sampling schemes, broadening accurate provenance determination to more study systems.

Results: We present GeoGenIE, an open-source software package powered by PyTorch for geographic provenance prediction from genomic data. GeoGenIE implements a multilayer perceptron architecture within an automated hyperparameter tuning framework, incorporating preprocessing, geo-genetic outlier detection, and data augmentation to improve accuracy in sparsely sampled regions. Benchmarking against a comparable approach with White-tailed deer (Odocoileus virginianus) double digest restriction-site associated DNA sequencing data, GeoGenIE achieved substantially improved geolocation accuracy with less spatial bias using a smaller SNP panel. Gains were most evident in undersampled regions, underscoring effectiveness under challenging conditions. Its parallelized execution also produced fast runtimes, promoting its application to large datasets.

Availability and implementation: Open-source at https://github.com/btmartin721/geogenie and https://pypi.org/project/GeoGenIE/.

动机:确定样本的地理来源是野生动物管理、法医学和保护的共同目标。目前的方法通常假设进化模型或需要广泛的参考数据集,这些数据集成本高昂且难以开发,并且在不均匀或有偏差的采样中表现不佳。监督深度学习提供了一种很有前途的替代方案,即在没有事先模型规范的情况下学习复杂模式。结合新的地球成因数据增强和预处理技术,可以减少参考面板的需求,提高不同采样方案的性能,将准确的物源确定扩展到更多的研究系统。结果:我们提出了GeoGenIE,一个由PyTorch驱动的开源软件包,用于从基因组数据中预测地理来源。GeoGenIE在自动超参数调优框架中实现了多层感知器架构,结合了预处理、地源异常值检测和数据增强,以提高稀疏采样区域的准确性。与白尾鹿(Odocoileus virginianus)双消化限制性位点相关DNA测序数据的类似方法相比,GeoGenIE使用较小的SNP面板实现了显著提高的地理定位精度和较少的空间偏差。收益在样本不足的地区最为明显,强调了在具有挑战性的条件下的有效性。它的并行执行也产生了快速的运行时间,将其应用于大型数据集。可用性和实现:在https://github.com/btmartin721/geogenie和https://pypi.org/project/GeoGenIE/上开放源代码。
{"title":"GeoGenIE: a deep learning approach to predict geographic provenance of biodiversity samples from genomic SNPs.","authors":"Bradley T Martin, Zachery D Zbinden, Michael E Douglas, Marlis R Douglas, Tyler K Chafin","doi":"10.1093/bioadv/vbaf250","DOIUrl":"10.1093/bioadv/vbaf250","url":null,"abstract":"<p><strong>Motivation: </strong>Determining geographic origin of samples is a common objective in wildlife management, forensics, and conservation. Current methods often assume evolutionary models or require extensive reference datasets, which are costly and difficult to develop, that perform poorly with uneven or biased sampling. Supervised deep learning offers a promising alternative by learning complex patterns without prior model specifications. Combined with novel geo-genetic data augmentation and preprocessing techniques, it can reduce reference panel demands and improve performance across diverse sampling schemes, broadening accurate provenance determination to more study systems.</p><p><strong>Results: </strong>We present GeoGenIE, an open-source software package powered by PyTorch for geographic provenance prediction from genomic data. GeoGenIE implements a multilayer perceptron architecture within an automated hyperparameter tuning framework, incorporating preprocessing, geo-genetic outlier detection, and data augmentation to improve accuracy in sparsely sampled regions. Benchmarking against a comparable approach with White-tailed deer (<i>Odocoileus virginianus</i>) double digest restriction-site associated DNA sequencing data, GeoGenIE achieved substantially improved geolocation accuracy with less spatial bias using a smaller SNP panel. Gains were most evident in undersampled regions, underscoring effectiveness under challenging conditions. Its parallelized execution also produced fast runtimes, promoting its application to large datasets.</p><p><strong>Availability and implementation: </strong>Open-source at https://github.com/btmartin721/geogenie and https://pypi.org/project/GeoGenIE/.</p>","PeriodicalId":72368,"journal":{"name":"Bioinformatics advances","volume":"5 1","pages":"vbaf250"},"PeriodicalIF":2.8,"publicationDate":"2025-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12596584/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145491082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
OncotreeVIS-an interactive graphical user interface for visualizing mutation tree cohorts. oncotreevis是一个用于可视化突变树队列的交互式图形用户界面。
IF 2.8 Q2 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-10-09 eCollection Date: 2025-01-01 DOI: 10.1093/bioadv/vbaf247
Monica-Andreea Baciu-Drăgan, Niko Beerenwinkel

Summary: In recent years, developments in single-cell next-generation sequencing technology and computational methodology have made it possible to reconstruct, with increasing precision, the evolutionary history of tumors and their cell phylogenies, represented as mutation trees. Many mutation tree inference tools exist, but they do not support detailed visual tree inspection, nor tree comparisons or analysis at the cohort level, an important task in computational oncology. We developed oncotreeVIS, an interactive graphical user interface for visualizing mutation tree cohorts and tree posterior distributions obtained from mutation tree inference tools. OncotreeVIS can display mutation trees that encode single or joint genetic events, such as point mutations and copy number changes, and highlight matching subclones, conserved trajectories and drug-gene interactions at the cohort level. OncotreeVIS facilitates the visual inspection of mutation tree clusters and pairwise tree distances. It is available both as a JavaScript library that can be used locally or as a web application that can be accessed online. It includes seven default datasets of public mutation tree cohorts for visualization, while new mutation trees are provided in a predefined JSON format.

Availability and implementation: https://cbg-ethz.github.io/oncotreeVIS.

摘要:近年来,单细胞下一代测序技术和计算方法的发展使得重建肿瘤及其细胞系统发育的进化史成为可能,其精度越来越高,以突变树的形式表示。存在许多突变树推断工具,但它们不支持详细的视觉树检查,也不支持队列水平的树比较或分析,这是计算肿瘤学的一项重要任务。我们开发了oncotreeVIS,这是一个交互式图形用户界面,用于可视化突变树队列和从突变树推断工具获得的树后验分布。OncotreeVIS可以显示编码单个或联合遗传事件的突变树,如点突变和拷贝数变化,并在队列水平上突出匹配的亚克隆、保守轨迹和药物-基因相互作用。OncotreeVIS有助于突变树簇和成对树距离的目视检查。它既可以作为本地使用的JavaScript库,也可以作为可以在线访问的web应用程序。它包括用于可视化的公共突变树队列的七个默认数据集,同时以预定义的JSON格式提供新的突变树。可用性和实现:https://cbg-ethz.github.io/oncotreeVIS。
{"title":"OncotreeVIS-an interactive graphical user interface for visualizing mutation tree cohorts.","authors":"Monica-Andreea Baciu-Drăgan, Niko Beerenwinkel","doi":"10.1093/bioadv/vbaf247","DOIUrl":"10.1093/bioadv/vbaf247","url":null,"abstract":"<p><strong>Summary: </strong>In recent years, developments in single-cell next-generation sequencing technology and computational methodology have made it possible to reconstruct, with increasing precision, the evolutionary history of tumors and their cell phylogenies, represented as mutation trees. Many mutation tree inference tools exist, but they do not support detailed visual tree inspection, nor tree comparisons or analysis at the cohort level, an important task in computational oncology. We developed oncotreeVIS, an interactive graphical user interface for visualizing mutation tree cohorts and tree posterior distributions obtained from mutation tree inference tools. OncotreeVIS can display mutation trees that encode single or joint genetic events, such as point mutations and copy number changes, and highlight matching subclones, conserved trajectories and drug-gene interactions at the cohort level. OncotreeVIS facilitates the visual inspection of mutation tree clusters and pairwise tree distances. It is available both as a JavaScript library that can be used locally or as a web application that can be accessed online. It includes seven default datasets of public mutation tree cohorts for visualization, while new mutation trees are provided in a predefined JSON format.</p><p><strong>Availability and implementation: </strong>https://cbg-ethz.github.io/oncotreeVIS.</p>","PeriodicalId":72368,"journal":{"name":"Bioinformatics advances","volume":"5 1","pages":"vbaf247"},"PeriodicalIF":2.8,"publicationDate":"2025-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12596139/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145483913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
KinMethyl: robust methylation detection in prokaryotic SMRT sequencing via kinetic signal modeling and deep feature integration. KinMethyl:通过动力学信号建模和深度特征集成在原核生物SMRT测序中进行稳健的甲基化检测。
IF 2.8 Q2 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-10-09 eCollection Date: 2025-01-01 DOI: 10.1093/bioadv/vbaf249
Jichen Zhang, Yutaka Saito

Motivation: Accurate detection of 5-methylcytosine (5mC) from PacBio single-molecule real-time (SMRT) sequencing remains challenging in prokaryotes due to weak kinetic signals and motif diversity.

Results: Here, we present KinMethyl, a generalizable deep learning framework that integrates sequence and kinetic signals to improve methylation detection across diverse bacterial genomes. Central to our approach is a regression model trained on whole-genome amplified samples to estimate the expected kinetics signals of unmethylated sequences. These predicted signals are incorporated into a downstream classifier to enhance the performance under low signal-to-noise conditions. KinMethyl outperforms existing tools such as kineticstools and ccsmeth across multiple bacterial species, methylation motifs, and modification types not only 5mC but also N6-methyladenine (6 mA) and N4-methylcytosine (4mC). In 5mC classification, KinMethyl improved the AUC by up to 0.20 compared to the existing method (0.6165 to 0.8190) with statistical significance (DeLong's test, P < 1e-10). The improvements were consistently observed in cross-species evaluations as well as different sequencing platforms including RSII and Sequel. This work highlights the utility of kinetic signal modeling and feature integration for robust and motif-independent methylation analysis in prokaryotic epigenomics.

Availability and implementation: The source code is available at https://github.com/ZhangBio/KinMethyl.

动机:在原核生物中,由于动力学信号弱和基序多样性,从PacBio单分子实时(SMRT)测序中准确检测5-甲基胞嘧啶(5mC)仍然具有挑战性。在这里,我们提出了KinMethyl,这是一个可推广的深度学习框架,集成了序列和动力学信号,以提高跨不同细菌基因组的甲基化检测。我们方法的核心是在全基因组扩增样本上训练的回归模型,以估计未甲基化序列的预期动力学信号。这些预测信号被纳入下游分类器,以提高在低信噪比条件下的性能。KinMethyl在多种细菌种类、甲基化基元和修饰类型(不仅是5mC,还有n6 -甲基腺嘌呤(6ma)和n4 -甲基胞嘧啶(4mC))上优于现有的工具,如kineticols和ccsmeth。在5mC分类中,KinMethyl的AUC比现有方法(0.6165 ~ 0.8190)提高了0.20,且具有统计学意义(DeLong的测试,P可用性与实现:源代码可在https://github.com/ZhangBio/KinMethyl上获得)。
{"title":"KinMethyl: robust methylation detection in prokaryotic SMRT sequencing via kinetic signal modeling and deep feature integration.","authors":"Jichen Zhang, Yutaka Saito","doi":"10.1093/bioadv/vbaf249","DOIUrl":"10.1093/bioadv/vbaf249","url":null,"abstract":"<p><strong>Motivation: </strong>Accurate detection of 5-methylcytosine (5mC) from PacBio single-molecule real-time (SMRT) sequencing remains challenging in prokaryotes due to weak kinetic signals and motif diversity.</p><p><strong>Results: </strong>Here, we present KinMethyl, a generalizable deep learning framework that integrates sequence and kinetic signals to improve methylation detection across diverse bacterial genomes. Central to our approach is a regression model trained on whole-genome amplified samples to estimate the expected kinetics signals of unmethylated sequences. These predicted signals are incorporated into a downstream classifier to enhance the performance under low signal-to-noise conditions. KinMethyl outperforms existing tools such as kineticstools and ccsmeth across multiple bacterial species, methylation motifs, and modification types not only 5mC but also N6-methyladenine (6 mA) and N4-methylcytosine (4mC). In 5mC classification, KinMethyl improved the AUC by up to 0.20 compared to the existing method (0.6165 to 0.8190) with statistical significance (DeLong's test, <i>P </i>< 1e-10). The improvements were consistently observed in cross-species evaluations as well as different sequencing platforms including RSII and Sequel. This work highlights the utility of kinetic signal modeling and feature integration for robust and motif-independent methylation analysis in prokaryotic epigenomics.</p><p><strong>Availability and implementation: </strong>The source code is available at https://github.com/ZhangBio/KinMethyl.</p>","PeriodicalId":72368,"journal":{"name":"Bioinformatics advances","volume":"5 1","pages":"vbaf249"},"PeriodicalIF":2.8,"publicationDate":"2025-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12552093/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145379771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Advances and challenges in understanding evolution through genome comparison: meeting report of the European Molecular Biology Organization (EMBO) lecture course "Evolutionary and Comparative Genomics". 通过基因组比较理解进化的进展与挑战:欧洲分子生物学组织(EMBO)讲座课程“进化与比较基因组学”会议报告。
IF 2.8 Q2 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-10-08 eCollection Date: 2025-01-01 DOI: 10.1093/bioadv/vbaf223
Athina Gavriilidou, Alexandros Stamatakis, Anne Kupczok, Iliana Bista, Chris D Jiggins, Rosa Fernández, Eirini Skourtanioti, Grigoris Amoutzias, Daniela Delneri, Nikos Kyrpides, Christoforos Nikolaou, Alexandros A Pittis, Tereza Manousaki, Nikolaos Vakirlis

This perspective outlines emerging trends, key challenges, and future opportunities in evolutionary and comparative genomics. Our starting point are the topics presented at the 2024 EMBO Early Career Lecture Course "Evolutionary and Comparative Genomics", which highlighted recent conceptual and methodological advances in areas ranging from microbial pangenomes, protein evolution, hybrid speciation, novel gene origination and transposon dynamics. Here, we emphasize the role of computational and molecular approaches, providing a forward-looking view on where the field is headed and how it is being reshaped by new technologies and approaches.

这一观点概述了进化和比较基因组学的新趋势、主要挑战和未来机遇。我们的起点是在2024年EMBO早期职业讲座课程“进化和比较基因组学”中提出的主题,该课程突出了微生物泛基因组学,蛋白质进化,杂交物种形成,新基因起源和转座子动力学等领域的最新概念和方法进展。在这里,我们强调计算和分子方法的作用,为该领域的发展方向以及新技术和新方法如何重塑该领域提供前瞻性的观点。
{"title":"Advances and challenges in understanding evolution through genome comparison: meeting report of the European Molecular Biology Organization (EMBO) lecture course \"Evolutionary and Comparative Genomics\".","authors":"Athina Gavriilidou, Alexandros Stamatakis, Anne Kupczok, Iliana Bista, Chris D Jiggins, Rosa Fernández, Eirini Skourtanioti, Grigoris Amoutzias, Daniela Delneri, Nikos Kyrpides, Christoforos Nikolaou, Alexandros A Pittis, Tereza Manousaki, Nikolaos Vakirlis","doi":"10.1093/bioadv/vbaf223","DOIUrl":"10.1093/bioadv/vbaf223","url":null,"abstract":"<p><p>This perspective outlines emerging trends, key challenges, and future opportunities in evolutionary and comparative genomics. Our starting point are the topics presented at the 2024 EMBO Early Career Lecture Course \"Evolutionary and Comparative Genomics\", which highlighted recent conceptual and methodological advances in areas ranging from microbial pangenomes, protein evolution, hybrid speciation, novel gene origination and transposon dynamics. Here, we emphasize the role of computational and molecular approaches, providing a forward-looking view on where the field is headed and how it is being reshaped by new technologies and approaches.</p>","PeriodicalId":72368,"journal":{"name":"Bioinformatics advances","volume":"5 1","pages":"vbaf223"},"PeriodicalIF":2.8,"publicationDate":"2025-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12571500/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145410922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Retention order prediction of peptides containing non-proteinogenic amino acids. 含有非蛋白质原性氨基酸的肽的保留顺序预测。
IF 2.8 Q2 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-10-08 eCollection Date: 2025-01-01 DOI: 10.1093/bioadv/vbaf246
Shohei Nakamukai, Eisuke Hayakawa, Tetsuya Mori, Yuji Ise, Masami Yokota Hirai, Masanori Arita

Motivation: Peptides containing non-proteinogenic amino acids (PNPAs) are promising targets in drug development for their unique pharmacological properties. The lack of their mass spectra or retention data has been hindering PNPA research, where accurate assessment of their retention time in chromatography is crucial for identifying structures and characterizing functions. Conventional methods are often ineffective due to limited amount of data. This study aims to predict their retention order, not absolute time, from structures by using data from peptides and small molecules. This approach can advance natural product identification and drug research.

Results: Our model uses the Ranking Support Vector Machine, and successfully predicted the retention order of PNPA with an accuracy of over 0.9. Counting fingerprints and MIX fingerprint, which combines four types of fingerprints, were used as explanatory variables. To suppress the multi-collinearity, principal component analysis was applied to reduce spurious fingerprints. SHAP value analysis revealed that one component, derived from methyl groups, contributed most for the prediction. Overall, order prediction can effectively find candidate compounds from LC/MS data from non-conventional biological extracts.

Availability and implementation: https://github.com/ShoheiNakamukai/RO_prediction_of_PNPA/tree/main.

动机:含有非蛋白原性氨基酸(PNPAs)的肽因其独特的药理特性而成为药物开发的有希望的靶点。缺乏它们的质谱或保留数据一直阻碍着PNPA的研究,在色谱中准确评估它们的保留时间对于识别结构和表征功能至关重要。由于数据量有限,传统方法往往无效。本研究的目的是利用多肽和小分子的数据,从结构上预测它们的保留顺序,而不是绝对时间。这种方法可以促进天然产物鉴定和药物研究。结果:我们的模型使用排名支持向量机,成功预测了PNPA的保留顺序,准确率超过0.9。以计数指纹和混合指纹作为解释变量。为了抑制多重共线性,采用主成分分析方法减少指纹伪造。SHAP值分析显示,来自甲基的一个组分对预测贡献最大。总的来说,序次预测可以有效地从非常规生物提取物的LC/MS数据中发现候选化合物。可用性和实现:https://github.com/ShoheiNakamukai/RO_prediction_of_PNPA/tree/main。
{"title":"Retention order prediction of peptides containing non-proteinogenic amino acids.","authors":"Shohei Nakamukai, Eisuke Hayakawa, Tetsuya Mori, Yuji Ise, Masami Yokota Hirai, Masanori Arita","doi":"10.1093/bioadv/vbaf246","DOIUrl":"10.1093/bioadv/vbaf246","url":null,"abstract":"<p><strong>Motivation: </strong>Peptides containing non-proteinogenic amino acids (PNPAs) are promising targets in drug development for their unique pharmacological properties. The lack of their mass spectra or retention data has been hindering PNPA research, where accurate assessment of their retention time in chromatography is crucial for identifying structures and characterizing functions. Conventional methods are often ineffective due to limited amount of data. This study aims to predict their retention order, not absolute time, from structures by using data from peptides and small molecules. This approach can advance natural product identification and drug research.</p><p><strong>Results: </strong>Our model uses the Ranking Support Vector Machine, and successfully predicted the retention order of PNPA with an accuracy of over 0.9. Counting fingerprints and MIX fingerprint, which combines four types of fingerprints, were used as explanatory variables. To suppress the multi-collinearity, principal component analysis was applied to reduce spurious fingerprints. SHAP value analysis revealed that one component, derived from methyl groups, contributed most for the prediction. Overall, order prediction can effectively find candidate compounds from LC/MS data from non-conventional biological extracts.</p><p><strong>Availability and implementation: </strong>https://github.com/ShoheiNakamukai/RO_prediction_of_PNPA/tree/main.</p>","PeriodicalId":72368,"journal":{"name":"Bioinformatics advances","volume":"5 1","pages":"vbaf246"},"PeriodicalIF":2.8,"publicationDate":"2025-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12643230/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145607725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
FastGA: fast genome alignment. FastGA:快速基因组比对。
IF 2.8 Q2 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-10-06 eCollection Date: 2025-01-01 DOI: 10.1093/bioadv/vbaf238
Gene Myers, Richard Durbin, Chenxi Zhou

Motivation: FastGA finds alignments between two genome sequences more than an order of magnitude faster than previous methods that have comparable sensitivity. Its speed is due to (i) a fully cache-local architecture involving only MSD radix sorts and merges, (ii) an algorithm for finding adaptive seed hits in a linear merge of sorted k-mer tables, and (iii) a variant of the Myers adaptive wave algorithm to find alignments around a chain of seed hits. It further stores alignments in a fraction of the space of a conventional CIGAR string using a trace-point encoding and our ONEcode data system introduced here.

Results: For example, two 2 Gbp bat genomes are compared in 2.1 min with eight threads on an Apple laptop using 5.7 GB of memory and producing 1.05 million alignments covering 60% of each genome. Our ALN format file occupies 66 MB and in just 6 s can be converted to a standard 1.03 GB PAF file.

Availability and implementation: FastGA is freely available at GitHub: http://www.github.com/thegenemyers/FASTGA along with utilities for viewing inputs, intermediates, and outputs and transforming ALN files to PSL or PAF with or without CIGAR strings and common formats. There is also a utility to chain FastGA's alignments and display them in a dot-plot view in PostScript files.

动机:FastGA发现两个基因组序列之间的比对比以前具有相当灵敏度的方法快一个数量级以上。它的速度是由于(i)完全缓存本地架构只涉及MSD基数排序和合并,(ii)在排序k-mer表的线性合并中寻找自适应种子命中的算法,以及(iii) Myers自适应波算法的变体,以查找种子命中链周围的对齐。它进一步使用跟踪点编码和这里介绍的ONEcode数据系统在传统雪茄字符串的一小部分空间中存储对齐。结果:例如,在一台使用5.7 GB内存的苹果笔记本电脑上,用8个线程在2.1分钟内比较了两个2 GB的蝙蝠基因组,产生了105万个比对,覆盖了每个基因组的60%。我们的ALN格式文件占用66 MB,只需6秒就可以转换为标准的1.03 GB PAF文件。可用性和实现:FastGA可以在GitHub上免费获得:http://www.github.com/thegenemyers/FASTGA以及用于查看输入,中间和输出以及将ALN文件转换为PSL或PAF(带或不带雪茄字符串和通用格式)的实用程序。还有一个实用程序可以链接FastGA的对齐并在PostScript文件中的点图视图中显示它们。
{"title":"FastGA: fast genome alignment.","authors":"Gene Myers, Richard Durbin, Chenxi Zhou","doi":"10.1093/bioadv/vbaf238","DOIUrl":"10.1093/bioadv/vbaf238","url":null,"abstract":"<p><strong>Motivation: </strong>FastGA finds alignments between two genome sequences more than an order of magnitude faster than previous methods that have comparable sensitivity. Its speed is due to (i) a fully <i>cache-local</i> architecture involving only <i>MSD radix sorts</i> and merges, (ii) an algorithm for finding <i>adaptive seed</i> hits in a linear merge of sorted k-mer tables, and (iii) a variant of the Myers <i>adaptive wave</i> algorithm to find alignments around a chain of seed hits. It further stores alignments in a fraction of the space of a conventional CIGAR string using a <i>trace-point</i> encoding and our ONEcode data system introduced here.</p><p><strong>Results: </strong>For example, two 2 Gbp bat genomes are compared in 2.1 min with eight threads on an Apple laptop using 5.7 GB of memory and producing 1.05 million alignments covering 60% of each genome. Our ALN format file occupies 66 MB and in just 6 s can be converted to a standard 1.03 GB PAF file.</p><p><strong>Availability and implementation: </strong>FastGA is freely available at GitHub: http://www.github.com/thegenemyers/FASTGA along with utilities for viewing inputs, intermediates, and outputs and transforming ALN files to PSL or PAF with or without CIGAR strings and common formats. There is also a utility to chain FastGA's alignments and display them in a dot-plot view in PostScript files.</p>","PeriodicalId":72368,"journal":{"name":"Bioinformatics advances","volume":"5 1","pages":"vbaf238"},"PeriodicalIF":2.8,"publicationDate":"2025-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12624442/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145558089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Synthetic data-driven AI approach for fetal chromosomal aneuploidies detection. 胎儿染色体非整倍体检测的人工智能方法。
IF 2.8 Q2 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-10-06 eCollection Date: 2025-01-01 DOI: 10.1093/bioadv/vbaf244
Changhoe Hwang, Krishna Prasad Adhikari, Gyeongin Oh, Sunshin Kim

Motivation: A major limitation in the development of fetal chromosomal aneuploidy detection technologies lies in the scarcity of real positive data. To address this issue, we propose a novel methodology to generate virtually unlimited synthetic negative and positive datasets with >99.9% similarity to real data, enabling accurate detection of both autosomal chromosome aneuploidies (ACA) and sex chromosome aneuploidies (SCA). In terms of methods, blood samples from 15 999 pregnant women were analyzed, including 186 clinically confirmed positive cases. Using 701 high-confidence negatives as a reference, we designed algorithms for synthetic data generation. For negatives, multiple real FASTQ files were randomly merged, and fetal fraction (FF) was recalculated to reflect biological variability. For positives, chromosome-specific read counts were adjusted using numerical equations: ACAs were simulated by increasing the target chromosome reads, and SCAs were generated by adjusting sex chromosome read counts using regression models that account for FF and total read count, with the GC distribution preserved. Logistic regression (LR) models were then trained using features including FF, GC content, and chromosomal read counts. Performance was evaluated against conventional z-score methods and real positive cases.

Results: From high-confidence negative samples, ∼160 000 synthetic training datasets were generated for major ACA and ∼35 000 for each SCA. While z-score methods showed declines in sensitivity (T13) or positive predictive value (PPV) (T18, T21) under low prevalence, LR models consistently maintained 100% sensitivity and PPV for ACAs, achieved ≥99.6% sensitivity and PPV for SCAs on synthetic evaluation datasets, and demonstrated 100% accuracy on real positive samples.

Availability and implementation: All formulas and procedures required for synthetic data generation and model development are implemented in Python and are available at https://github.com/genomecare-rnd/SyntheticData-NIPT.

动机:胎儿染色体非整倍体检测技术发展的一个主要限制在于缺乏真正的阳性数据。为了解决这个问题,我们提出了一种新的方法来生成几乎无限的合成阴性和阳性数据集,与真实数据的相似性为99.9%,能够准确检测常染色体非整倍体(ACA)和性染色体非整倍体(SCA)。方法分析15999例孕妇血样,其中临床确诊阳性186例。以701个高置信度阴性为参考,设计了合成数据生成算法。对于阴性,多个真实FASTQ文件随机合并,并重新计算胎儿分数(FF)以反映生物学变异性。对于阳性,使用数值方程调整染色体特异性读取计数:通过增加目标染色体读取来模拟ACAs,通过使用考虑FF和总读取计数的回归模型调整性染色体读取计数来生成sca,并保留GC分布。然后使用FF、GC含量和染色体读取计数等特征训练逻辑回归(LR)模型。根据传统的z-score方法和真实阳性案例对性能进行评估。结果:从高置信度的阴性样本中,为主要ACA生成了~ 16000个合成训练数据集,为每个SCA生成了~ 35000个合成训练数据集。虽然z-score方法在低患病率情况下的敏感性(T13)或阳性预测值(PPV) (T18, T21)有所下降,但LR模型对ACAs始终保持100%的敏感性和PPV,在合成评估数据集上对sca的敏感性和PPV达到≥99.6%,对真实阳性样本的准确性为100%。可用性和实现:合成数据生成和模型开发所需的所有公式和过程都是用Python实现的,可以在https://github.com/genomecare-rnd/SyntheticData-NIPT上获得。
{"title":"Synthetic data-driven AI approach for fetal chromosomal aneuploidies detection.","authors":"Changhoe Hwang, Krishna Prasad Adhikari, Gyeongin Oh, Sunshin Kim","doi":"10.1093/bioadv/vbaf244","DOIUrl":"10.1093/bioadv/vbaf244","url":null,"abstract":"<p><strong>Motivation: </strong>A major limitation in the development of fetal chromosomal aneuploidy detection technologies lies in the scarcity of real positive data. To address this issue, we propose a novel methodology to generate virtually unlimited synthetic negative and positive datasets with >99.9% similarity to real data, enabling accurate detection of both autosomal chromosome aneuploidies (ACA) and sex chromosome aneuploidies (SCA). In terms of methods, blood samples from 15 999 pregnant women were analyzed, including 186 clinically confirmed positive cases. Using 701 high-confidence negatives as a reference, we designed algorithms for synthetic data generation. For negatives, multiple real FASTQ files were randomly merged, and fetal fraction (FF) was recalculated to reflect biological variability. For positives, chromosome-specific read counts were adjusted using numerical equations: ACAs were simulated by increasing the target chromosome reads, and SCAs were generated by adjusting sex chromosome read counts using regression models that account for FF and total read count, with the GC distribution preserved. Logistic regression (LR) models were then trained using features including FF, GC content, and chromosomal read counts. Performance was evaluated against conventional <i>z</i>-score methods and real positive cases.</p><p><strong>Results: </strong>From high-confidence negative samples, ∼160 000 synthetic training datasets were generated for major ACA and ∼35 000 for each SCA. While <i>z</i>-score methods showed declines in sensitivity (T13) or positive predictive value (PPV) (T18, T21) under low prevalence, LR models consistently maintained 100% sensitivity and PPV for ACAs, achieved ≥99.6% sensitivity and PPV for SCAs on synthetic evaluation datasets, and demonstrated 100% accuracy on real positive samples.</p><p><strong>Availability and implementation: </strong>All formulas and procedures required for synthetic data generation and model development are implemented in Python and are available at https://github.com/genomecare-rnd/SyntheticData-NIPT.</p>","PeriodicalId":72368,"journal":{"name":"Bioinformatics advances","volume":"5 1","pages":"vbaf244"},"PeriodicalIF":2.8,"publicationDate":"2025-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12557104/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145395710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Craft: a machine learning approach to dengue subtyping. 工艺:一种登革热亚型的机器学习方法。
IF 2.8 Q2 MATHEMATICAL & COMPUTATIONAL BIOLOGY Pub Date : 2025-10-06 eCollection Date: 2025-01-01 DOI: 10.1093/bioadv/vbaf224
Daniel J van Zyl, Marcel Dunaiski, Houriiyah Tegally, Cheryl Baxter, Tulio de Oliveira, Joicymara S Xavier

Motivation: The dengue virus poses a major global health threat, with nearly 390 million infections annually. A recently proposed hierarchical dengue nomenclature system enhances spatial resolution by defining major and minor lineages within genotypes, aiding efforts to track viral evolution. While current subtyping tools-Genome Detective, GLUE, and Nextclade-rely on computationally intensive sequence alignment and phylogenetic inference, machine learning presents a promising alternative for achieving accurate and rapid classification.

Results: We present Craft (Chaos Random Forest), a machine learning framework for dengue subtyping. We demonstrate that Craft is capable of faster classification speeds while matching or surpassing the accuracy of existing tools. Craft achieves 99.5% accuracy on a hold-out test set formed from a consensus of predictions from existing tools and processes over 140 000 sequences per minute. Notably, Craft maintains remarkably high accuracy even when classifying sequence segments as short as 700 nucleotides.

Availability and implementation: Source code is available at: https://github.com/INFORM-Africa/AI-viral-lineage-classification.

动机:登革热病毒对全球健康构成重大威胁,每年有近3.9亿人感染。最近提出的分级登革热命名系统通过定义基因型中的主要和次要谱系来增强空间分辨率,有助于追踪病毒进化。虽然目前的亚型工具-基因组侦探,GLUE和nextcade -依赖于计算密集的序列排列和系统发育推断,但机器学习为实现准确和快速分类提供了一个有希望的替代方案。结果:我们提出Craft(混沌随机森林),一个登革热亚型的机器学习框架。我们证明Craft能够更快的分类速度,同时匹配或超过现有工具的准确性。工艺达到99.5%的准确度,从现有的工具和流程的预测共识形成的测试集每分钟超过140,000序列。值得注意的是,即使在对短至700个核苷酸的序列片段进行分类时,Craft也保持了非常高的准确性。可用性和实现:源代码可从:https://github.com/INFORM-Africa/AI-viral-lineage-classification获得。
{"title":"Craft: a machine learning approach to dengue subtyping.","authors":"Daniel J van Zyl, Marcel Dunaiski, Houriiyah Tegally, Cheryl Baxter, Tulio de Oliveira, Joicymara S Xavier","doi":"10.1093/bioadv/vbaf224","DOIUrl":"10.1093/bioadv/vbaf224","url":null,"abstract":"<p><strong>Motivation: </strong>The dengue virus poses a major global health threat, with nearly 390 million infections annually. A recently proposed hierarchical dengue nomenclature system enhances spatial resolution by defining major and minor lineages within genotypes, aiding efforts to track viral evolution. While current subtyping tools-Genome Detective, GLUE, and Nextclade-rely on computationally intensive sequence alignment and phylogenetic inference, machine learning presents a promising alternative for achieving accurate and rapid classification.</p><p><strong>Results: </strong>We present Craft (<b>C</b>haos <b>Ra</b>ndom <b>F</b>ores<b>t</b>), a machine learning framework for dengue subtyping. We demonstrate that Craft is capable of faster classification speeds while matching or surpassing the accuracy of existing tools. Craft achieves 99.5% accuracy on a hold-out test set formed from a consensus of predictions from existing tools and processes over 140 000 sequences per minute. Notably, Craft maintains remarkably high accuracy even when classifying sequence segments as short as 700 nucleotides.</p><p><strong>Availability and implementation: </strong>Source code is available at: https://github.com/INFORM-Africa/AI-viral-lineage-classification.</p>","PeriodicalId":72368,"journal":{"name":"Bioinformatics advances","volume":"5 1","pages":"vbaf224"},"PeriodicalIF":2.8,"publicationDate":"2025-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12527244/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145309982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Bioinformatics advances
全部 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