These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
42. Fast inexact mapping using advanced tree exploration on backward search methods. Salavert J; Tomás A; Tárraga J; Medina I; Dopazo J; Blanquer I BMC Bioinformatics; 2015 Jan; 16():18. PubMed ID: 25626517 [TBL] [Abstract][Full Text] [Related]
43. deBGA: read alignment with de Bruijn graph-based seed and extension. Liu B; Guo H; Brudno M; Wang Y Bioinformatics; 2016 Nov; 32(21):3224-3232. PubMed ID: 27378303 [TBL] [Abstract][Full Text] [Related]
44. MICA: A fast short-read aligner that takes full advantage of Many Integrated Core Architecture (MIC). Luo R; Cheung J; Wu E; Wang H; Chan SH; Law WC; He G; Yu C; Liu CM; Zhou D; Li Y; Li R; Wang J; Zhu X; Peng S; Lam TW BMC Bioinformatics; 2015; 16 Suppl 7(Suppl 7):S10. PubMed ID: 25952019 [TBL] [Abstract][Full Text] [Related]
45. Accel-Align: a fast sequence mapper and aligner based on the seed-embed-extend method. Yan Y; Chaturvedi N; Appuswamy R BMC Bioinformatics; 2021 May; 22(1):257. PubMed ID: 34016035 [TBL] [Abstract][Full Text] [Related]
46. Efficient Seeding for Error-Prone Sequences with SubseqHash2. Li X; Chen K; Shao M bioRxiv; 2024 Jun; ():. PubMed ID: 38895288 [TBL] [Abstract][Full Text] [Related]
47. A Fast Approximate Algorithm for Mapping Long Reads to Large Reference Databases. Jain C; Dilthey A; Koren S; Aluru S; Phillippy AM J Comput Biol; 2018 Jul; 25(7):766-779. PubMed ID: 29708767 [TBL] [Abstract][Full Text] [Related]
53. Improving the sensitivity of long read overlap detection using grouped short k-mer matches. Du N; Chen J; Sun Y BMC Genomics; 2019 Apr; 20(Suppl 2):190. PubMed ID: 30967123 [TBL] [Abstract][Full Text] [Related]
54. Unicycler: Resolving bacterial genome assemblies from short and long sequencing reads. Wick RR; Judd LM; Gorrie CL; Holt KE PLoS Comput Biol; 2017 Jun; 13(6):e1005595. PubMed ID: 28594827 [TBL] [Abstract][Full Text] [Related]
56. Review of alignment and SNP calling algorithms for next-generation sequencing data. Mielczarek M; Szyda J J Appl Genet; 2016 Feb; 57(1):71-9. PubMed ID: 26055432 [TBL] [Abstract][Full Text] [Related]
57. Sensitive alignment using paralogous sequence variants improves long-read mapping and variant calling in segmental duplications. Prodanov T; Bansal V Nucleic Acids Res; 2020 Nov; 48(19):e114. PubMed ID: 33035301 [TBL] [Abstract][Full Text] [Related]
58. Accurate high throughput alignment via line sweep-based seed processing. Schmidt M; Heese K; Kutzner A Nat Commun; 2019 Apr; 10(1):1939. PubMed ID: 31028275 [TBL] [Abstract][Full Text] [Related]
59. PacRAT: a program to improve barcode-variant mapping from PacBio long reads using multiple sequence alignment. Yeh CC; Amorosi CJ; Showman S; Dunham MJ Bioinformatics; 2022 May; 38(10):2927-2929. PubMed ID: 35561209 [TBL] [Abstract][Full Text] [Related]
60. BatMis: a fast algorithm for k-mismatch mapping. Tennakoon C; Purbojati RW; Sung WK Bioinformatics; 2012 Aug; 28(16):2122-8. PubMed ID: 22689389 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]