Background: DNA sequence alignment is one of the most fundamental and important operation to identify which gene family may contain this sequence, pattern matching for DNA sequence has been a fundamental issue in biomedical engineering, biotechnology and health informatics.
Objective: To solve this problem, this study proposes an optimal multi pattern matching with wildcards for DNA sequence.
Methods: This proposed method packs the patterns and a sliding window of texts, and the window slides along the given packed text, matching against stored packed patterns.
Results: Three data sets are used to test the performance of the proposed algorithm, and the algorithm was seen to be more efficient than the competitors because its operation is close to machine language.
Conclusions: Theoretical analysis and experimental results both demonstrate that the proposed method outperforms the state-of-the-art methods and is especially effective for the DNA sequence.
Keywords: DNA sequence; multi-pattern matching; packed string matching; wildcards.