197 related articles for article (PubMed ID: 38019768)
1. SAKE: Strobemer-assisted k-mer extraction.
Leinonen M; Salmela L
PLoS One; 2023; 18(11):e0294415. PubMed ID: 38019768
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. 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]
4. Effective sequence similarity detection with strobemers.
Sahlin K
Genome Res; 2021 Nov; 31(11):2080-2094. PubMed ID: 34667119
[No Abstract] [Full Text] [Related]
5. 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]
6. Lerna: transformer architectures for configuring error correction tools for short- and long-read genome sequencing.
Sharma A; Jain P; Mahgoub A; Zhou Z; Mahadik K; Chaterji S
BMC Bioinformatics; 2022 Jan; 23(1):25. PubMed ID: 34991450
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. A general near-exact k-mer counting method with low memory consumption enables de novo assembly of 106× human sequence data in 2.7 hours.
Shi CH; Yip KY
Bioinformatics; 2020 Dec; 36(Suppl_2):i625-i633. PubMed ID: 33381843
[TBL] [Abstract][Full Text] [Related]
9. QuorUM: An Error Corrector for Illumina Reads.
Marçais G; Yorke JA; Zimin A
PLoS One; 2015; 10(6):e0130821. PubMed ID: 26083032
[TBL] [Abstract][Full Text] [Related]
10. A hybrid and scalable error correction algorithm for indel and substitution errors of long reads.
Das AK; Goswami S; Lee K; Park SJ
BMC Genomics; 2019 Dec; 20(Suppl 11):948. PubMed ID: 31856721
[TBL] [Abstract][Full Text] [Related]
11. Improving the sensitivity of long read overlap detection using grouped short k-mer matches.
Du N; Chen J; Sun Y
BMC Genomics; 2019 Apr; 20(Suppl 2):190. PubMed ID: 30967123
[TBL] [Abstract][Full Text] [Related]
12. SPRISS: approximating frequent k-mers by sampling reads, and applications.
Santoro D; Pellegrina L; Comin M; Vandin F
Bioinformatics; 2022 Jun; 38(13):3343-3350. PubMed ID: 35583271
[TBL] [Abstract][Full Text] [Related]
13. KmerStream: streaming algorithms for k-mer abundance estimation.
Melsted P; Halldórsson BV
Bioinformatics; 2014 Dec; 30(24):3541-7. PubMed ID: 25355787
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. 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]
16. Set-Min Sketch: A Probabilistic Map for Power-Law Distributions with Application to
Shibuya Y; Belazzougui D; Kucherov G
J Comput Biol; 2022 Feb; 29(2):140-154. PubMed ID: 35049334
[No Abstract] [Full Text] [Related]
17. 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]
18. Improved assembly of noisy long reads by k-mer validation.
Carvalho AB; Dupim EG; Goldstein G
Genome Res; 2016 Dec; 26(12):1710-1720. PubMed ID: 27831497
[TBL] [Abstract][Full Text] [Related]
19. A comparative study of k-spectrum-based error correction methods for next-generation sequencing data analysis.
Akogwu I; Wang N; Zhang C; Gong P
Hum Genomics; 2016 Jul; 10 Suppl 2(Suppl 2):20. PubMed ID: 27461106
[TBL] [Abstract][Full Text] [Related]
20. CARE 2.0: reducing false-positive sequencing error corrections using machine learning.
Kallenborn F; Cascitti J; Schmidt B
BMC Bioinformatics; 2022 Jun; 23(1):227. PubMed ID: 35698033
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
