This analysis reveals how injective morphisms influence BWT-run count in binary alphabets, indicating patterns of repetitiveness.
Key Points
The application of injective morphisms alters the number of equal-letter runs in the Burrows-Wheeler Transform (BWT), specifically for binary alphabets.
A class of morphisms preserves BWT-runs with a bounded additive increase, linking them to primitivity-preserving morphisms.
Determining whether a binary morphism maintains bounded BWT-run sensitivity can be achieved in polynomial time based on image lengths.
New structural properties of morphisms provide insights into their connections with BWT-based compressibility and code theory.