A family of r-run non-binary strings maximizes the number of subsequences after t deletions, and this maximum is computable in polynomial time.
On the size distribution of the fixed-length Levenshtein balls with radius one,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Number of Subsequences in the Nonbinary Deletion Channel
A family of r-run non-binary strings maximizes the number of subsequences after t deletions, and this maximum is computable in polynomial time.