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

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

Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 110, Issue 3, 1 January 2010, Pages 123-128

Enno Ohlebusch, Simon Gog,