ATTENTION: The software behind KU ScholarWorks is being upgraded to a new version. Starting July 15th, users will not be able to log in to the system, add items, nor make any changes until the new version is in place at the end of July. Searching for articles and opening files will continue to work while the system is being updated.
If you have any questions, please contact Marianne Reed at mreed@ku.edu .
Faster Compressed Dictionary Matching (extended abstract)
dc.contributor.author | Hon, Wing-Kai | |
dc.contributor.author | Lam, Tak-Wah | |
dc.contributor.author | Shah, Rahul | |
dc.contributor.author | Siu-Lung, Tam | |
dc.contributor.author | Vitter, Jeffrey Scott | |
dc.date.accessioned | 2011-03-21T21:41:49Z | |
dc.date.available | 2011-03-21T21:41:49Z | |
dc.date.issued | 2010 | |
dc.identifier.citation | W.-K. Hon, Tsung-Han Ku, R. Shah, S. V. Thankachan, and J. S. Vitter. “Faster Compressed Dictionary Matching,” in preparation. An extended abstract appears in Proceedings of the 17th International Conference on String Processing and Information Retrieval (SPIRE ’10), Los Cabos, Mexico, October 2010, published in Lecture Notes in Computer Science, Springer, Berlin, Germany. http://dx.doi.org/10.1007/978-3-642-16321-0_19 | |
dc.identifier.uri | http://hdl.handle.net/1808/7235 | |
dc.description | The original publication is available at www.springerlink.com | |
dc.description.abstract | The past few years have witnessed several exciting results on compressed represen- tation of a string T that supports e±cient pattern matching, and the space complexity has been reduced to jTjHk(T)+o(jTj log ¾) bits [8, 10], where Hk(T) denotes the kth- order empirical entropy of T, and ¾ is the size of the alphabet. In this paper we study compressed representation for another classical problem of string indexing, which is called dictionary matching in the literature. Precisely, a collection D of strings (called patterns) of total length n is to be indexed so that given a text T, the occurrences of the patterns in T can be found e±ciently. In this paper we show how to exploit a sampling technique to compress the existing O(n)-word index to an (nHk(D) + o(n log ¾))-bit index with only a small sacri¯ce in search time. | |
dc.language.iso | en_US | |
dc.publisher | Springer Verlag | |
dc.title | Faster Compressed Dictionary Matching (extended abstract) | |
dc.type | Article | |
kusw.kuauthor | Vitter, Jeffrey Scott | |
kusw.oastatus | fullparticipation | |
dc.identifier.doi | 10.1007/978-3-642-16321-0_19 | |
kusw.oaversion | Scholarly/refereed, author accepted manuscript | |
kusw.oapolicy | This item meets KU Open Access policy criteria. | |
dc.rights.accessrights | openAccess |