Paper
30 January 2022 Quantum algorithm for the shortest superstring problem
Author Affiliations +
Proceedings Volume 12157, International Conference on Micro- and Nano-Electronics 2021; 1215724 (2022) https://doi.org/10.1117/12.2624618
Event: International Conference on Micro- and Nano-Electronics 2021, 2021, Zvenigorod, Russian Federation
Abstract
In this paper, we consider the “Shortest Superstring Problem”(SSP) or the “Shortest Common Superstring Problem”(SCS). The problem is as follows. For a positive integer n, a sequence of n strings S = (s1, . . . , sn) is given. We should construct the shortest string t (we call it superstring) that contains each string from the given sequence as a substring. The problem is connected with the sequence assembly method for reconstructing a long DNA sequence from small fragments. We present a quantum algorithm with running time O∗(1.728n). Here O∗ notation does not consider polynomials of n and the length of t.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kamil Khadiev and Carlos Manuel Bosch Machado "Quantum algorithm for the shortest superstring problem", Proc. SPIE 12157, International Conference on Micro- and Nano-Electronics 2021, 1215724 (30 January 2022); https://doi.org/10.1117/12.2624618
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Quantum computing

Algorithms

Computer programming

Error analysis

Quantum information

RELATED CONTENT


Back to Top