For "number of substrings", instead of doing DP over the DAG structure, I think we just have to add up len(u) - len(link(u)) (which is # of strings in the state) over all non-root state u. Similar for "total length of all different substrings" as well.