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 ...
The similarity-aware relational intersect database operator
( Springer International Publishing , 2014 , Conference Paper)
Identifying similarities in large datasets is an essential operation in many applications such as bioinformatics, pattern recognition, and data integration. To make the underlying database system similarity-aware, the core ...