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

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]

Authors

Enno Ohlebusch

This author has not been identified. Look up 'Enno Ohlebusch' in Google

Simon Gog

This author has not been identified. Look up 'Simon Gog' in Google