The following pages link to BWA (Q46083):
Displaying 50 items.
- (Q50077) (redirect page) (← links)
- Approximate string matching using a bidirectional index (Q294959) (← links)
- Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
- Coverage theories for metagenomic DNA sequencing based on a generalization of Stevens' theorem (Q378317) (← links)
- Multi-pattern matching with bidirectional indexes (Q396713) (← links)
- An algorithm for mapping short reads to a dynamically changing genomic sequence (Q414417) (← links)
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm (Q507395) (← links)
- A Bayesian feature allocation model for tumor heterogeneity (Q746649) (← links)
- On statistical modeling of sequencing noise in high depth data to assess tumor evolution (Q1668966) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- A survey of string orderings and their application to the Burrows-Wheeler transform (Q1698705) (← links)
- FM-index of alignment with gaps (Q1698723) (← links)
- A novel specialized single-linkage clustering algorithm for taxonomically ordered data (Q1704156) (← links)
- Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance (Q1739212) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- Variance in estimated pairwise genetic distance under high versus low coverage sequencing: the contribution of linkage disequilibrium (Q1746104) (← links)
- A randomized numerical aligner (rNA) (Q1757842) (← links)
- Computing the multi-string BWT and LCP array in external memory (Q1998862) (← links)
- Exome sequencing identifies predisposing and fusion gene in ganglioneuroma, ganglioneuroblastoma and neuroblastoma (Q2045525) (← links)
- Wheeler languages (Q2051845) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- r-indexing the eBWT (Q2146118) (← links)
- Fast and optimal sequence-to-graph alignment guided by seeds (Q2170166) (← links)
- CLMB: deep contrastive learning for robust metagenomic binning (Q2170167) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- A Bayesian nonparametric model for inferring subclonal populations from structured DNA sequencing data (Q2245171) (← links)
- A resource-frugal probabilistic dictionary and applications in bioinformatics (Q2295632) (← links)
- Refining the \(r\)-index (Q2297853) (← links)
- The alternating BWT: an algorithmic perspective (Q2297865) (← links)
- TreeClone: reconstruction of tumor subclone phylogeny based on mutation pairs using next generation sequencing data (Q2318663) (← links)
- Global and local sequence alignment with a bounded number of gaps (Q2342666) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- Average-case linear-time similar substring searching by the \(q\)-gram distance (Q2440164) (← links)
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel (Q2442813) (← links)
- Quantifying alternative splicing from paired-end RNA-sequencing data (Q2453673) (← links)
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801) (← links)
- Analytic combinatorics for computing seeding probabilities (Q2633234) (← links)
- Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding (Q2958322) (← links)
- Designing Efficient Spaced Seeds for SOLiD Read Mapping (Q3002743) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- De Novo NGS Data Compression (Q3305522) (← links)
- DNA-Seq Error Correction Based on Substring Indices (Q3305526) (← links)
- Comparative Assessment of Alignment Algorithms for NGS Data: Features, Considerations, Implementations, and Future (Q3305532) (← links)
- CUSHAW Suite: Parallel and Efficient Algorithms for NGS Read Alignment (Q3305533) (← links)
- String-Matching and Alignment Algorithms for Finding Motifs in NGS Data (Q3305534) (← links)
- AStarix: Fast and Optimal Sequence-to-Graph Alignment (Q5041800) (← links)
- SpliceTAPyR — An Efficient Method for Transcriptome Alignment (Q5384621) (← links)
