NoiBic: a noise-tolerant biclustering algorithm for high-throughput gene expression data analysis.

IF 5.4
Chaoyi Long, Jingxian Li, Bingqiang Liu, Duanchen Sun, Guojun Li
{"title":"NoiBic: a noise-tolerant biclustering algorithm for high-throughput gene expression data analysis.","authors":"Chaoyi Long, Jingxian Li, Bingqiang Liu, Duanchen Sun, Guojun Li","doi":"10.1093/bioinformatics/btag743","DOIUrl":null,"url":null,"abstract":"<p><strong>Motivation: </strong>High-throughput transcriptomic technologies generate large-scale gene expression datasets for functional module discovery. However, technical and biological noise can obscure coherent expression patterns and compromise module detection. Noise-tolerant methods are therefore needed to recover meaningful biclusters.</p><p><strong>Results: </strong>We developed NoiBic, a noise-tolerant biclustering algorithm for high-throughput transcriptomic data. NoiBic integrates a longest approximate common subsequence-based seed identification strategy with noise-aware column expansion to improve bicluster detection under noisy conditions. Across simulated datasets with controlled settings for bicluster coherency, matrix size, bicluster number, noise level, and overlap level, NoiBic accurately recovered planted biclusters, particularly under noisy and overlapping conditions. Evaluation on bulk and single-cell RNA-seq datasets demonstrated its ability to identify biologically meaningful gene modules and cell type-associated biclusters.</p><p><strong>Availability: </strong>NoiBic is implemented in C++17 and available at https://github.com/lcyi0208/NoiBic. The software version used in this study has been permanently archived on Zenodo at https://doi.org/10.5281/zenodo.22732377. Benchmark datasets are available at https://doi.org/10.5281/zenodo.21919392.</p>","PeriodicalId":93899,"journal":{"name":"Bioinformatics (Oxford, England)","volume":" ","pages":""},"PeriodicalIF":5.4000,"publicationDate":"2026-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13681661/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bioinformatics (Oxford, England)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/bioinformatics/btag743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Motivation: High-throughput transcriptomic technologies generate large-scale gene expression datasets for functional module discovery. However, technical and biological noise can obscure coherent expression patterns and compromise module detection. Noise-tolerant methods are therefore needed to recover meaningful biclusters.

Results: We developed NoiBic, a noise-tolerant biclustering algorithm for high-throughput transcriptomic data. NoiBic integrates a longest approximate common subsequence-based seed identification strategy with noise-aware column expansion to improve bicluster detection under noisy conditions. Across simulated datasets with controlled settings for bicluster coherency, matrix size, bicluster number, noise level, and overlap level, NoiBic accurately recovered planted biclusters, particularly under noisy and overlapping conditions. Evaluation on bulk and single-cell RNA-seq datasets demonstrated its ability to identify biologically meaningful gene modules and cell type-associated biclusters.

Availability: NoiBic is implemented in C++17 and available at https://github.com/lcyi0208/NoiBic. The software version used in this study has been permanently archived on Zenodo at https://doi.org/10.5281/zenodo.22732377. Benchmark datasets are available at https://doi.org/10.5281/zenodo.21919392.

NoiBic:用于高通量基因表达数据分析的耐噪声双聚类算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书