155 related articles for article (PubMed ID: 27423894)
1. 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]
2. 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]
3. ntCard: a streaming algorithm for cardinality estimation in genomics data.
Mohamadi H; Khan H; Birol I
Bioinformatics; 2017 May; 33(9):1324-1330. PubMed ID: 28453674
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. 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]
6. 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]
7. 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]
8. 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]
9. kmcEx: memory-frugal and retrieval-efficient encoding of counted k-mers.
Jiang P; Luo J; Wang Y; Deng P; Schmidt B; Tang X; Chen N; Wong L; Zhao L
Bioinformatics; 2019 Dec; 35(23):4871-4878. PubMed ID: 31038666
[TBL] [Abstract][Full Text] [Related]
10. Locality-sensitive hashing for the edit distance.
Marçais G; DeBlasio D; Pandey P; Kingsford C
Bioinformatics; 2019 Jul; 35(14):i127-i135. PubMed ID: 31510667
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. A fast, lock-free approach for efficient parallel counting of occurrences of k-mers.
Marçais G; Kingsford C
Bioinformatics; 2011 Mar; 27(6):764-70. PubMed ID: 21217122
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. ChopStitch: exon annotation and splice graph construction using transcriptome assembly and whole genome sequencing data.
Khan H; Mohamadi H; Vandervalk BP; Warren RL; Chu J; Birol I
Bioinformatics; 2018 May; 34(10):1697-1704. PubMed ID: 29300846
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. 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]
17. 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]
18. Fast detection of maximal exact matches via fixed sampling of query K-mers and Bloom filtering of index K-mers.
Liu Y; Zhang LY; Li J
Bioinformatics; 2019 Nov; 35(22):4560-4567. PubMed ID: 30994891
[TBL] [Abstract][Full Text] [Related]
19. These are not the k-mers you are looking for: efficient online k-mer counting using a probabilistic data structure.
Zhang Q; Pell J; Canino-Koning R; Howe AC; Brown CT
PLoS One; 2014; 9(7):e101271. PubMed ID: 25062443
[TBL] [Abstract][Full Text] [Related]
20. A randomized optimal k-mer indexing approach for efficient parallel genome sequence compression.
Roy S; Mukhopadhyay A
Gene; 2024 May; 907():148235. PubMed ID: 38342250
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
