223 search results - page 15 / 45 » Suffix Arrays on Words |
STACS
1992
Springer
13 years 10 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
DCC
2004
IEEE
14 years 6 months ago
2004
IEEE
An important question in the construction of orthogonal arrays is what the minimal size of an array is when all other parameters are fixed. In this paper, we will provide a genera...
BIRD
2007
Springer
14 years 27 days ago
2007
Springer
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...
ICDAR
2009
IEEE
14 years 1 months ago
2009
IEEE
In this paper, we propose a comparative study between the affixal approach and the analytical approach for off-line Arabic decomposable word recognition. The analytical approach i...
SPIRE
1998
Springer
13 years 11 months ago
1998
Springer
Stemming is a technique which aims to extract common suffixes of words. Thus, words which are literally differhave a common stem, may be abstracted by their common stem. The under...