156 related articles for article (PubMed ID: 37558282)
1. 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]
2. 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]
3. A simple refined DNA minimizer operator enables 2-fold faster computation.
Pan C; Reinert K
Bioinformatics; 2024 Feb; 40(2):. PubMed ID: 38269626
[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. 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]
6. Creating and Using Minimizer Sketches in Computational Genomics.
Zheng H; Marçais G; Kingsford C
J Comput Biol; 2023 Dec; 30(12):1251-1276. PubMed ID: 37646787
[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. 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]
9. 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]
10. Comparing fixed sampling with minimizer sampling when using k-mer indexes to find maximal exact matches.
Almutairy M; Torng E
PLoS One; 2018; 13(2):e0189960. PubMed ID: 29389989
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Weighted minimizer sampling improves long read mapping.
Jain C; Rhie A; Zhang H; Chu C; Walenz BP; Koren S; Phillippy AM
Bioinformatics; 2020 Jul; 36(Suppl_1):i111-i118. PubMed ID: 32657365
[TBL] [Abstract][Full Text] [Related]
13. Syncmers are more sensitive than minimizers for selecting conserved
Edgar R
PeerJ; 2021; 9():e10805. PubMed ID: 33604186
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. 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]
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. Differentiable Learning of Sequence-Specific Minimizer Schemes with DeepMinimizer.
Hoang M; Zheng H; Kingsford C
J Comput Biol; 2022 Dec; 29(12):1288-1304. PubMed ID: 36095142
[TBL] [Abstract][Full Text] [Related]
18. Sketching methods with small window guarantee using minimum decycling sets.
Marçais G; DeBlasio D; Kingsford C
ArXiv; 2023 Nov; ():. PubMed ID: 37986724
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. 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]
[Next] [New Search]
