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.
5. Efficient computation of spaced seeds. Ilie S BMC Res Notes; 2012 Feb; 5():123. PubMed ID: 22373455 [TBL] [Abstract][Full Text] [Related]
6. Global, highly specific and fast filtering of alignment seeds. Ebel M; Migliorelli G; Stanke M BMC Bioinformatics; 2022 Jun; 23(1):225. PubMed ID: 35689182 [TBL] [Abstract][Full Text] [Related]
7. Effects of spaced k-mers on alignment-free genotyping. Häntze H; Horton P Bioinformatics; 2023 Jun; 39(39 Suppl 1):i213-i221. PubMed ID: 37387138 [TBL] [Abstract][Full Text] [Related]
8. Optimizing Spaced k-mer Neighbors for Efficient Filtration in Protein Similarity Search. Li W; Ma B; Zhang K IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):398-406. PubMed ID: 26355786 [TBL] [Abstract][Full Text] [Related]
9. PerFSeeB: designing long high-weight single spaced seeds for full sensitivity alignment with a given number of mismatches. Titarenko V; Titarenko S BMC Bioinformatics; 2023 Oct; 24(1):396. PubMed ID: 37875804 [TBL] [Abstract][Full Text] [Related]
11. SpEED: fast computation of sensitive spaced seeds. Ilie L; Ilie S; Bigvand AM Bioinformatics; 2011 Sep; 27(17):2433-4. PubMed ID: 21690104 [TBL] [Abstract][Full Text] [Related]
12. An empirical study of choosing efficient discriminative seeds for oligonucleotide design. Chung WH; Park SB BMC Genomics; 2009 Dec; 10 Suppl 3(Suppl 3):S3. PubMed ID: 19958494 [TBL] [Abstract][Full Text] [Related]
13. 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]
14. 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]
16. Mismatch-tolerant, alignment-free sequence classification using multiple spaced seeds and multiindex Bloom filters. Chu J; Mohamadi H; Erhan E; Tse J; Chiu R; Yeo S; Birol I Proc Natl Acad Sci U S A; 2020 Jul; 117(29):16961-16968. PubMed ID: 32641514 [TBL] [Abstract][Full Text] [Related]
17. CMash: fast, multi-resolution estimation of k-mer-based Jaccard and containment indices. Liu S; Koslicki D Bioinformatics; 2022 Jun; 38(Suppl 1):i28-i35. PubMed ID: 35758788 [TBL] [Abstract][Full Text] [Related]
18. Extraction of long k-mers using spaced seeds. Leinonen M; Salmela L IEEE/ACM Trans Comput Biol Bioinform; 2021 Sep; PP():. PubMed ID: 34529572 [TBL] [Abstract][Full Text] [Related]
19. 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]
20. Fast Metagenomic Binning via Hashing and Bayesian Clustering. Popic V; Kuleshov V; Snyder M; Batzoglou S J Comput Biol; 2018 Jul; 25(7):677-688. PubMed ID: 29658784 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]