Algorithm for DNA sequence assembly by quantum annealing

Algorithm for DNA sequence assembly by quantum annealing

Abstract Background The assembly task is an indispensable step in sequencing genomes of new organisms and studying structural genomic changes. In recent years, the dynamic development of next-generation sequencing (NGS) methods raises hopes for making whole-genome sequencing a fast and reliable tool...

Full description

Bibliographic Details
Main Authors: Katarzyna Nałęcz-Charkiewicz, Robert M. Nowak
Format: Article
Language:English
Published: BMC 2022-04-01
Series:BMC Bioinformatics
Subjects:
De novo assembly
Quantum annealing
Hybrid algorithm
Travelling salesman problem
TSP
Vehicle routing problem
Online Access:https://doi.org/10.1186/s12859-022-04661-7

Internet

https://doi.org/10.1186/s12859-022-04661-7

Similar Items