These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
6. 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]
7. 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]
8. Syncmers are more sensitive than minimizers for selecting conserved Edgar R PeerJ; 2021; 9():e10805. PubMed ID: 33604186 [TBL] [Abstract][Full Text] [Related]
9. 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]
10. 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]
11. KMC 2: fast and resource-frugal k-mer counting. Deorowicz S; Kokot M; Grabowski S; Debudaj-Grabysz A Bioinformatics; 2015 May; 31(10):1569-76. PubMed ID: 25609798 [TBL] [Abstract][Full Text] [Related]
12. Theory of local k-mer selection with applications to long-read alignment. Shaw J; Yu YW Bioinformatics; 2022 Oct; 38(20):4659-4669. PubMed ID: 36124869 [TBL] [Abstract][Full Text] [Related]
13. On Minimizers and Convolutional Filters: Theoretical Connections and Applications to Genome Analysis. Yu YW J Comput Biol; 2024 May; 31(5):381-395. PubMed ID: 38687333 [No Abstract] [Full Text] [Related]
14. On the representation of de Bruijn graphs. Chikhi R; Limasset A; Jackman S; Simpson JT; Medvedev P J Comput Biol; 2015 May; 22(5):336-52. PubMed ID: 25629448 [TBL] [Abstract][Full Text] [Related]
15. 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]
16. Efficient computation of spaced seed hashing with block indexing. Girotto S; Comin M; Pizzi C BMC Bioinformatics; 2018 Nov; 19(Suppl 15):441. PubMed ID: 30497364 [TBL] [Abstract][Full Text] [Related]
17. 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]
18. Density and Conservation Optimization of the Generalized Masked-Minimizer Sketching Scheme. Hoang M; Marçais G; Kingsford C J Comput Biol; 2024 Jan; 31(1):2-20. PubMed ID: 37975802 [TBL] [Abstract][Full Text] [Related]
19. 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]
20. Reverse de Bruijn: Utilizing Reverse Peptide Synthesis to Cover All Amino Acid Orenstein Y J Comput Biol; 2020 Mar; 27(3):376-385. PubMed ID: 31995404 [No Abstract] [Full Text] [Related] [Next] [New Search]