论文标题
差距约束的子序列：匹配和分析问题的复杂性界限
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems
论文作者
论文摘要
我们考虑使用差距约束的子序列，即可以嵌入弦的W长度-K子序列P，以使诱导的间隙（即，p映射到P的位置之间的W因子）满足GAP约束，$ gc =（C_1，C_1，C_2，c_2，...，...，c_，c_，c_ {k-1 {k-1 {k-1 {k-1 {k-1}）$ gc =（我们将p称为w的gc-subsecence。 In the case where the gap constraints gc are defined by lower and upper length bounds $C_i = (L^-_i, L^+_i) \in \mathbb{N}^2$ and/or regular languages $C_i \in REG$, we prove tight (conditional on the orthogonal vectors (OV) hypothesis) complexity bounds for checking whether a given p is a gc-subsequence of字符串w。我们还考虑了字符串的所有GC填充序列的整个集合，并研究了这些集合GC-SubSequerences的普遍性，等效性和遏制问题的复杂性。
We consider subsequences with gap constraints, i.e., length-k subsequences p that can be embedded into a string w such that the induced gaps (i.e., the factors of w between the positions to which p is mapped to) satisfy given gap constraints $gc = (C_1, C_2, ..., C_{k-1})$; we call p a gc-subsequence of w. In the case where the gap constraints gc are defined by lower and upper length bounds $C_i = (L^-_i, L^+_i) \in \mathbb{N}^2$ and/or regular languages $C_i \in REG$, we prove tight (conditional on the orthogonal vectors (OV) hypothesis) complexity bounds for checking whether a given p is a gc-subsequence of a string w. We also consider the whole set of all gc-subsequences of a string, and investigate the complexity of the universality, equivalence and containment problems for these sets of gc-subsequences.
