145 related articles for article (PubMed ID: 19208114)
1. Finding optimal threshold for correction error reads in DNA assembling.
Chin FY; Leung HC; Li WL; Yiu SM
BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S15. PubMed ID: 19208114
[TBL] [Abstract][Full Text] [Related]
2. EDAR: an efficient error detection and removal algorithm for next generation sequencing data.
Zhao X; Palmer LE; Bolanos R; Mircean C; Fasulo D; Wittenberg GM
J Comput Biol; 2010 Nov; 17(11):1549-60. PubMed ID: 20973743
[TBL] [Abstract][Full Text] [Related]
3. Genome comparison without alignment using shortest unique substrings.
Haubold B; Pierstorff N; Möller F; Wiehe T
BMC Bioinformatics; 2005 May; 6():123. PubMed ID: 15910684
[TBL] [Abstract][Full Text] [Related]
4. Sequence assembly using next generation sequencing data--challenges and solutions.
Chin FY; Leung HC; Yiu SM
Sci China Life Sci; 2014 Nov; 57(11):1140-8. PubMed ID: 25326069
[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. EC: an efficient error correction algorithm for short reads.
Saha S; Rajasekaran S
BMC Bioinformatics; 2015; 16 Suppl 17(Suppl 17):S2. PubMed ID: 26678663
[TBL] [Abstract][Full Text] [Related]
7. Correcting short reads with high error rates for improved sequencing result.
Wong TK; Lam TW; Chan PY; Yiu SM
Int J Bioinform Res Appl; 2009; 5(2):224-37. PubMed ID: 19324607
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings.
Allen DR; Thankachan SV; Xu B
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):138-148. PubMed ID: 31985439
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. Illumina error correction near highly repetitive DNA regions improves de novo genome assembly.
Heydari M; Miclotte G; Van de Peer Y; Fostier J
BMC Bioinformatics; 2019 Jun; 20(1):298. PubMed ID: 31159722
[TBL] [Abstract][Full Text] [Related]
12. misFinder: identify mis-assemblies in an unbiased manner using reference and paired-end reads.
Zhu X; Leung HC; Wang R; Chin FY; Yiu SM; Quan G; Li Y; Zhang R; Jiang Q; Liu B; Dong Y; Zhou G; Wang Y
BMC Bioinformatics; 2015 Nov; 16():386. PubMed ID: 26573684
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. Efficient assembly of nanopore reads via highly accurate and intact error correction.
Chen Y; Nie F; Xie SQ; Zheng YF; Dai Q; Bray T; Wang YX; Xing JF; Huang ZJ; Wang DP; He LJ; Luo F; Wang JX; Liu YZ; Xiao CL
Nat Commun; 2021 Jan; 12(1):60. PubMed ID: 33397900
[TBL] [Abstract][Full Text] [Related]
15. Correction of sequencing errors in a mixed set of reads.
Salmela L
Bioinformatics; 2010 May; 26(10):1284-90. PubMed ID: 20378555
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. De novo fragment assembly with short mate-paired reads: Does the read length matter?
Chaisson MJ; Brinza D; Pevzner PA
Genome Res; 2009 Feb; 19(2):336-46. PubMed ID: 19056694
[TBL] [Abstract][Full Text] [Related]
18. Towards a theoretical understanding of false positives in DNA motif finding.
Zia A; Moses AM
BMC Bioinformatics; 2012 Jun; 13():151. PubMed ID: 22738169
[TBL] [Abstract][Full Text] [Related]
19. Aberration-corrected ultrafine analysis of miRNA reads at single-base resolution: a k-mer lattice approach.
Zhang X; Ping P; Hutvagner G; Blumenstein M; Li J
Nucleic Acids Res; 2021 Oct; 49(18):e106. PubMed ID: 34291293
[TBL] [Abstract][Full Text] [Related]
20. Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model.
Chen ZZ; Wang L
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1400-10. PubMed ID: 21282867
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
