Evidence map›Paper›PMID 38895288›Full record

ArticlebioRxiv : the preprint server for biology2024

Efficient Seeding for Error-Prone Sequences with SubseqHash2.

Xiang Li, Ke Chen, Mingfu Shao

Abstract readPreprint
In one paragraph

Article in bioRxiv : the preprint server for biology, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

3 authors.

Xiang LiDepartment of Computer Science and Engineering, The Pennsylvania State University, United States.ORCID 0000-0001-8499-4740
Ke ChenDepartment of Computer Science and Engineering, The Pennsylvania State University, United States.ORCID 0000-0001-5470-6621
Mingfu ShaoDepartment of Computer Science and Engineering, The Pennsylvania State University, United States.ORCID 0000-0001-6112-5139

Funding

Computational Methods for Assembling Multiple RNA-seq SamplesR01HG011065 · NHGRI · PENNSYLVANIA STATE UNIVERSITY, THE · PI SHAO, MINGFU · 2021 to 2025
$1.8M
NHGRI NIH HHS R01 HG011065
6 · The paper itself

Abstract

Seeding is an essential preparatory step for large-scale sequence comparisons. Substring-based seeding methods such as kmers are ideal for sequences with low error rates but struggle to achieve high sensitivity while maintaining a reasonable precision for error-prone long reads. SubseqHash, a novel subsequence-based seeding method we recently developed, achieves superior accuracy to substring-based methods in seeding sequences with high mutation/error rates, while the only drawback is its computation speed. In this paper, we propose SubseqHash2, an improved algorithm that can compute multiple sets of seeds in one run by defining

Identifiers

PMID38895288
PMCPMC11185578

What OpenQuestion 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 OpenQuestion graph.