With the cost assignment of 1 to D, 2 to T and 1 to L, the pattern presented has two possible most parsimonious solutions, using a transfer or a duplication and a loss, both with cost 2. So if we have a tree where the pattern appear multiple times the number of possible most parsimonious solutions tends to be exponential.
Own work
Hugo Menet