volume 25, issue 2, P283-303 2021
DOI: 10.3233/ida-205087
View full text
|
|
Share
Na Liu, Fei Xie, Xindong Wu

Abstract: Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array-based algorithms have been proposed to solve this problem. Suffix array is an efficient data structure for exact string matching in existing studies, as well as for approximate pattern matching and multi-pattern matching. An algorithm called MMSA-S is for the short exact characters in a pattern by dynamic programming, while another…

expand abstract