Motivated by applications in bioinformatics and image searching, in what follows, we study the classic pattern matching problem in the context of elastic-degenerate strings: the generalised notion of gapped strings. An elastic-degenerate string can be seen as an ordered collection of k strings interleaved by $k-1$ elastic-degenerate symbols, where each such elastic-degenerate symbol corresponds to a set of two or more variable-length strings. We present efficient algorithms for two variants of the pattern matching problem on elastic-degenerate strings: first, for a solid pattern and an elastic-degenerate text; second, for an elastic-degenerate pattern and a solid text. A proof-of-concept implementation of the former is provided.

受生物信息学和图像搜索中的应用的启发，在下文中，我们研究了弹性退化字符串上下文中的经典模式匹配问题：间隙字符串的广义概念。一个弹性退化字符串可以看作是k 个字符串的有序集合，由$克-1$ 弹性退化符号，其中每个这样的弹性退化符号对应于一组两个或多个可变长度的字符串。我们针对弹性退化字符串上模式匹配问题的两种变体提出了有效的算法：首先，针对实体模式和弹性退化文本；第二，用于弹性退化图案和纯文本。提供了前者的概念验证实现。