@inproceedings{5534b59166194dbf9cd13983eb0e9dc3,
title = "The string-to-dictionary matching problem",
abstract = "The String-to-Dictionary Matching Problem is defined, in which a string is searched for in all the possible concatenations of the elements of a given dictionary, with applications to compressed matching in variable to fixed length encodings, such as Tunstall's. An algorithm based on suffix trees is suggested and experiments on natural language text are presented suggesting that compressed search might use less comparisons for long enough patterns, in spite of a potentially large number of encodings.",
keywords = "Compressed Matching, Suffix Trees, Tunstall",
author = "Klein, {Shmuel T.} and Dana Shapira",
year = "2011",
doi = "10.1109/DCC.2011.21",
language = "אנגלית",
isbn = "9780769543529",
series = "Data Compression Conference Proceedings",
pages = "143--152",
booktitle = "Proceedings - DCC 2011",
note = "2011 Data Compression Conference, DCC 2011 ; Conference date: 29-03-2011 Through 31-03-2011",
}