The paper's headline multi-subword counting formula is invalid; a length-3 binary example returns 18 instead of 0.
Counting occurrences of some subword patterns
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.
fields
cs.CR 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints
The paper's headline multi-subword counting formula is invalid; a length-3 binary example returns 18 instead of 0.