Year: 2022
Type: conference-paper
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.
DOI: 10.1117/12.2624618
Authors: Kamil Khadiev, Carlos M. Bosch Machado
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Award: G5975831255
OpenAlex ID: W4210787757
