Quantum Algorithms for the Shortest Common Superstring and Text Assembling Problems

Kamil Khadiev, Carlos Manuel Bosch Machado, Zeyu Chen +1

In this paper, we consider two versions of the Text Assembling problem. We are given a sequence of strings $s^1,\dots ,s^n$ of total length $L$ that is a dictionary, and a string $t…