Enno Ohlebusch, Simon Gog. Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem. Inf. Process. Lett., 110(3):123-128, 2010. [doi]
@article{OhlebuschG10-0,
title = {Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem},
author = {Enno Ohlebusch and Simon Gog},
year = {2010},
doi = {10.1016/j.ipl.2009.10.015},
url = {http://dx.doi.org/10.1016/j.ipl.2009.10.015},
researchr = {https://researchr.org/publication/OhlebuschG10-0},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {110},
number = {3},
pages = {123-128},
}