Spatial Approximate String Matching

In this investigation, we propose an algorithm for Spatial Approximate String Matching where k times of mismatch are allowed. There have been several algorithms proposed so far, but most of them examine the longest text strings, i.e., the longest one dimensional sequence of characters. In this approach, we examine spatial text strings, i.e., three dimensional space of characters by means of DP (dynamic programming) algorithm and discuss the efficiency.