Objective review of de novo stand‐alone error correction methods for NGS data. (11th January 2016)

• Record Type: Journal Article
• Authors: Alic, Andy S.; Ruzafa, David; Dopazo, Joaquin; Blanquer, Ignacio
• Is Part Of: Wiley interdisciplinary reviews. Volume 6:Number 2(2016:Mar./Apr.)
• Page Start: 111
• Page End: 146
• Publication Date: 2016-01-11
• Subjects: Chemistry, Physical and theoretical -- Periodicals; Cheminformatics -- Periodicals; Biochemistry -- Periodicals; 541.220285
• DOI: 10.1002/wcms.1239
• Languages: English
• ISSNs: 1759-0876

Abstract

Abstract : Abstract : The sequencing market has increased steadily over the last few years, with different approaches to read DNA information prone to different types of errors. Multiple studies demonstrated the impact of sequencing errors on different applications of next‐generation sequencing (NGS), making error correction a fundamental initial step. Different methods in the literature use different approaches and fit different types of problems. We analyzed 50 methods divided into five main approaches (k‐spectrum, suffix arrays, multiple‐sequence alignment, read clustering, and probabilistic models). They are not published as a part of a suite (stand‐alone), and target raw, unprocessed data without an existing reference genome ( de novo ). These correctors handle one or more sequencing technologies using the same or different approaches. They face general challenges (sometimes with specific traits for specific technologies) such as repetitive regions, uncalled bases, and ploidy. Even assessing their performance is a challenge in itself because of the approach taken by various authors, the unknown factor ( de novo ), and the behavior of the third‐party tools employed in the benchmarks. This study aims to help the researcher in the field to advance the field of error correction, the educator to have a brief but comprehensive companion, and the bioinformatician to choose the right tool for the right job. WIREs Comput Mol Sci 2016, 6:111–146. doi: 10.1002/wcms.1239 This article is categorized under: Computer and Information Science > Computer Algorithms and Programming