A Practical and Scalable Tool to Find Overlaps between Sequences

Abstract EN

The evolution of the next generation sequencing technology increases the demand for efficient solutions, in terms of space and time, for several bioinformatics problems.

This paper presents a practical and easy-to-implement solution for one of these problems, namely, the all-pairs suffix-prefix problem, using a compact prefix tree.

The paper demonstrates an efficient construction of this time-efficient and space-economical tree data structure.

The paper presents techniques for parallel implementations of the proposed solution.

Experimental evaluation indicates superior results in terms of space and time over existing solutions.

Results also show that the proposed technique is highly scalable in a parallel execution environment.