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...
Main Authors: | Katarzyna Nałęcz-Charkiewicz, Robert M. Nowak |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2022-04-01
|
Series: | BMC Bioinformatics |
Subjects: | |
Online Access: | https://doi.org/10.1186/s12859-022-04661-7 |
Similar Items
-
Quantum annealing for the adjuster routing problem
by: Naoya Mori, et al.
Published: (2023-03-01) -
Numerical Approach of Symmetric Traveling Salesman Problem Using Simulated Annealing
by: I Iryanto, et al.
Published: (2021-12-01) -
Adiabatic quantum computing impact on transport optimization in the last-mile scenario
by: Juan Francisco Ariño Sales, et al.
Published: (2023-11-01) -
An Overview of Algorithms for Solving Vehicle Routing Problems in the Quantum-Classical Cloud
by: Leonid Hulianitskyi, et al.
Published: (2023-07-01) -
Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic
by: Vincent F. Yu, et al.
Published: (2023-10-01)