Approximate string matching is an important issue in the research area of pattern matching. Compressed suffix array is an index structure widely used in string matching and data compression, and it has the advantage of fast retrieval and can be widely applied. In this paper, it proposes a data structure suitable for approximate string matching searching algorithm, and based on the structure, it proposes a matching search algorithm. The result of the experiment shows that compared to the current algorithms, ...