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.
143 related articles for article (PubMed ID: 34154632)
21. Improving Bloom Filter Performance on Sequence Data Using k-mer Bloom Filters. Pellow D; Filippova D; Kingsford C J Comput Biol; 2017 Jun; 24(6):547-557. PubMed ID: 27828710 [TBL] [Abstract][Full Text] [Related]
22. On the Maximal Independent Sets of Ma L; Chen K; Shao M ACM BCB; 2023 Sep; 2023():. PubMed ID: 38050580 [TBL] [Abstract][Full Text] [Related]
23. Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs. Limasset A; Flot JF; Peterlongo P Bioinformatics; 2020 Mar; 36(5):1374-1381. PubMed ID: 30785192 [TBL] [Abstract][Full Text] [Related]
24. Gerbil: a fast and memory-efficient Erbert M; Rechner S; Müller-Hannemann M Algorithms Mol Biol; 2017; 12():9. PubMed ID: 28373894 [TBL] [Abstract][Full Text] [Related]
25. Fulgor: A fast and compact Fan J; Singh NP; Khan J; Pibiri GE; Patro R bioRxiv; 2023 May; ():. PubMed ID: 37214944 [TBL] [Abstract][Full Text] [Related]
27. In silico read normalization using set multi-cover optimization. Durai DA; Schulz MH Bioinformatics; 2018 Oct; 34(19):3273-3280. PubMed ID: 29912280 [TBL] [Abstract][Full Text] [Related]
28. A randomized optimal k-mer indexing approach for efficient parallel genome sequence compression. Roy S; Mukhopadhyay A Gene; 2024 May; 907():148235. PubMed ID: 38342250 [TBL] [Abstract][Full Text] [Related]
29. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs. Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174 [TBL] [Abstract][Full Text] [Related]
30. Theory of local k-mer selection with applications to long-read alignment. Shaw J; Yu YW Bioinformatics; 2022 Oct; 38(20):4659-4669. PubMed ID: 36124869 [TBL] [Abstract][Full Text] [Related]
31. SAKE: Strobemer-assisted k-mer extraction. Leinonen M; Salmela L PLoS One; 2023; 18(11):e0294415. PubMed ID: 38019768 [TBL] [Abstract][Full Text] [Related]
32. Squeakr: an exact and approximate k-mer counting system. Pandey P; Bender MA; Johnson R; Patro R; Berger B Bioinformatics; 2018 Feb; 34(4):568-575. PubMed ID: 29444235 [TBL] [Abstract][Full Text] [Related]
34. Estimating the Manekar SC; Sathe SR Curr Genomics; 2019 Jan; 20(1):2-15. PubMed ID: 31015787 [TBL] [Abstract][Full Text] [Related]
35. StLiter: A Novel Algorithm to Iteratively Build the Compacted de Bruijn Graph From Many Complete Genomes. Yu C; Mao K; Zhao Y; Chang C; Wang G IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(4):2471-2483. PubMed ID: 33630738 [TBL] [Abstract][Full Text] [Related]
36. A FASTQ compressor based on integer-mapped k-mer indexing for biologist. Zhang Y; Patel K; Endrawis T; Bowers A; Sun Y Gene; 2016 Mar; 579(1):75-81. PubMed ID: 26743127 [TBL] [Abstract][Full Text] [Related]
37. Fast Approximation of Frequent Pellegrina L; Pizzi C; Vandin F J Comput Biol; 2020 Apr; 27(4):534-549. PubMed ID: 31891535 [TBL] [Abstract][Full Text] [Related]
38. CMash: fast, multi-resolution estimation of k-mer-based Jaccard and containment indices. Liu S; Koslicki D Bioinformatics; 2022 Jun; 38(Suppl 1):i28-i35. PubMed ID: 35758788 [TBL] [Abstract][Full Text] [Related]
39. deBGR: an efficient and near-exact representation of the weighted de Bruijn graph. Pandey P; Bender MA; Johnson R; Patro R Bioinformatics; 2017 Jul; 33(14):i133-i141. PubMed ID: 28881995 [TBL] [Abstract][Full Text] [Related]
40. KCOSS: an ultra-fast k-mer counter for assembled genome analysis. Tang D; Li Y; Tan D; Fu J; Tang Y; Lin J; Zhao R; Du H; Zhao Z Bioinformatics; 2022 Jan; 38(4):933-940. PubMed ID: 34849595 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]