k- Strong Inference Algorithm: A Hybrid Information Theory Based Gene Network Inference Algorithm.

IF 2.4 4区 生物学 Q3 BIOCHEMISTRY & MOLECULAR BIOLOGY
Molecular Biotechnology Pub Date : 2024-11-01 Epub Date: 2023-11-11 DOI:10.1007/s12033-023-00929-2
Mustafa Özgür Cingiz
{"title":"k- Strong Inference Algorithm: A Hybrid Information Theory Based Gene Network Inference Algorithm.","authors":"Mustafa Özgür Cingiz","doi":"10.1007/s12033-023-00929-2","DOIUrl":null,"url":null,"abstract":"<p><p>Gene networks allow researchers to understand the underlying mechanisms between diseases and genes while reducing the need for wet lab experiments. Numerous gene network inference (GNI) algorithms have been presented in the literature to infer accurate gene networks. We proposed a hybrid GNI algorithm, k-Strong Inference Algorithm (ksia), to infer more reliable and robust gene networks from omics datasets. To increase reliability, ksia integrates Pearson correlation coefficient (PCC) and Spearman rank correlation coefficient (SCC) scores to determine mutual information scores between molecules to increase diversity of relation predictions. To infer a more robust gene network, ksia applies three different elimination steps to remove redundant and spurious relations between genes. The performance of ksia was evaluated on microbe microarrays database in the overlap analysis with other GNI algorithms, namely ARACNE, C3NET, CLR, and MRNET. Ksia inferred less number of relations due to its strict elimination steps. However, ksia generally performed better on Escherichia coli (E.coli) and Saccharomyces cerevisiae (yeast) gene expression datasets due to F- measure and precision values. The integration of association estimator scores and three elimination stages slightly increases the performance of ksia based gene networks. Users can access ksia R package and user manual of package via https://github.com/ozgurcingiz/ksia .</p>","PeriodicalId":18865,"journal":{"name":"Molecular Biotechnology","volume":" ","pages":"3213-3225"},"PeriodicalIF":2.4000,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Molecular Biotechnology","FirstCategoryId":"3","ListUrlMain":"https://doi.org/10.1007/s12033-023-00929-2","RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2023/11/11 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"BIOCHEMISTRY & MOLECULAR BIOLOGY","Score":null,"Total":0}
引用次数: 0

Abstract

Gene networks allow researchers to understand the underlying mechanisms between diseases and genes while reducing the need for wet lab experiments. Numerous gene network inference (GNI) algorithms have been presented in the literature to infer accurate gene networks. We proposed a hybrid GNI algorithm, k-Strong Inference Algorithm (ksia), to infer more reliable and robust gene networks from omics datasets. To increase reliability, ksia integrates Pearson correlation coefficient (PCC) and Spearman rank correlation coefficient (SCC) scores to determine mutual information scores between molecules to increase diversity of relation predictions. To infer a more robust gene network, ksia applies three different elimination steps to remove redundant and spurious relations between genes. The performance of ksia was evaluated on microbe microarrays database in the overlap analysis with other GNI algorithms, namely ARACNE, C3NET, CLR, and MRNET. Ksia inferred less number of relations due to its strict elimination steps. However, ksia generally performed better on Escherichia coli (E.coli) and Saccharomyces cerevisiae (yeast) gene expression datasets due to F- measure and precision values. The integration of association estimator scores and three elimination stages slightly increases the performance of ksia based gene networks. Users can access ksia R package and user manual of package via https://github.com/ozgurcingiz/ksia .

Abstract Image

强推理算法:一种基于混合信息理论的基因网络推理算法。
基因网络使研究人员能够了解疾病和基因之间的潜在机制,同时减少了对湿实验室实验的需求。文献中已经提出了许多基因网络推断(GNI)算法来推断准确的基因网络。我们提出了一种混合GNI算法,k-Strong推理算法(ksia),从组学数据集推断出更可靠和健壮的基因网络。为了提高可靠性,ksia整合了Pearson相关系数(PCC)和Spearman秩相关系数(SCC)分数来确定分子之间的互信息分数,以增加关系预测的多样性。为了推断出一个更健壮的基因网络,ksia采用了三种不同的消除步骤来去除基因之间冗余和虚假的关系。在微生物微阵列数据库上对ksia算法的性能进行了评价,并与其他GNI算法ARACNE、C3NET、CLR和MRNET进行了重叠分析。Ksia由于严格的排除步骤,推断出的关系数量较少。然而,ksia在大肠杆菌(E.coli)和酿酒酵母(Saccharomyces cerevisiae)基因表达数据集上通常表现更好,因为F- measure和精度值。关联估计器得分和三个消除阶段的整合略微提高了基于ksia的基因网络的性能。用户可以通过https://github.com/ozgurcingiz/ksia访问ksia R包和包的使用手册。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Molecular Biotechnology
Molecular Biotechnology 医学-生化与分子生物学
CiteScore
4.10
自引率
3.80%
发文量
165
审稿时长
6 months
期刊介绍: Molecular Biotechnology publishes original research papers on the application of molecular biology to both basic and applied research in the field of biotechnology. Particular areas of interest include the following: stability and expression of cloned gene products, cell transformation, gene cloning systems and the production of recombinant proteins, protein purification and analysis, transgenic species, developmental biology, mutation analysis, the applications of DNA fingerprinting, RNA interference, and PCR technology, microarray technology, proteomics, mass spectrometry, bioinformatics, plant molecular biology, microbial genetics, gene probes and the diagnosis of disease, pharmaceutical and health care products, therapeutic agents, vaccines, gene targeting, gene therapy, stem cell technology and tissue engineering, antisense technology, protein engineering and enzyme technology, monoclonal antibodies, glycobiology and glycomics, and agricultural biotechnology.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信