Suffix array for multi-pattern matching with variable length wildcards

• Published in: Intelligent data analysis Vol. 25; no. 2; pp. 283 - 303
• Main Authors: Liu, Na, Xie, Fei, Wu, Xindong
• Format: Journal Article
• Language: English
• Published: London, England SAGE Publications 04.03.2021; Sage Publications Ltd
• Subjects: Algorithms; Arrays; Data structures; Dynamic programming; Pattern matching; String matching; wildcards; suffix array; Pattern matching
• ISSN: 1088-467X; 1571-4128
• DOI: 10.3233/IDA-205087

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 algorithm called MMSA-L deals with the long exact characters by the edit distance method. Experimental results of Pizza & Chili corpus demonstrate that these two newly proposed algorithms, in most cases, are more time-efficient than the state-of-the-art comparison algorithms.