Let W be a set of n binary strings of length m each. We are interested in designing data structures for W that can answer d-queries quickly; that is, given in a binary string โฃ, decide whether there is any member of W within Hamming distance d of โฃ. The problem, originally raised by Minsky and Paper
Text Indexing and Dictionary Matching with One Error
โ Scribed by Amihood Amir; Dmitry Keselman; Gad M. Landau; Moshe Lewenstein; Noa Lewenstein; Michael Rodeh
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 109 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## A new one-phase technique for compression text files is presented as a modification of the Ziv and Lempel compression scheme. The method replaces parts of words in a text by references to a fixed-size dictionary which contains the subwords of the text already compressed. An essential part of the
We study the Hosoya index of trees with m-matchings and characterize the trees with m-matchings and the fourth and fifth minimal Hosoya index respectively.
This article evaluates the effectiveness of spelling-correction and string-similarity matching methods in retrieving similar words in a Malay dictionary associated with a set of query words. The spelling-correction techniques used are SPEEDCOP, Soundex, Davidson, Phonix, and Hartlib. Two dynamic-pro
This paper derives the best linear unbiased predictor for a one-way error component model with serial correlation. A transformation derived by Baltagi and Li (1991) is used to show how the forecast can be easily computed from the GLS estimates and residuals. This result is useful for panel data appl