Before revision:  We start by proposing suitable generalizations of  [  run-length  BWT , high-order entropy, and string attractors to cardinal trees (tries) .
After revision:  We start by proposing suitable generalizations of [ run-length encoded Burrows-Wheeler transform (BWT). Our first contribution is to propose a suitable generalization of the run-length BWT , high-order entropy, and string attractors to cardinal trees (tries) .