Faster implementation of a shortest superstring approximation

Blum, 1991, Linear approximation of shortest superstrings, Proc. 23rd Ann. ACM Symp. on theory of computing, 328 Garey, 1979 Gusfield, 1992, An efficient algorithm for the all pairs suffix-prefix problem, Inform. Process. Lett., 41, 181, 10.1016/0020-0190(92)90176-V Knuth, 1977, Fast pattern matching in strings, SIAM J. Comput., 6, 189, 10.1137/0206024 Mayer, 1982, Combinatorial algorithms 1 Teng, 1993, Approximating shortest superstrings, Proc. 34th Ann. IEEE Symp. on Foundations of Computer Science