Describir: Using the sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem.