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 used, for example, in medical diagnostics. However, this is hampered by the slowness and computational requirements of the current processing algorithms, which raises the need to develop more efficient algorithms. One possible approach, still little explored, is the use of quantum computing.

Results

We present a proof of concept of de novo assembly algorithm, using the Genomic Signal Processing approach, detecting overlaps between DNA reads by calculating the Pearson correlation coefficie

SUBMITTER: Nalecz-Charkiewicz K 

PROVIDER: S-EPMC8988116 | biostudies-literature | 2022 Apr

REPOSITORIES: biostudies-literature