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]
No references recorded for this publication.
No citations of this publication recorded.