Pith. sign in

REVIEW 4 cited by

Faster and More Accurate Sequence Alignment with SNAP

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 1111.5572 v1 pith:3IK42UYS submitted 2011-11-23 cs.DS q-bio.GN

classification cs.DSq-bio.GN
keywords snapalignmentaccuratealignerscostfastergenomeindex
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We present the Scalable Nucleotide Alignment Program (SNAP), a new short and long read aligner that is both more accurate (i.e., aligns more reads with fewer errors) and 10-100x faster than state-of-the-art tools such as BWA. Unlike recent aligners based on the Burrows-Wheeler transform, SNAP uses a simple hash index of short seed sequences from the genome, similar to BLAST's. However, SNAP greatly reduces the number and cost of local alignment checks performed through several measures: it uses longer seeds to reduce the false positive locations considered, leverages larger memory capacities to speed index lookup, and excludes most candidate locations without fully computing their edit distance to the read. The result is an algorithm that scales well for reads from one hundred to thousands of bases long and provides a rich error model that can match classes of mutations (e.g., longer indels) that today's fast aligners ignore. We calculate that SNAP can align a dataset with 30x coverage of a human genome in less than an hour for a cost of $2 on Amazon EC2, with higher accuracy than BWA. Finally, we describe ongoing work to further improve SNAP.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 231 citations worldwide. Full citation record

  1. The anti-lexicographic SUS-anchor: a near-optimal k=1 sampling scheme

    cs.DS 2026-05 unverdicted novelty 6.0 of 10

    The anti-lexicographic SUS-anchor achieves sampling densities less than 1% above the lower bound for alphabet size 4 and k=1, substantially outperforming bidirectional anchors.

  2. Inductive-bias-driven Reinforcement Learning For Efficient Schedules in Heterogeneous Clusters

    cs.DC 2019-09 conditional novelty 6.0 of 10

    Symphony uses a domain-driven Bayesian network as an inductive bias in an RL scheduler, dramatically cutting training data needs while beating black-box methods.

  3. Extending TensorFlow's Semantics with Pipelined Execution

    cs.DC 2019-08 conditional novelty 6.0 of 10

    PTF adds stages, gates, and per-feed metadata to TensorFlow to support concurrent, isolated, flow-controlled processing of multiple batches, demonstrated on a genomic align/sort pipeline.

  4. Dependencies and Dataflow in Seed-Filter-Extend Pipelines

    cs.PF 2026-06 unverdicted novelty 4.0 of 10

    The paper analyzes dependencies in genome alignment pipelines and implements synthesized optimizations from four prior tools into LASTZ to reduce serial bottlenecks.

Pith tools