Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem

Abouelhoda, 2004, Replacing suffix trees with enhanced suffix arrays, J. Discrete Algorithms, 2, 53, 10.1016/S1570-8667(03)00065-0 Gusfield, 1992, An efficient algorithm for the all pairs suffix-prefix problem, Inform. Process. Lett., 41, 181, 10.1016/0020-0190(92)90176-V Gusfield, 1997 Kurtz, 1999, Reducing the space requirement of suffix trees, Software—Practice and Experience, 29, 1149, 10.1002/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O Green, 1993, Ancient conserved regions in new gene sequences and the protein databases, Science, 259, 1711, 10.1126/science.8456298 Puglisi, 2007, A taxonomy of suffix array construction algorithms, ACM Computing Surveys, 39, 1, 10.1145/1242471.1242472 Kasai, 2001, Linear-time longest-common-prefix computation in suffix arrays and its applications, vol. 2089, 181