146 related articles for article (PubMed ID: 35881666)
1. TahcoRoll: fast genomic signature profiling via thinned automaton and rolling hash.
Ju CJ; Jiang JY; Li R; Li Z; Wang W
Med Rev (2021); 2021 Dec; 1(2):114-125. PubMed ID: 35881666
[TBL] [Abstract][Full Text] [Related]
2. Space-efficient computation of k-mer dictionaries for large values of k.
Díaz-Domínguez D; Leinonen M; Salmela L
Algorithms Mol Biol; 2024 Apr; 19(1):14. PubMed ID: 38581000
[TBL] [Abstract][Full Text] [Related]
3. Gerbil: a fast and memory-efficient
Erbert M; Rechner S; Müller-Hannemann M
Algorithms Mol Biol; 2017; 12():9. PubMed ID: 28373894
[TBL] [Abstract][Full Text] [Related]
4. Optimization of de novo transcriptome assembly from high-throughput short read sequencing data improves functional annotation for non-model organisms.
Haznedaroglu BZ; Reeves D; Rismani-Yazdi H; Peccia J
BMC Bioinformatics; 2012 Jul; 13():170. PubMed ID: 22808927
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. DSK: k-mer counting with very low memory usage.
Rizk G; Lavenier D; Chikhi R
Bioinformatics; 2013 Mar; 29(5):652-3. PubMed ID: 23325618
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. 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]
9. SAKE: Strobemer-assisted k-mer extraction.
Leinonen M; Salmela L
PLoS One; 2023; 18(11):e0294415. PubMed ID: 38019768
[TBL] [Abstract][Full Text] [Related]
10. MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs.
Li D; Huang Y; Leung CM; Luo R; Ting HF; Lam TW
BMC Bioinformatics; 2017 Oct; 18(Suppl 12):408. PubMed ID: 29072142
[TBL] [Abstract][Full Text] [Related]
11. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
[TBL] [Abstract][Full Text] [Related]
12. Multiplex de Bruijn graphs enable genome assembly from long, high-fidelity reads.
Bankevich A; Bzikadze AV; Kolmogorov M; Antipov D; Pevzner PA
Nat Biotechnol; 2022 Jul; 40(7):1075-1081. PubMed ID: 35228706
[TBL] [Abstract][Full Text] [Related]
13. Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs.
Limasset A; Flot JF; Peterlongo P
Bioinformatics; 2020 Mar; 36(5):1374-1381. PubMed ID: 30785192
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. 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]
16. An efficient classification algorithm for NGS data based on text similarity.
Liao X; Liao X; Zhu W; Fang L; Chen X
Genet Res (Camb); 2018 Sep; 100():e8. PubMed ID: 30221607
[TBL] [Abstract][Full Text] [Related]
17. Querying large read collections in main memory: a versatile data structure.
Philippe N; Salson M; Lecroq T; Léonard M; Commes T; Rivals E
BMC Bioinformatics; 2011 Jun; 12():242. PubMed ID: 21682852
[TBL] [Abstract][Full Text] [Related]
18. 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]
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. 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]
[Next] [New Search]
