The all-pairs suffix/prefix (APSP) problem is a classic problem in computer science with many applications in bioinformatics. Given a set {S 1 ,. .. , S k } of k strings of total length n, we are asked to find, for each string S i , i ∈ [1, k], its longest suffix that is a prefix of string S j , for all j = i, j ∈ [1, k]. Several algorithms running in the optimal O(n + k 2) time for solving APSP are known. All of these algorithms are based on suffix sorting and thus require space (n) in any case. We consider the parameterized version of the APSP problem, denoted by-APSP, in which we are asked to output only the pairs whose suffix/prefix overlap is of length at least. We give an algorithm for solving-APSP that runs in the optimal O(n + |OUTPUT |) time using O(n) space, where OUTPUT is the set of output pairs. Our algorithm is thus optimal for the APSP problem as well by setting = 0. Notably, our algorithm is fundamentally different from all optimal algorithms solving the APSP problem: it does not rely on sorting the suffixes of all input strings but on a novel traversal of the Aho-Corasick machine, and it thus requires space linear in the size of the machine.