For any minimum piece size, the best decomposition of a word yields an eBWT with a bounded number of runs, while the worst decomposition yields the maximum possible number; the ratio is unbounded.
Classes of identities for the generalized Fibonacci numbers gn = gn−1 + gn−c from matrices with constant valued determinants.The Fibonacci Quarterly, 34(2):121–128, 1996
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform
For any minimum piece size, the best decomposition of a word yields an eBWT with a bounded number of runs, while the worst decomposition yields the maximum possible number; the ratio is unbounded.