Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
References (7)
- et al.
Replacing suffix trees with enhanced suffix arrays
J. Discrete Algorithms
(2004) - et al.
An efficient algorithm for the all pairs suffix-prefix problem
Inform. Process. Lett.
(1992) Algorithms on Strings, Trees, and Sequences
(1997)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2009 Elsevier B.V. All rights reserved.