Now showing items 1-2 of 2
Using the Sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem
( Hindawi , 2014 , Article)
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 ...
A Practical and Scalable Tool to Find Overlaps between Sequences
( Hindawi , 2015 , Article)
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 ...