A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Simple, compact and robust approximate string dictionary
[article]

2014
*
arXiv
*
pre-print

This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary D of d strings of total length n over an alphabet of size σ. Given a bound k and a pattern x of length m, a query has to return all the strings of the dictionary which are at edit distance at most k from x, where the edit distance between two strings x and y is defined as the minimum-cost sequence of edit operations that transform x

arXiv:1312.4678v2
fatcat:iszmv4sgk5bozmh7g5hryxnlhy