Nucleic Acids ResearchBioinformaticsPeer-reviewed journal article
Clustering de Novo by Gene of Long Reads from Transcriptomics Data
Camille MarchetiD, Lolita LecompteiD, Corinne Da SilvaiD, Corinne CruaudiD, Jean‐Marc AuryiD, Jacques Nicolas, Pierre PeterlongoiD
Abstract
Long-read sequencing currently provides sequences of several thousand base pairs. This allows to obtain complete transcripts, which offers an un-precedented vision of the cellular transcriptome.\n\nHowever the literature is lacking tools to cluster such data de novo, in particular for Oxford Nanopore Technologies reads, because of the inherent high error rate compared to short reads.\n\nOur goal is to process reads from whole transcriptome sequencing data accurately and without a reference genome in order to reliably group reads coming from the same gene. This de novo approach is therefore particularly suitable for non-model species, but can also serve as a useful pre-processing step to improve read mapping. Our contribution is both to propose a new algorithm adapted to clustering of reads by gene and a practical and free access tool that permits to scale the complete processing of eukaryotic transcriptomes.\n\nWe sequenced a mouse RNA sample using the MinION device, this dataset is used to compare our solution to other algorithms used in the context of biological clustering. We demonstrate its is better-suited for transcriptomics long reads. When a reference is available thus mapping possible, we show that it stands as an alternative method that predicts complementary clusters.
- organism: mouse
- assay: long-read sequencing
- assay: bulk RNA-seq
- research focus: clustering
- approach: statistical model
- Citations
- 39
- FWCI
- 2.40
- Field percentile
- top 10%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- De novo clustering of long-read transcriptome data using a greedy, quality-value based algorithm
Kristoffer Sahlin, Paul Medvedev·Journal of Computational BiologyPeer-reviewed·Mar 17, 2020
- De novo clustering of large long-read transcriptome datasets with isONclust3
Alexander J. Petri, Kristoffer Sahlin·BioinformaticsPeer-reviewed·Apr 21, 2025
- I-CONVEX: Fast and Accurate de Novo Transcriptome Recovery from Long Reads
Sina Baharlouei, Meisam Razaviyayn, … David N. C. Tse·bioRxiv·Sep 28, 2020
- K-mer clustering algorithm using a MapReduce framework: application to the parallelization of the Inchworm module of Trinity
Chang Sik Kim, Martyn Winn, … Kirk E. Jordan·BMC BioinformaticsPeer-reviewed·Nov 3, 2017
- TALC: Transcript-level Aware Long Read Correction
Lucile Broséus, Aubin Thomas, … William Ritchie·BioinformaticsPeer-reviewed·Jul 10, 2020
- ClusTrast: a short read de novo transcript isoform assembler guided by clustered contigs
Karl Johan Westrin, Warren W. Kretzschmar, Olof Emanuelsson·bioRxiv·Jan 2, 2022