Fig. 2: Two strings with different assembly index but identical Huffman trees.
From: Assembly theory and its relationship with computational complexity
A single case such as this is sufficient to demonstrate that the assembly index cannot be a “restricted case” of Huffman coding, because it demonstrates that the assembly indices cannot be mapped one-to-one with Huffman trees.
