Most search engines in use today present the user with a single-ordered list of documents matching the search query leading to lexical ambiguity. An alternative to a single-ordered list is to cluster ...

Suffix trees are fundamental data structures in stringology and have wide applications across various domains. In this work, we propose two linear-time algorithms for indexing strings under each ...

This library implements suffix array construction and some related functionalities such as string search. Questions, bug reports, documentation improvements, code contributions welcome! Suggestions ...

Abstract: We present, in this paper, two efficient algorithms for linear time suffix array construction. These two algorithms achieve their linear time complexities, using the techniques of divide-and ...

Abstract: The suffix array is an important indexing data structure for biological sequence analysis. The increasing size of genomic data necessitates the use of a computer cluster to speed up the ...

ABSTRACT: Automatic classification of blog entries is generally treated as a semi-supervised machine learning task, in which the blog entries are automatically assigned to one of a set of pre-defined ...

在之前的文章中，我们讲到了后缀树和它的一些特性。后缀树主要用来做模式匹配中，比如全文索引，寻找公共前缀等，非常的有用。同样的后缀数组和后缀树的作用非常类似，和后缀树相比，后缀数组更简单并且更加节省空间，今天我们将会详细介绍下后缀 ...