Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017
Approximate String Matching: Theory and Applications (La Recherche Approchée de Motifs : Théorie et Applications)
Ibrahim Chegrane
The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows: Let $D=\{x_1,x_2,\ldots…
cs.DS2013
Simple, compact and robust approximate string dictionary
Ibrahim Chegrane, Djamal Belazzougui
This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary of strings…