Isomorphic unordered labeled trees up to substitution ciphering

Florian Ingels, Romain Azaïs

Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the…