An elastic-degenerate string is a sequence of n sets of strings of total length N. It has been introduced to represent a multiple alignment of several closely-related sequences (e.g., pan-genome) compactly. In this representation, substrings of these sequences that match exactly are collapsed, while in positions where the sequences differ, all possible variants observed at that location are listed. The natural problem that arises is finding all matches of a deterministic pattern of length m in an elastic-degenerate text. There exists a non-combinatorial O(nm1.381+N)-time algorithm to solve this problem on-line [1]. In this paper, we study the same problem under the edit distance model and present an O(k2mG+kN)-time and O(m)-space algorithm, where G is the total number of strings in the elastic-degenerate text and k is the maximum edit distance allowed. We also present a simple O(kmG+kN)-time and O(m)-space algorithm for solving the problem under Hamming distance.

, , , ,
Theoretical Computer Science
Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands

Bernardini, G., Pisanti, N., Pissis, S., & Rosone, G. (2019). Approximate pattern matching on elastic-degenerate text. Theoretical Computer Science, 812, 109–122. doi:10.1016/j.tcs.2019.08.012