Algorithm for DNA sequence assembly by quantum annealing

Algorithm for DNA sequence assembly by quantum annealing

Show other versions (1)

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 used, f...

Full description

Bibliographic Details
Main Authors: Nałęcz-Charkiewicz, K. (Author), Nowak, R.M (Author)
Format: Article
Language:English
Published: BioMed Central Ltd 2022
Subjects:
Annealing
Assembly tasks
Bioinformatics
Biology
Computational complexity
Computational efficiency
Correlation methods
De novo assemblies
De novo assembly
Diagnosis
DNA
DNA sequence assembly
DNA sequences
Heuristic algorithms
Hybrid algorithm
Hybrid algorithms
Proof of concept
Quantum annealing
Routing algorithms
Signal processing
Structural genomics
Traveling salesman problem
Travelling salesman problem
TSP
Vehicle routing
Vehicle routing problem
Vehicle Routing Problems
VRP
Online Access:View Fulltext in Publisher

Internet

View Fulltext in Publisher

Similar Items