{"title":"在有限记忆中准确分类宏基因组ONT读取。","authors":"Trevor Schneggenburger, Jaroslaw Zola","doi":"10.1093/bioinformatics/btaf537","DOIUrl":null,"url":null,"abstract":"<p><strong>Motivation: </strong>Oxford Nanopore Technologies' devices, such as MinION, permit affordable, real-time DNA sequencing, and come with targeted sequencing capabilities. Such capabilities create new challenges for metagenomic classifiers that must be computationally efficient yet robust enough to handle potentially erroneous DNA reads, while ideally inspecting only a few hundred bases of a read. Currently available DNA classifiers leave room for improvement with respect to classification accuracy, memory usage, and the ability to operate in targeted sequencing scenarios.</p><p><strong>Results: </strong>We present SKiM: Short K-mers in Metagenomics, a new lightweight metagenomic classifier designed for ONT reads. Compared to state-of-the-art classifiers, SKiM requires only a fraction of memory to run, and can classify DNA reads with higher accuracy after inspecting only their first few hundred bases. To achieve this, SKiM introduces new data compression techniques to maintain a reference database built from short k-mers, and treats classification as a statistical testing problem.</p><p><strong>Availability and implementation: </strong>SKiM source code, documentation, and test data are available from: https://gitlab.com/SCoRe-Group/skim.</p>","PeriodicalId":93899,"journal":{"name":"Bioinformatics (Oxford, England)","volume":" ","pages":""},"PeriodicalIF":5.4000,"publicationDate":"2025-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12502918/pdf/","citationCount":"0","resultStr":"{\"title\":\"SKiM: accurately classifying metagenomic ONT reads in limited memory.\",\"authors\":\"Trevor Schneggenburger, Jaroslaw Zola\",\"doi\":\"10.1093/bioinformatics/btaf537\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Motivation: </strong>Oxford Nanopore Technologies' devices, such as MinION, permit affordable, real-time DNA sequencing, and come with targeted sequencing capabilities. Such capabilities create new challenges for metagenomic classifiers that must be computationally efficient yet robust enough to handle potentially erroneous DNA reads, while ideally inspecting only a few hundred bases of a read. Currently available DNA classifiers leave room for improvement with respect to classification accuracy, memory usage, and the ability to operate in targeted sequencing scenarios.</p><p><strong>Results: </strong>We present SKiM: Short K-mers in Metagenomics, a new lightweight metagenomic classifier designed for ONT reads. Compared to state-of-the-art classifiers, SKiM requires only a fraction of memory to run, and can classify DNA reads with higher accuracy after inspecting only their first few hundred bases. To achieve this, SKiM introduces new data compression techniques to maintain a reference database built from short k-mers, and treats classification as a statistical testing problem.</p><p><strong>Availability and implementation: </strong>SKiM source code, documentation, and test data are available from: https://gitlab.com/SCoRe-Group/skim.</p>\",\"PeriodicalId\":93899,\"journal\":{\"name\":\"Bioinformatics (Oxford, England)\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":5.4000,\"publicationDate\":\"2025-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12502918/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bioinformatics (Oxford, England)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/bioinformatics/btaf537\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bioinformatics (Oxford, England)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/bioinformatics/btaf537","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
动机:牛津纳米孔技术公司的设备,如MinION,允许负担得起的实时DNA测序,并具有目标测序功能。这种能力给宏基因组分类器带来了新的挑战,宏基因组分类器必须在计算效率高的同时足够强大,以处理潜在的错误DNA读取,而理想情况下只能检查读取的几百个碱基。目前可用的DNA分类器在分类准确性、内存使用和在目标测序场景中操作的能力方面还有改进的空间。结果:我们提出了一种新的轻量级宏基因组分类器SKiM: Short K-mers,用于ONT reads。与最先进的分类器相比,SKiM只需要一小部分内存就可以运行,并且在检查DNA的前几百个碱基后就可以以更高的准确性对DNA进行分类。为了实现这一点,SKiM引入了新的数据压缩技术来维护由短k-mers构建的参考数据库,并将分类视为一个统计测试问题。可用性:可从https://gitlab.com/SCoRe-Group/skim.Contact: tcschneg@buffalo.edu获得略读源代码、文档和测试数据。
SKiM: accurately classifying metagenomic ONT reads in limited memory.
Motivation: Oxford Nanopore Technologies' devices, such as MinION, permit affordable, real-time DNA sequencing, and come with targeted sequencing capabilities. Such capabilities create new challenges for metagenomic classifiers that must be computationally efficient yet robust enough to handle potentially erroneous DNA reads, while ideally inspecting only a few hundred bases of a read. Currently available DNA classifiers leave room for improvement with respect to classification accuracy, memory usage, and the ability to operate in targeted sequencing scenarios.
Results: We present SKiM: Short K-mers in Metagenomics, a new lightweight metagenomic classifier designed for ONT reads. Compared to state-of-the-art classifiers, SKiM requires only a fraction of memory to run, and can classify DNA reads with higher accuracy after inspecting only their first few hundred bases. To achieve this, SKiM introduces new data compression techniques to maintain a reference database built from short k-mers, and treats classification as a statistical testing problem.
Availability and implementation: SKiM source code, documentation, and test data are available from: https://gitlab.com/SCoRe-Group/skim.