p.1376
p.1382
p.1388
p.1393
p.1398
p.1402
p.1407
p.1414
p.1420
Dynamic Generalized Suffix Arrays
Abstract:
Document retrieval is the basic task of search engines, and seize amount of attention by the pattern matching community. In this paper, we focused on the dynamic version of this problem, in which the text insertion and deletion is allowable. By using the generalized suffix array and other data structure, we proposed a new index structure. Our scheme achieved better time complexity than the existing ones, and a bit more space overhead is needed as return.
Info:
Periodical:
Pages:
1398-1401
Citation:
Online since:
December 2012
Authors:
Price:
Сopyright:
© 2013 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: