59 related articles for article (PubMed ID: 29179672)
1. HALC: High throughput algorithm for long read error correction.
Bao E; Lan L
BMC Bioinformatics; 2017 Apr; 18(1):204. PubMed ID: 28381259
[TBL] [Abstract][Full Text] [Related]
2. Scalable long read self-correction and assembly polishing with multiple sequence alignment.
Morisse P; Marchet C; Limasset A; Lecroq T; Lefebvre A
Sci Rep; 2021 Jan; 11(1):761. PubMed ID: 33436980
[TBL] [Abstract][Full Text] [Related]
3. Accurate self-correction of errors in long reads using de Bruijn graphs.
Salmela L; Walve R; Rivals E; Ukkonen E
Bioinformatics; 2017 Mar; 33(6):799-806. PubMed ID: 27273673
[TBL] [Abstract][Full Text] [Related]
4. Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences.
Li H
Bioinformatics; 2016 Jul; 32(14):2103-10. PubMed ID: 27153593
[TBL] [Abstract][Full Text] [Related]
5. NmTHC: a hybrid error correction method based on a generative neural machine translation model with transfer learning.
Wang R; Chen J
BMC Genomics; 2024 Jun; 25(1):573. PubMed ID: 38849740
[TBL] [Abstract][Full Text] [Related]
6. Indexing Arbitrary-Length k-Mers in Sequencing Reads.
Kowalski T; Grabowski S; Deorowicz S
PLoS One; 2015; 10(7):e0133198. PubMed ID: 26182400
[TBL] [Abstract][Full Text] [Related]
7. Evaluation of haplotype-aware long-read error correction with hifieval.
Guo Y; Feng X; Li H
Bioinformatics; 2023 Oct; 39(10):. PubMed ID: 37851384
[TBL] [Abstract][Full Text] [Related]
8. Illumina reads correction: evaluation and improvements.
Długosz M; Deorowicz S
Sci Rep; 2024 Jan; 14(1):2232. PubMed ID: 38278837
[TBL] [Abstract][Full Text] [Related]
9. ECHO: a reference-free short-read error correction algorithm.
Kao WC; Chan AH; Song YS
Genome Res; 2011 Jul; 21(7):1181-92. PubMed ID: 21482625
[TBL] [Abstract][Full Text] [Related]
10. Hybrid-hybrid correction of errors in long reads with HERO.
Kang X; Xu J; Luo X; Schönhuth A
Genome Biol; 2023 Dec; 24(1):275. PubMed ID: 38041098
[TBL] [Abstract][Full Text] [Related]
11. Improving transcriptome assembly through error correction of high-throughput sequence reads.
Macmanes MD; Eisen MB
PeerJ; 2013; 1():e113. PubMed ID: 23904992
[TBL] [Abstract][Full Text] [Related]
12. Benchmarking of computational error-correction methods for next-generation sequencing data.
Mitchell K; Brito JJ; Mandric I; Wu Q; Knyazev S; Chang S; Martin LS; Karlsberg A; Gerasimov E; Littman R; Hill BL; Wu NC; Yang HT; Hsieh K; Chen L; Littman E; Shabani T; Enik G; Yao D; Sun R; Schroeder J; Eskin E; Zelikovsky A; Skums P; Pop M; Mangul S
Genome Biol; 2020 Mar; 21(1):71. PubMed ID: 32183840
[TBL] [Abstract][Full Text] [Related]
13. Fast and accurate long-read assembly with wtdbg2.
Ruan J; Li H
Nat Methods; 2020 Feb; 17(2):155-158. PubMed ID: 31819265
[TBL] [Abstract][Full Text] [Related]
14. Family reunion via error correction: an efficient analysis of duplex sequencing data.
Stoler N; Arbeithuber B; Povysil G; Heinzl M; Salazar R; Makova KD; Tiemann-Boege I; Nekrutenko A
BMC Bioinformatics; 2020 Mar; 21(1):96. PubMed ID: 32131723
[TBL] [Abstract][Full Text] [Related]
15. Factorial estimating assembly base errors using
He C; Lin G; Wei H; Tang H; White FF; Valent B; Liu S
NAR Genom Bioinform; 2020 Sep; 2(3):lqaa075. PubMed ID: 33575622
[TBL] [Abstract][Full Text] [Related]
16. Calibrating Seed-Based Heuristics to Map Short Reads With Sesame.
Filion GJ; Cortini R; Zorita E
Front Genet; 2020; 11():572. PubMed ID: 32670351
[TBL] [Abstract][Full Text] [Related]
17. Efficient Seeding for Error-Prone Sequences with SubseqHash2.
Li X; Chen K; Shao M
bioRxiv; 2024 Jun; ():. PubMed ID: 38895288
[TBL] [Abstract][Full Text] [Related]
18. An optimized FM-index library for nucleotide and amino acid search.
Anderson T; Wheeler TJ
Algorithms Mol Biol; 2021 Dec; 16(1):25. PubMed ID: 34972525
[TBL] [Abstract][Full Text] [Related]
19. An efficient error correction algorithm using FM-index.
Huang YT; Huang YW
BMC Bioinformatics; 2017 Nov; 18(1):524. PubMed ID: 29179672
[TBL] [Abstract][Full Text] [Related]
20.
; ; . PubMed ID:
[No Abstract] [Full Text] [Related]
[Next] [New Search]
