Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem

Abstract EN

The all-pairs suffix-prefix matching problem is a basic problem in string processing.

It has an application in the de novo genome assembly task, which is one of the major bioinformatics problems.

Due to the large size of the input data, it is crucial to use fast and space efficient solutions.

In this paper, we present a space-economical solution to this problem using the generalized Sadakane compressed suffix tree.

Furthermore, we present a parallel algorithm to provide more speed for shared memory computers.

Our sequential and parallel algorithms are optimized by exploiting features of the Sadakane compressed index data structure.

Experimental results show that our solution based on the Sadakane’s compressed index consumes significantly less space than the ones based on noncompressed data structures like the suffix tree and the enhanced suffix array.

Our experimental results show that our parallel algorithm is efficient and scales well with increasing number of processors.