The paper introduces minimal and shortest absent subsequences, gives combinatorial characterizations with compact representations, and provides efficient algorithms to test membership and compute the lexicographically smallest ones along with a query data structure.
Testing k-binomial equivalence
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Two words $w_1$ and $w_2$ are said to be $k$-binomial equivalent if every non-empty word $x$ of length at most $k$ over the alphabet of $w_1$ and $w_2$ appears as a scattered factor of $w_1$ exactly as many times as it appears as a scattered factor of $w_2$. We give two different polynomial-time algorithms testing the $k$-binomial equivalence of two words. The first one is deterministic (but the degree of the corresponding polynomial is too high) and the second one is randomised (it is more direct and more efficient). These are the first known algorithms for the problem which run in polynomial time.
fields
cs.FL 1years
2021 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Absent Subsequences in Words
The paper introduces minimal and shortest absent subsequences, gives combinatorial characterizations with compact representations, and provides efficient algorithms to test membership and compute the lexicographically smallest ones along with a query data structure.