Evidence map›Paper›PMID 41746292›Full record

ArticleBioinformatics (Oxford, England)2026

Rawsamble: overlapping raw nanopore signals using a hash-based seeding mechanism.

Can Firtina, Maximilian Mordig, Harun Mustafa, Sayan Goswami, Nika Mansouri Ghiasi, Stefano Mercogliano, Furkan Eris, Joel Lindegger, André Kahles, Onur Mutlu

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Review
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

10 authors.

Can FirtinaDepartment of Information Technology and Electrical Engineering, ETH Zurich, Zurich, 8092, Switzerland.ORCID 0000-0002-6548-7863
Maximilian MordigDepartment of Computer Science, ETH Zurich, Zurich, 8092, Switzerland.ORCID 0000-0002-5731-484X
Harun MustafaDepartment of Computer Science, ETH Zurich, Zurich, 8092, Switzerland.ORCID 0000-0002-2125-6086
Sayan GoswamiDepartment of Computer Science, ETH Zurich, Zurich, 8092, Switzerland.ORCID 0000-0002-7519-524X
Nika Mansouri GhiasiDepartment of Information Technology and Electrical Engineering, ETH Zurich, Zurich, 8092, Switzerland.ORCID 0000-0002-0833-0042
Stefano MercoglianoDepartment of Information Technology and Electrical Engineering, ETH Zurich, Zurich, 8092, Switzerland.
Furkan ErisDepartment of Information Technology and Electrical Engineering, ETH Zurich, Zurich, 8092, Switzerland.ORCID 0009-0007-4503-6073
Joel LindeggerDepartment of Information Technology and Electrical Engineering, ETH Zurich, Zurich, 8092, Switzerland.ORCID 0000-0003-2581-8637
André KahlesDepartment of Computer Science, ETH Zurich, Zurich, 8092, Switzerland.ORCID 0000-0002-3411-0692
Onur MutluDepartment of Information Technology and Electrical Engineering, ETH Zurich, Zurich, 8092, Switzerland.ORCID 0000-0002-0075-2312

Funding

AMD. SAFARI Research GroupGoogle, Intel, Microsoft, VMwareMax Planck ETH Center for Learning Systems and by SNSF #200550Semiconductor Research Corporation (SRC), the European Union's Horizon 101047160SNSF #200550Swiss National Science Foundation (SNSF) 200021_213084
6 · The paper itself

Abstract

motivationRaw nanopore signal analysis is a common approach in genomics to provide fast and resource-efficient analysis without translating the signals to bases (i.e. without basecalling). However, existing solutions cannot interpret raw signals directly if a reference genome is unknown due to a lack of accurate mechanisms to handle increased noise in pairwise raw signal comparison. Our goal is to enable the direct analysis of raw signals without a reference genome. To this end, we propose Rawsamble, the first mechanism that can identify regions of similarity between all raw signal pairs, known as all-vs-all overlapping, using a hash-based search mechanism.

resultsWe use these overlaps to construct de novo assembly graphs with an existing assembler, miniasm, off-the-shelf. To our knowledge, these are the first de novo assemblies ever constructed directly from raw signals without basecalling. Our extensive evaluations across multiple genomes of varying sizes show that Rawsamble provides a significant speedup (on average by 5.01× and up to 23.10×) and reduces peak memory usage (on average by 5.74× and up to by 22.00×) compared to a conventional genome assembly pipeline using the state-of-the-art tools for basecalling (Dorado's fastest mode) and overlapping (minimap2) on a CPU. We find that around one-third of Rawsamble's overlapping pairs are also found by minimap2. We find that when we use overlapping reads from Rawsamble, we can construct unitigs that are (i) as accurate as those built from minimap2's overlaps and (ii) up to half a chromosome in length (e.g. 2.3 million bases for E. coli). AVAILABILITY AND IMPLEMENTATION: Rawsamble is available at https://github.com/CMU-SAFARI/RawHash. We also provide the scripts to fully reproduce our results on our GitHub page.

Indexed as

GenomicsNanoporesSequence Analysis, DNASoftwareAlgorithms

Identifiers

PMID41746292
PMCPMC12975284

What Socratic holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the Socratic graph.