EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

De novo clustering of large long-read transcriptome datasets with isONclust3

Alexander J Petri iD, Kristoffer Sahlin iD

Bioinformatics · 06.05.2025 · 41 (5)

DOI: 10.1093/bioinformatics/btaf207 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bioinformatics, online erschienen am 23.04.2025. Verfasst von Alexander J Petri und 1 weiteren Autor:innen. Beteiligte Einrichtung: Department of Mathematics, Science for Life Laboratory, Stockholm University, Stockholm 106 91, Sweden. Hauptthemen laut MEDLINE: Gene Expression Profiling, Transcriptome, Software, Sequence Analysis, RNA. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Swedish Research Council.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Motivation Long-read sequencing techniques can sequence transcripts from end to end, greatly improving our ability to study the transcription process. Although there are several well-established tools for long-read transcriptome analysis, most are reference-based. This limits the analysis of organisms without high-quality reference genomes and samples or genes with high variability (e.g. cancer samples or some gene families). In such settings, analysis using a reference-free method is favorable. The computational problem of clustering long reads by region of common origin is well-established for reference-free transcriptome analysis pipelines. Such clustering enables large datasets to be split roughly by gene family and, therefore, an independent analysis of each cluster. There exist tools for this. However, none of those tools can efficiently process the large amount of reads that are now generated by long-read sequencing technologies. Results We present isONclust3, an improved algorithm over isONclust and isONclust2, to cluster massive long-read transcriptome datasets into gene families. Like isONclust, isONclust3 represents each cluster with a set of minimizers. However, unlike other approaches, isONclust3 dynamically updates the cluster representation during clustering by adding high-confidence minimizers from new reads assigned to the cluster and employs an iterative cluster-merging step. We show that isONclust3 yields results with higher or comparable quality to state-of-the-art algorithms but is 10–100 times faster on large datasets. Also, using a 256 Gb computing node, isONclust3 was the only tool that could cluster 37 million PacBio reads, which is a typical throughput of the recent PacBio Revio sequencing machine. Availability and implementation https://github.com/aljpetri/isONclust3.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Gene Expression ProfilingTranscriptomeSoftwareSequence Analysis, RNAAlgorithmsCluster AnalysisHumansComputational BiologyHigh-Throughput Nucleotide SequencingMultigene FamilyDatabases, Genetic

Autor:innen und Institutionen

  • Department of Mathematics, Science for Life Laboratory, Stockholm University, Stockholm 106 91, Sweden.
  • Department of Computer Science, University of Helsinki, Helsinki 00014, Finland.

ORCID-Profile: Alexander J Petri, Kristoffer Sahlin

Förderung

  • Swedish Research Council

Zitieren

APA

Petri, A. J., & Sahlin, K. (2025). De novo clustering of large long-read transcriptome datasets with isONclust3. Bioinformatics, 41(5). https://doi.org/10.1093/bioinformatics/btaf207

Vancouver

Petri AJ, Sahlin K. De novo clustering of large long-read transcriptome datasets with isONclust3. Bioinformatics. 2025;41(5). doi:10.1093/bioinformatics/btaf207

BibTeX
@article{Petri2025,
  author = {Petri, Alexander J and Sahlin, Kristoffer},
  title = {De novo clustering of large long-read transcriptome datasets with isONclust3},
  journal = {Bioinformatics},
  year = {2025},
  volume = {41},
  number = {5},
  doi = {10.1093/bioinformatics/btaf207}
}
Kostenlos starten →