Machine learning meets genome assembly

Abstract : Motivation: With the recent advances in DNA sequencing technologies, the study of the genetic composition of living organisms has become more accessible for researchers. Several advances have been achieved because of it, especially in the health sciences. However, many challenges which emerge from the complexity of sequencing projects remain unsolved. Among them is the task of assembling DNA fragments from previously unsequenced organisms, which is classified as an NP-hard (nondeterministic polynomial time hard) problem, for which no efficient computational solution with reasonable execution time exists. However, several tools that produce approximate solutions have been used with results that have facilitated scientific discoveries, although there is ample room for improvement. As with other NP-hard problems, machine learning algorithms have been one of the approaches used in recent years in an attempt to find better solutions to the DNA fragment assembly problem, although still at a low scale. Results: This paper presents a broad review of pioneering literature comprising artificial intelligence-based DNA assemblers—particularly the ones that use machine learning—to provide an overview of state-of-the-art approaches and to serve as a starting point for further study in this field.
Document type :
Journal articles
Complete list of metadatas
Contributor : Annie Chateau <>
Submitted on : Thursday, March 14, 2019 - 11:37:28 AM
Last modification on : Sunday, March 17, 2019 - 1:20:31 AM




Kleber Padovani de Souza, João Carlos Setubal, André Carlos Ponce de Leon F. de Carvalho, Guilherme Oliveira, Annie Chateau, et al.. Machine learning meets genome assembly. Briefings in Bioinformatics, Oxford University Press (OUP), 2018, pp.bby072. ⟨10.1093/bib/bby072⟩. ⟨lirmm-02067457⟩



Record views