152 related articles for article (PubMed ID: 33606254)
1. 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]
2. 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]
3. 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]
4. 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]
5. Integrating long-range connectivity information into de Bruijn graphs.
Turner I; Garimella KV; Iqbal Z; McVean G
Bioinformatics; 2018 Aug; 34(15):2556-2565. PubMed ID: 29554215
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. 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]
8. 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]
9. 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]
10. Alignment of Next-Generation Sequencing Reads.
Reinert K; Langmead B; Weese D; Evers DJ
Annu Rev Genomics Hum Genet; 2015; 16():133-51. PubMed ID: 25939052
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Enhanced Compression of
Rossignolo E; Comin M
J Comput Biol; 2024 Jun; 31(6):524-538. PubMed ID: 38820168
[TBL] [Abstract][Full Text] [Related]
13. Gossamer--a resource-efficient de novo assembler.
Conway T; Wazny J; Bromage A; Zobel J; Beresford-Smith B
Bioinformatics; 2012 Jul; 28(14):1937-8. PubMed ID: 22611131
[TBL] [Abstract][Full Text] [Related]
14. Assembly of long error-prone reads using de Bruijn graphs.
Lin Y; Yuan J; Kolmogorov M; Shen MW; Chaisson M; Pevzner PA
Proc Natl Acad Sci U S A; 2016 Dec; 113(52):E8396-E8405. PubMed ID: 27956617
[TBL] [Abstract][Full Text] [Related]
15. Joker de Bruijn: Covering k-Mers Using Joker Characters.
Orenstein Y; Yu YW; Berger B
J Comput Biol; 2018 Nov; 25(11):1171-1178. PubMed ID: 30117747
[TBL] [Abstract][Full Text] [Related]
16. Efficient Colored de Bruijn Graph for Indexing Reads.
Hasegawa N; Shimizu K
J Comput Biol; 2023 Jun; 30(6):648-662. PubMed ID: 37115583
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. 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]
19. 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]
20. 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]
[Next] [New Search]
