Burrows-Wheeler Aligner: BWA is a software package for mapping low-divergent sequences against a large reference genome, such as the human genome. It consists of three algorithms: BWA-backtrack, BWA-SW and BWA-MEM. The first algorithm is designed for Illumina sequence reads up to 100bp, while the rest two for longer sequences ranged from 70bp to 1Mbp. BWA-MEM and BWA-SW share similar features such as long-read support and split alignment, but BWA-MEM, which is the latest, is generally recommended for high-quality queries as it is faster and more accurate. BWA-MEM also has better performance than BWA-backtrack for 70-100bp Illumina reads

References in zbMATH (referenced in 51 articles )

Showing results 1 to 20 of 51.
Sorted by year (citations)

1 2 3 next

  1. Egidi, Lavinia; Louza, Felipe A.; Manzini, Giovanni: Space efficient merging of de Bruijn graphs and Wheeler graphs (2022)
  2. Alanko, Jarno; D’Agostino, Giovanna; Policriti, Alberto; Prezza, Nicola: Wheeler languages (2021)
  3. Bonizzoni, Paola; Della Vedova, Gianluca; Pirola, Yuri; Previtali, Marco; Rizzi, Raffaella: Computing the multi-string BWT and LCP array in external memory (2021)
  4. Giuliani, Sara; Lipták, Zsuzsanna; Masillo, Francesco; Rizzi, Romeo: When a dollar makes a BWT (2021)
  5. He, Shai; Schein, Aaron; Sarsani, Vishal; Flaherty, Patrick: A Bayesian nonparametric model for inferring subclonal populations from structured DNA sequencing data (2021)
  6. Sebastian Deorowicz, Adam Gudyś: Whisper 2: Indel-sensitive short read mapping (2021) not zbMATH
  7. Bannai, Hideo; Gagie, Travis; I, Tomohiro: Refining the (r)-index (2020)
  8. Giancarlo, Raffaele; Manzini, Giovanni; Restivo, Antonio; Rosone, Giovanna; Sciortino, Marinella: The alternating BWT: an algorithmic perspective (2020)
  9. Marchet, Camille; Lecompte, Lolita; Limasset, Antoine; Bittner, Lucie; Peterlongo, Pierre: A resource-frugal probabilistic dictionary and applications in bioinformatics (2020)
  10. Mäkinen, Veli; Norri, Tuukka: Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance (2019)
  11. Wu, Wei; Xu, Weijue; Liu, Jiangbin; Sun, Jun; Huang, Yimin; Lv, Zhibao: Exome sequencing identifies predisposing and fusion gene in ganglioneuroma, ganglioneuroblastoma and neuroblastoma (2019)
  12. Zhou, Tianjian; Sengupta, Subhajit; Müller, Peter; Ji, Yuan: TreeClone: reconstruction of tumor subclone phylogeny based on mutation pairs using next generation sequencing data (2019)
  13. Chen, Yangjun; Wu, Yujia: On the string matching with (k) mismatches (2018)
  14. Daykin, Jacqueline W.; Groult, Richard; Guesnet, Yannick; Lecroq, Thierry; Lefebvre, Arnaud; Léonard, Martine; Prieur-Gaston, Élise: A survey of string orderings and their application to the Burrows-Wheeler transform (2018)
  15. Na, Joong Chae; Kim, Hyunjoon; Min, Seunghwan; Park, Heejin; Lecroq, Thierry; Léonard, Martine; Mouchard, Laurent; Park, Kunsoo: FM-index of alignment with gaps (2018)
  16. Rabadan, Raul; Bhanot, Gyan; Marsilio, Sonia; Chiorazzi, Nicholas; Pasqualucci, Laura; Khiabanian, Hossein: On statistical modeling of sequencing noise in high depth data to assess tumor evolution (2018)
  17. Teixeira, Andreia Sofia; Fernandes, Francisco; Francisco, Alexandre P.: SpliceTAPyR -- an efficient method for transcriptome alignment (2018)
  18. Benoit, Gaetan; Lemaitre, Claire; Rizk, Guillaume; Drezen, Erwan; Lavenier, Dominique: De novo NGS data compression (2017)
  19. Daykin, Jacqueline W.; Watson, Bruce: Indeterminate string factorizations and degenerate text transformations (2017)
  20. Filion, Guillaume J.: Analytic combinatorics for computing seeding probabilities (2017)

1 2 3 next