In this paper we present different solutions for the problem of indexing a dictionary of strings in compressed space. Given a pattern P, the index has to report all the strings in the dictionary having edit distance at most one with P. Our first solution is able to solve queries in (almost optimal) O(|P| + occ) time where occ is the number of strings in the dictionary having edit distance at most one with P. The space complexity of this solution is bounded in terms of the k-th order entropy of the indexed dictionary. Our second solution further improves this space complexity at the cost of increasing the query time. © 2012 Springer-Verlag.
CITATION STYLE
Belazzougui, D., & Venturini, R. (2012). Compressed string dictionary look-up with edit distance one. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7354 LNCS, pp. 280–292). https://doi.org/10.1007/978-3-642-31265-6_23
Mendeley helps you to discover research relevant for your work.