REVIEW 9 cited by
Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM
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
Signed reviews
read the original abstract
Summary: BWA-MEM is a new alignment algorithm for aligning sequence reads or long query sequences against a large reference genome such as human. It automatically chooses between local and end-to-end alignments, supports paired-end reads and performs chimeric alignment. The algorithm is robust to sequencing errors and applicable to a wide range of sequence lengths from 70bp to a few megabases. For mapping 100bp sequences, BWA-MEM shows better performance than several state-of-art read aligners to date. Availability and implementation: BWA-MEM is implemented as a component of BWA, which is available at http://github.com/lh3/bwa. Contact: hengli@broadinstitute.org
Forward citations
Cited by 9 Pith papers
-
Valinor: Architectural Support for Fast, Energy-Efficient and Programmable Physical Memory Allocation
A programmable hardware allocation engine executing OS-supplied libraries cuts minor page-fault costs by 17x on a RISC-V FPGA prototype while remaining within 3% of a fixed-function design.
-
AirLift: A Fast and Comprehensive Technique for Remapping Alignments between Reference Genomes
AirLift remaps read alignments between similar reference genomes up to 27.4x faster than full re-mapping while maintaining high accuracy for SNP and INDEL variant calling as validated with GATK.
-
IndelFreeAligner: A Streaming Aligner for Comprehensive Gapless Alignment Against Terabase-Scale References
A streaming, no-preindex aligner that searches terabase-scale references for a few short queries in minutes with modest RAM, while tolerating up to 16 substitutions.
-
Parse indexing for discarding short pseudo-MEMs safely
The paper shows how parse indexing can select pseudo-MEMs that contain every MEM of length at least k while eliminating the need to choose k and the risk of discarding important matches.
-
LCPan: efficient variation graph construction using Locally Consistent Parsing
An iterative LCP implementation enables a variation graph constructor that is >10x faster and >13x more memory-efficient than vg on human pangenome data.
-
Latent Structural Categorical Matrix Completion with Application to Quasispecies Analysis
LCMC performs categorical matrix completion via latent tensor factorization in a double-loop setup with adaptive dimension estimation and split-merge-refine enhancements, outperforming prior methods on synthetic and q...
-
Optimizing the Variant Calling Pipeline Execution on Human Genomes Using GPU-Enabled Machines
Scheduling GPU variant calling by predicting stage times from sequence features cut average makespan by roughly 2x versus a greedy scheduler and 1.6x versus a dynamic scheduler on a 5-VM, 10-genome workload.
-
BMFM-DNA: A SNP-aware DNA foundation model to capture variant effects
Encoding human genetic variants as special characters during DNA foundation model pre-training is claimed to improve downstream task performance, with small margins and a confounded comparison.
-
De(con)struction of the lazy-F loop: improving performance of Smith Waterman alignment
A scan-based reformulation of the striped Smith-Waterman lazy-F loop achieves O(n/p + log(p)) per iteration and improves BWA alignment speed on AVX2 and AVX512VL.
Discussion (0). Continue with ORCID to comment.