In this paper, we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model. By applying the new suffix tree ...
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
We study the problem of creating highly compressed fulltext index structures for versioned document collections, that is, collections that contain multiple versions of each docume...
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...