206 related articles for article (PubMed ID: 28968408)
1. Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing.
Orenstein Y; Pellow D; Marçais G; Shamir R; Kingsford C
PLoS Comput Biol; 2017 Oct; 13(10):e1005777. PubMed ID: 28968408
[TBL] [Abstract][Full Text] [Related]
2. A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets.
Ekim B; Berger B; Orenstein Y
Res Comput Mol Biol; 2020 May; 12074():37-53. PubMed ID: 38835399
[TBL] [Abstract][Full Text] [Related]
3. Improved Analysis of High-Throughput Sequencing Data Using Small Universal k-Mer Hitting Sets.
Orenstein Y
Methods Mol Biol; 2021; 2243():95-105. PubMed ID: 33606254
[TBL] [Abstract][Full Text] [Related]
4. Efficient minimizer orders for large values of
Pellow D; Pu L; Ekim B; Kotlar L; Berger B; Shamir R; Orenstein Y
Genome Res; 2023 Jul; 33(7):1154-1161. PubMed ID: 37558282
[TBL] [Abstract][Full Text] [Related]
5. Sequence-specific minimizers via polar sets.
Zheng H; Kingsford C; Marçais G
Bioinformatics; 2021 Jul; 37(Suppl_1):i187-i195. PubMed ID: 34252928
[TBL] [Abstract][Full Text] [Related]
6. Sparse and skew hashing of K-mers.
Pibiri GE
Bioinformatics; 2022 Jun; 38(Suppl 1):i185-i194. PubMed ID: 35758794
[TBL] [Abstract][Full Text] [Related]
7. Lower Density Selection Schemes via Small Universal Hitting Sets with Short Remaining Path Length.
Zheng H; Kingsford C; Marçais G
J Comput Biol; 2021 Apr; 28(4):395-409. PubMed ID: 33325773
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. Improving the performance of minimizers and winnowing schemes.
Marçais G; Pellow D; Bork D; Orenstein Y; Shamir R; Kingsford C
Bioinformatics; 2017 Jul; 33(14):i110-i117. PubMed ID: 28881970
[TBL] [Abstract][Full Text] [Related]
10. A space and time-efficient index for the compacted colored de Bruijn graph.
Almodaresi F; Sarkar H; Srivastava A; Patro R
Bioinformatics; 2018 Jul; 34(13):i169-i177. PubMed ID: 29949982
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. 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]
13. 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]
14. ACE: accurate correction of errors using K-mer tries.
Sheikhizadeh S; de Ridder D
Bioinformatics; 2015 Oct; 31(19):3216-8. PubMed ID: 26026137
[TBL] [Abstract][Full Text] [Related]
15. AllSome Sequence Bloom Trees.
Sun C; Harris RS; Chikhi R; Medvedev P
J Comput Biol; 2018 May; 25(5):467-479. PubMed ID: 29620920
[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. 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]
18. 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]
19. 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]
20. 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]
[Next] [New Search]
