138 related articles for article (PubMed ID: 31800307)
1. Iterative Spaced Seed Hashing: Closing the Gap Between Spaced Seed Hashing and
Petrucci E; Noé L; Pizzi C; Comin M
J Comput Biol; 2020 Feb; 27(2):223-233. PubMed ID: 31800307
[No Abstract] [Full Text] [Related]
2. FSH: fast spaced seed hashing exploiting adjacent hashes.
Girotto S; Comin M; Pizzi C
Algorithms Mol Biol; 2018; 13():8. PubMed ID: 29588651
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. ntHash2: recursive spaced seed hashing for nucleotide sequences.
Kazemi P; Wong J; Nikolić V; Mohamadi H; Warren RL; Birol I
Bioinformatics; 2022 Oct; 38(20):4812-4813. PubMed ID: 36000872
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
7. 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]
8. ntHash: recursive nucleotide hashing.
Mohamadi H; Chu J; Vandervalk BP; Birol I
Bioinformatics; 2016 Nov; 32(22):3492-3494. PubMed ID: 27423894
[TBL] [Abstract][Full Text] [Related]
9. aaHash: recursive amino acid sequence hashing.
Wong J; Kazemi P; Coombe L; Warren RL; Birol I
bioRxiv; 2023 May; ():. PubMed ID: 37214907
[TBL] [Abstract][Full Text] [Related]
10. aaHash: recursive amino acid sequence hashing.
Wong J; Kazemi P; Coombe L; Warren RL; Birol I
Bioinform Adv; 2023; 3(1):vbad162. PubMed ID: 38023332
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Spectral Jaccard Similarity: A New Approach to Estimating Pairwise Sequence Alignments.
Baharav TZ; Kamath GM; Tse DN; Shomorony I
Patterns (N Y); 2020 Sep; 1(6):100081. PubMed ID: 33205128
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. Efficient computation of spaced seeds.
Ilie S
BMC Res Notes; 2012 Feb; 5():123. PubMed ID: 22373455
[TBL] [Abstract][Full Text] [Related]
15. Effective sequence similarity detection with strobemers.
Sahlin K
Genome Res; 2021 Nov; 31(11):2080-2094. PubMed ID: 34667119
[No Abstract] [Full Text] [Related]
16. 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]
17. LexicHash: sequence similarity estimation via lexicographic comparison of hashes.
Greenberg G; Ravi AN; Shomorony I
Bioinformatics; 2023 Nov; 39(11):. PubMed ID: 37878809
[TBL] [Abstract][Full Text] [Related]
18. Hierarchical Recurrent Neural Hashing for Image Retrieval With Hierarchical Convolutional Features.
Lu X; Chen Y; Li X
IEEE Trans Image Process; 2018 Jan.; 27(1):106-120. PubMed ID: 28952940
[TBL] [Abstract][Full Text] [Related]
19. CHTKC: a robust and efficient k-mer counting algorithm based on a lock-free chaining hash table.
Wang J; Chen S; Dong L; Wang G
Brief Bioinform; 2021 May; 22(3):. PubMed ID: 32438416
[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]
