Abstract: We consider the approximate pattern matching problem under the edit distance. Given a text T of length n, a pattern P of length m, and a threshold k, the task is to find the starting ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results