206 related articles for article (PubMed ID: 25398208)
1. Lighter: fast and memory-efficient sequencing error correction without counting.
Song L; Florea L; Langmead B
Genome Biol; 2014; 15(11):509. PubMed ID: 25398208
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. LightAssembler: fast and memory-efficient assembly algorithm for high-throughput sequencing reads.
El-Metwally S; Zakaria M; Hamza T
Bioinformatics; 2016 Nov; 32(21):3215-3223. PubMed ID: 27412092
[TBL] [Abstract][Full Text] [Related]
4. Efficient counting of k-mers in DNA sequences using a bloom filter.
Melsted P; Pritchard JK
BMC Bioinformatics; 2011 Aug; 12():333. PubMed ID: 21831268
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
7. 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]
8. A benchmark study of k-mer counting methods for high-throughput sequencing.
Manekar SC; Sathe SR
Gigascience; 2018 Dec; 7(12):. PubMed ID: 30346548
[TBL] [Abstract][Full Text] [Related]
9. AllSome Sequence Bloom Trees.
Sun C; Harris RS; Chikhi R; Medvedev P
J Comput Biol; 2018 May; 25(5):467-479. PubMed ID: 29620920
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing.
Orenstein Y; Pellow D; Marçais G; Shamir R; Kingsford C
PLoS Comput Biol; 2017 Oct; 13(10):e1005777. PubMed ID: 28968408
[TBL] [Abstract][Full Text] [Related]
12. RACER: Rapid and accurate correction of errors in reads.
Ilie L; Molnar M
Bioinformatics; 2013 Oct; 29(19):2490-3. PubMed ID: 23853064
[TBL] [Abstract][Full Text] [Related]
13. AlienTrimmer: a tool to quickly and accurately trim off multiple short contaminant sequences from high-throughput sequencing reads.
Criscuolo A; Brisse S
Genomics; 2013; 102(5-6):500-6. PubMed ID: 23912058
[TBL] [Abstract][Full Text] [Related]
14. Improving Bloom Filter Performance on Sequence Data Using k-mer Bloom Filters.
Pellow D; Filippova D; Kingsford C
J Comput Biol; 2017 Jun; 24(6):547-557. PubMed ID: 27828710
[TBL] [Abstract][Full Text] [Related]
15. AfterQC: automatic filtering, trimming, error removing and quality control for fastq data.
Chen S; Huang T; Zhou Y; Han Y; Xu M; Gu J
BMC Bioinformatics; 2017 Mar; 18(Suppl 3):80. PubMed ID: 28361673
[TBL] [Abstract][Full Text] [Related]
16. fimpera: drastic improvement of Approximate Membership Query data-structures with counts.
Robidou L; Peterlongo P
Bioinformatics; 2023 May; 39(5):. PubMed ID: 37195454
[TBL] [Abstract][Full Text] [Related]
17. Konnector v2.0: pseudo-long reads from paired-end sequencing data.
Vandervalk BP; Yang C; Xue Z; Raghavan K; Chu J; Mohamadi H; Jackman SD; Chiu R; Warren RL; Birol I
BMC Med Genomics; 2015; 8 Suppl 3(Suppl 3):S1. PubMed ID: 26399504
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. A parallel algorithm for error correction in high-throughput short-read data on CUDA-enabled graphics hardware.
Shi H; Schmidt B; Liu W; Müller-Wittig W
J Comput Biol; 2010 Apr; 17(4):603-15. PubMed ID: 20426693
[TBL] [Abstract][Full Text] [Related]
20. MQF and buffered MQF: quotient filters for efficient storage of k-mers with their counts and metadata.
Shokrof M; Brown CT; Mansour TA
BMC Bioinformatics; 2021 Feb; 22(1):71. PubMed ID: 33593271
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
