256 related articles for article (PubMed ID: 21831268)
1. Efficient counting of k-mers in DNA sequences using a bloom filter.
Melsted P; Pritchard JK
BMC Bioinformatics; 2011 Aug; 12():333. PubMed ID: 21831268
[TBL] [Abstract][Full Text] [Related]
2. A fast, lock-free approach for efficient parallel counting of occurrences of k-mers.
Marçais G; Kingsford C
Bioinformatics; 2011 Mar; 27(6):764-70. PubMed ID: 21217122
[TBL] [Abstract][Full Text] [Related]
3. Turtle: identifying frequent k-mers with cache-efficient algorithms.
Roy RS; Bhattacharya D; Schliep A
Bioinformatics; 2014 Jul; 30(14):1950-7. PubMed ID: 24618471
[TBL] [Abstract][Full Text] [Related]
4. These are not the k-mers you are looking for: efficient online k-mer counting using a probabilistic data structure.
Zhang Q; Pell J; Canino-Koning R; Howe AC; Brown CT
PLoS One; 2014; 9(7):e101271. PubMed ID: 25062443
[TBL] [Abstract][Full Text] [Related]
5. DSK: k-mer counting with very low memory usage.
Rizk G; Lavenier D; Chikhi R
Bioinformatics; 2013 Mar; 29(5):652-3. PubMed ID: 23325618
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. A general near-exact k-mer counting method with low memory consumption enables de novo assembly of 106× human sequence data in 2.7 hours.
Shi CH; Yip KY
Bioinformatics; 2020 Dec; 36(Suppl_2):i625-i633. PubMed ID: 33381843
[TBL] [Abstract][Full Text] [Related]
8. Fast detection of maximal exact matches via fixed sampling of query K-mers and Bloom filtering of index K-mers.
Liu Y; Zhang LY; Li J
Bioinformatics; 2019 Nov; 35(22):4560-4567. PubMed ID: 30994891
[TBL] [Abstract][Full Text] [Related]
9. QuorUM: An Error Corrector for Illumina Reads.
Marçais G; Yorke JA; Zimin A
PLoS One; 2015; 10(6):e0130821. PubMed ID: 26083032
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. A benchmark study of k-mer counting methods for high-throughput sequencing.
Manekar SC; Sathe SR
Gigascience; 2018 Dec; 7(12):. PubMed ID: 30346548
[TBL] [Abstract][Full Text] [Related]
12. Kmerind: A Flexible Parallel Library for K-mer Indexing of Biological Sequences on Distributed Memory Systems.
Pan T; Flick P; Jain C; Liu Y; Aluru S
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1117-1131. PubMed ID: 28991750
[TBL] [Abstract][Full Text] [Related]
13. SAKE: Strobemer-assisted k-mer extraction.
Leinonen M; Salmela L
PLoS One; 2023; 18(11):e0294415. PubMed ID: 38019768
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. Lighter: fast and memory-efficient sequencing error correction without counting.
Song L; Florea L; Langmead B
Genome Biol; 2014; 15(11):509. PubMed ID: 25398208
[TBL] [Abstract][Full Text] [Related]
16. BLight: efficient exact associative structure for k-mers.
Marchet C; Kerbiriou M; Limasset A
Bioinformatics; 2021 Sep; 37(18):2858-2865. PubMed ID: 33821954
[TBL] [Abstract][Full Text] [Related]
17. kmcEx: memory-frugal and retrieval-efficient encoding of counted k-mers.
Jiang P; Luo J; Wang Y; Deng P; Schmidt B; Tang X; Chen N; Wong L; Zhao L
Bioinformatics; 2019 Dec; 35(23):4871-4878. PubMed ID: 31038666
[TBL] [Abstract][Full Text] [Related]
18. EDAR: an efficient error detection and removal algorithm for next generation sequencing data.
Zhao X; Palmer LE; Bolanos R; Mircean C; Fasulo D; Wittenberg GM
J Comput Biol; 2010 Nov; 17(11):1549-60. PubMed ID: 20973743
[TBL] [Abstract][Full Text] [Related]
19. KCMBT: a k-mer Counter based on Multiple Burst Trees.
Mamun AA; Pal S; Rajasekaran S
Bioinformatics; 2016 Sep; 32(18):2783-90. PubMed ID: 27283950
[TBL] [Abstract][Full Text] [Related]
20. Compact representation of k-mer de Bruijn graphs for genome read assembly.
Rødland EA
BMC Bioinformatics; 2013 Oct; 14():313. PubMed ID: 24152242
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
