GraphK-LR: Enhancing Long-read Metagenomic Binning with Read-overlap Graphs Across Microbial Kingdoms

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract Background: Metagenomics, the study of genetic material from environmental samples, relies on binning - the process of grouping DNA sequences from the same organism to disentangle complex species mixtures. Recently, metagenomics has shown a rising interest in using long-reads from third-generation sequencing technologies to overcome the limitations of short-reads. These long-reads contain species-specific signals for direct grouping into taxonomic bins prior to assembly. Previous studies have successfully used nucleotide composition and coverage for binning long-reads. The advent of less error-prone sequencing technologies has paved the way for incorporating additional information to enhance binning accuracy. In this paper, we introduce GraphK-LR, a long-read binning refiner that uses connectivity information between the reads and machine-learning-based graph techniques to refine potentially misclassified reads from an initial binning tool. Additionally, our tool uses marker-gene-based kingdom-level analysis to address the challenge of species from different microbial kingdoms being present in the same metagenomic sample, making it complex to bin using existing tools. This approach is inspired by the multitude of short-read refiners, addressing the gap in the unavailability of refining tools for long reads. Results: We evaluated the tool using publicly available mock community datasets sequenced with Oxford Nanopore R.10.x chemistry, initially binned using the existing tools OBLR and LRBinner. Upon refinement, we observed a marginal improvement of 2-3\% in binning accuracy, which indicates that both these tools are highly effective at correctly binning reads. Another long-reads binning tool named SemiBin2, discarded nearly 20\% of reads while binning, and after refinement we observed a significant improvement ranging from 20-30\% in evaluation criteria. These results demonstrate that GraphK-LR adds an additional layer of accuracy over the binning tools, particularly in cases with unclassified reads. Conclusion: Although there is still room for further enhancement, our tool represents an important initial step in exploring the capacity to further improve the accuracy of long-read binning by combining existing methods with more sophisticated techniques. The underlying concept of GraphK-LR holds the potential to advance long-read-based metagenomics analyses across a wide range of applications. The source code for GraphK-LR can be found at https://github.com/NethmiRanasinghe/GraphK-LR.
Full text 14,081 characters · extracted from preprint-html · click to expand
GraphK-LR: Enhancing Long-read Metagenomic Binning with Read-overlap Graphs Across Microbial Kingdoms | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article GraphK-LR: Enhancing Long-read Metagenomic Binning with Read-overlap Graphs Across Microbial Kingdoms Nethmi Ranasinghe, Sathsarani Aththanayaka, Jayathri Ranasinghe, and 2 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7390699/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Background: Metagenomics, the study of genetic material from environmental samples, relies on binning - the process of grouping DNA sequences from the same organism to disentangle complex species mixtures. Recently, metagenomics has shown a rising interest in using long-reads from third-generation sequencing technologies to overcome the limitations of short-reads. These long-reads contain species-specific signals for direct grouping into taxonomic bins prior to assembly. Previous studies have successfully used nucleotide composition and coverage for binning long-reads. The advent of less error-prone sequencing technologies has paved the way for incorporating additional information to enhance binning accuracy. In this paper, we introduce GraphK-LR, a long-read binning refiner that uses connectivity information between the reads and machine-learning-based graph techniques to refine potentially misclassified reads from an initial binning tool. Additionally, our tool uses marker-gene-based kingdom-level analysis to address the challenge of species from different microbial kingdoms being present in the same metagenomic sample, making it complex to bin using existing tools. This approach is inspired by the multitude of short-read refiners, addressing the gap in the unavailability of refining tools for long reads. Results: We evaluated the tool using publicly available mock community datasets sequenced with Oxford Nanopore R.10.x chemistry, initially binned using the existing tools OBLR and LRBinner. Upon refinement, we observed a marginal improvement of 2-3\% in binning accuracy, which indicates that both these tools are highly effective at correctly binning reads. Another long-reads binning tool named SemiBin2, discarded nearly 20\% of reads while binning, and after refinement we observed a significant improvement ranging from 20-30\% in evaluation criteria. These results demonstrate that GraphK-LR adds an additional layer of accuracy over the binning tools, particularly in cases with unclassified reads. Conclusion: Although there is still room for further enhancement, our tool represents an important initial step in exploring the capacity to further improve the accuracy of long-read binning by combining existing methods with more sophisticated techniques. The underlying concept of GraphK-LR holds the potential to advance long-read-based metagenomics analyses across a wide range of applications. The source code for GraphK-LR can be found at https://github.com/NethmiRanasinghe/GraphK-LR. Long-reads Metagenomic binning Marker-genes Read overlap graphs Graph Neural Network Full Text Additional Declarations No competing interests reported. Supplementary Files SupplementaryGraphKLR.docx Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7390699","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":510482883,"identity":"73c00250-cfab-4c31-a1ba-9b49b291c00b","order_by":0,"name":"Nethmi Ranasinghe","email":"","orcid":"","institution":"University of Peradeniya","correspondingAuthor":false,"prefix":"","firstName":"Nethmi","middleName":"","lastName":"Ranasinghe","suffix":""},{"id":510482885,"identity":"5b8a9b37-4376-46b6-9e9b-d6cbb52d35e1","order_by":1,"name":"Sathsarani Aththanayaka","email":"","orcid":"","institution":"University of Peradeniya","correspondingAuthor":false,"prefix":"","firstName":"Sathsarani","middleName":"","lastName":"Aththanayaka","suffix":""},{"id":510482886,"identity":"8820a28b-a59e-45d7-8a12-71496313482b","order_by":2,"name":"Jayathri Ranasinghe","email":"","orcid":"","institution":"University of Peradeniya","correspondingAuthor":false,"prefix":"","firstName":"Jayathri","middleName":"","lastName":"Ranasinghe","suffix":""},{"id":510482890,"identity":"8624e9b8-5010-4a22-9cdd-f7640380b2e2","order_by":3,"name":"Vijini Mallawaarachchi","email":"","orcid":"","institution":"College of Science and Engineering, Flinders University","correspondingAuthor":false,"prefix":"","firstName":"Vijini","middleName":"","lastName":"Mallawaarachchi","suffix":""},{"id":510482894,"identity":"18a3c077-9a71-47b5-ad61-4f5f8bd4d6bc","order_by":4,"name":"Damayanthi Herath","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABRElEQVRIie3SsUrDQBjA8YuBdLk264WAz/CVQGrpy+QotEvSpYtDkRQhTrari/gKgUDoGDloBw+7ZnCICMWhhRShKEqxTYNKUnUVzH/5yJEfdweHUFHRXyxIJ4g4mYa8+xZ3Iwqy4IOQlICh2F+J8RNBKYHgF1KZ3NAn3Ls7qZXK1w/HvbeONjlnj8Ko0UElFiGD54jCLU/F4xmpn1aaVT6Grs5vW0cCb3cRbgEywhyBwHJVLDECDOuKLQH1Q1MHwWHURubmYHGeTBfeK14npPZir4F6V/OUyPP9JLR8tezsdhH6DlCXYC1KCNnukj+YEi78+uWAKS7DmtIfaPSCmzqivE0dMoNgz/UrU8sL5ysmw5RXl/bqkA7PuBYvRw06lJv3UTzOkW0HOLMgkc3dkYQ+30Y24TmzIMaC/c2/RUVFRf+xd871eV0ybnlxAAAAAElFTkSuQmCC","orcid":"","institution":"University of Peradeniya","correspondingAuthor":true,"prefix":"","firstName":"Damayanthi","middleName":"","lastName":"Herath","suffix":""}],"badges":[],"createdAt":"2025-08-17 06:23:07","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7390699/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7390699/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":94031093,"identity":"dd34005f-4d64-4edc-8161-6b93215a34a5","added_by":"auto","created_at":"2025-10-21 14:46:38","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1558775,"visible":true,"origin":"","legend":"","description":"","filename":"GraphKLRBMCBioinformatics.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7390699/v1_covered_cd106fb6-9af2-49be-93be-44d13e804e69.pdf"},{"id":90785832,"identity":"4f068b8e-2df1-4a7f-922a-27cd45fa12db","added_by":"auto","created_at":"2025-09-08 07:02:34","extension":"docx","order_by":0,"title":"","display":"","copyAsset":false,"role":"supplement","size":12709,"visible":true,"origin":"","legend":"","description":"","filename":"SupplementaryGraphKLR.docx","url":"https://assets-eu.researchsquare.com/files/rs-7390699/v1/97e8aa9d1b54c3b8f692ea58.docx"}],"financialInterests":"No competing interests reported.","formattedTitle":"GraphK-LR: Enhancing Long-read Metagenomic Binning with Read-overlap Graphs Across Microbial Kingdoms","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Long-reads, Metagenomic binning, Marker-genes, Read overlap graphs, Graph Neural Network","lastPublishedDoi":"10.21203/rs.3.rs-7390699/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7390699/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eBackground: Metagenomics, the study of genetic material from environmental samples, relies on binning - the process of grouping DNA sequences from the same organism to disentangle complex species mixtures. Recently, metagenomics has shown a rising interest in using long-reads from third-generation sequencing technologies to overcome the limitations of short-reads. These long-reads contain species-specific signals for direct grouping into taxonomic bins prior to assembly. Previous studies have successfully used nucleotide composition and coverage for binning long-reads. The advent of less error-prone sequencing technologies has paved the way for incorporating additional information to enhance binning accuracy. In this paper, we introduce GraphK-LR, a long-read binning refiner that uses connectivity information between the reads and machine-learning-based graph techniques to refine potentially misclassified reads from an initial binning tool. Additionally, our tool uses marker-gene-based kingdom-level analysis to address the challenge of species from different microbial kingdoms being present in the same metagenomic sample, making it complex to bin using existing tools. This approach is inspired by the multitude of short-read refiners, addressing the gap in the unavailability of refining tools for long reads.\u0026nbsp;\u003c/p\u003e\n\u003cp\u003eResults: We evaluated the tool using publicly available mock community datasets sequenced with Oxford Nanopore R.10.x chemistry, initially binned using the existing tools OBLR and LRBinner. Upon refinement, we observed a marginal improvement of 2-3\\% in binning accuracy, which indicates that both these tools are highly effective at correctly binning reads. Another long-reads binning tool named SemiBin2, discarded nearly 20\\% of reads while binning, and after refinement we observed a significant improvement ranging from 20-30\\% in evaluation criteria. These results demonstrate that GraphK-LR adds an additional layer of accuracy over the binning tools, particularly in cases with unclassified reads.\u0026nbsp;\u003c/p\u003e\n\u003cp\u003eConclusion: Although there is still room for further enhancement, our tool represents an important initial step in exploring the capacity to further improve the accuracy of long-read binning by combining existing methods with more sophisticated techniques. The underlying concept of GraphK-LR holds the potential to advance long-read-based metagenomics analyses across a wide range of applications. The source code for GraphK-LR can be found at https://github.com/NethmiRanasinghe/GraphK-LR.\u003c/p\u003e","manuscriptTitle":"GraphK-LR: Enhancing Long-read Metagenomic Binning with Read-overlap Graphs Across Microbial Kingdoms","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-09-08 07:02:30","doi":"10.21203/rs.3.rs-7390699/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"f2deddb8-68e9-42a5-8045-b78b78322cdb","owner":[],"postedDate":"September 8th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-10-21T14:38:26+00:00","versionOfRecord":[],"versionCreatedAt":"2025-09-08 07:02:30","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7390699","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7390699","identity":"rs-7390699","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00