Document - Compressed String Dictionary Look-up with Edit Distance One

2012

Conference article Open Access

Compressed String Dictionary Look-up with Edit Distance One

Belazzougui D., Venturini R.

Compressed Data Structures DATA STRUCTURES

In this paper we present dierent 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 rst 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

Source: 23rd Annual Symposium on Combinatorial Pattern Matching, pp. 280–292, Helsinky, 1 Giugno 2012

Publisher: Springer, Berlin, DEU

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:275991,
	title = {Compressed String Dictionary Look-up with Edit Distance One},
	author = {Belazzougui D. and Venturini R.},
	publisher = {Springer, Berlin, DEU},
	doi = {10.1007/978-3-642-31265-6_23},
	booktitle = {23rd Annual Symposium on Combinatorial Pattern Matching, pp. 280–292, Helsinky, 1 Giugno 2012},
	year = {2012}
}