In this article we propose an optimal algorithm that is faster and more space-efficient in practice using also (generalized) enhanced suffix arrays.

In this article, we present another optimal algorithm based on enhanced suffix arrays which further improves the practical running time.

May 13, 2016 · Finding all longest suffix-prefix matches for a collection of strings is known as the all pairs suffix-prefix match problem and its main ...

This paper presents an algorithm for all-pairs suffix-prefix matching that uses a simple data structure for storing input strings and advanced algorithmic ...

This code is an implementation of [1], a new algorithm to solve the All-pairs suffix-prefix problem [2]. In an empirical evaluation we observed that the new ...

Oct 25, 2017 · In this paper we present an algorithm for the all-pairs suffix–prefix problem that uses a simple data structure for storing input strings and advanced ...

Our new solution solves the problem locally for each string, scanning the enhanced suffix array backwards to avoid the processing of suffixes that are no suffix ...

For a pair of strings (S 1, S 2), define the suffix-prefix match of (S 1, S 2) to be the longest suffix of string S 1 that matches a prefix of string S 2.

An improved algorithm for the all-pairs suffix–prefix problem. Journal of Discrete Algorithms, 37:34–43,. 2016. 20. Sun Wu, Udi Manber, et al. A fast ...

“An improved algorithm for the all-pairs suffix–prefix problem” is a paper by William Hideki Azana Tustumi Simon Gog Guilherme P. Telles Felipe A. Louza ...