Self-normalised distance with don't cares
We present O(n log m) algorithms for a new class of problems termed self-normalised distance with don't cares. The input is a pattern p of length m and text t of length n > m. The elements of these strings are either integers or wild card symbols. In the shift version, the problem is to...
| Main Authors: | , |
|---|---|
| 格式: | Conference item |
| 出版: |
2007
|