114 related articles for article (PubMed ID: 38835399)
1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]
7. Improved design and analysis of practical minimizers.
Zheng H; Kingsford C; Marçais G
Bioinformatics; 2020 Jul; 36(Suppl_1):i119-i127. PubMed ID: 32657376
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. 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]
10. Compact and evenly distributed k-mer binning for genomic sequences.
Nyström-Persson J; Keeble-Gagnère G; Zawad N
Bioinformatics; 2021 Sep; 37(17):2563-2569. PubMed ID: 33693556
[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. 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]
13. A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays.
Khan Z; Bloom JS; Kruglyak L; Singh M
Bioinformatics; 2009 Jul; 25(13):1609-16. PubMed ID: 19389736
[TBL] [Abstract][Full Text] [Related]
14. ntCard: a streaming algorithm for cardinality estimation in genomics data.
Mohamadi H; Khan H; Birol I
Bioinformatics; 2017 May; 33(9):1324-1330. PubMed ID: 28453674
[TBL] [Abstract][Full Text] [Related]
15. Microbiome-based classification models for fresh produce safety and quality evaluation.
Liao C; Wang L; Quon G
Microbiol Spectr; 2024 Apr; 12(4):e0344823. PubMed ID: 38445872
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Data Set-Adaptive Minimizer Order Reduces Memory Usage in
Flomin D; Pellow D; Shamir R
J Comput Biol; 2022 Aug; 29(8):825-838. PubMed ID: 35527644
[TBL] [Abstract][Full Text] [Related]
18. Space-efficient computation of k-mer dictionaries for large values of k.
Díaz-Domínguez D; Leinonen M; Salmela L
Algorithms Mol Biol; 2024 Apr; 19(1):14. PubMed ID: 38581000
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. Querying large read collections in main memory: a versatile data structure.
Philippe N; Salson M; Lecroq T; Léonard M; Commes T; Rivals E
BMC Bioinformatics; 2011 Jun; 12():242. PubMed ID: 21682852
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]