Pith. sign in

REVIEW 1 cited by

LISA: Towards Learned DNA Sequence Search

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.04728 v1 pith:LBCZODPB submitted 2019-10-10 cs.DB cs.DScs.LG

classification cs.DBcs.DScs.LG
keywords lisagenomicssearchsequencelearnedperformancesequencessequencing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Next-generation sequencing (NGS) technologies have enabled affordable sequencing of billions of short DNA fragments at high throughput, paving the way for population-scale genomics. Genomics data analytics at this scale requires overcoming performance bottlenecks, such as searching for short DNA sequences over long reference sequences. In this paper, we introduce LISA (Learned Indexes for Sequence Analysis), a novel learning-based approach to DNA sequence search. As a first proof of concept, we focus on accelerating one of the most essential flavors of the problem, called exact search. LISA builds on and extends FM-index, which is the state-of-the-art technique widely deployed in genomics tool-chains. Initial experiments with human genome datasets indicate that LISA achieves up to a factor of 4X performance speedup against its traditional counterpart.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SSCard: Substring Cardinality Estimation using Suffix Tree-Guided Learned FM-Index

    cs.DB 2025-05 conditional novelty 7.0 of 10

    SSCard estimates substring cardinality using a pruned suffix tree over an FM-index, with learned spline rank functions and an error bound, achieving lower q-error and smaller space than prior methods on five datasets.

Pith tools