You can do some minor optimizations, but this should be good enough.
If you want utmost performance, you can preprocess the dictionary (which is known in advance) and create a directed acyclic graph of sub-anagram relationship.