具有独立通配符间隔的模式匹配算法

Algorithm for Pattern Matching with Independent Wildcard Gaps

模式匹配作为一种关键技术已被广泛应用于生物序列分析和文本过滤等领域.通配符间隔可以匹配特定长度子序列,为模式匹配问题带来了更多的灵活性.为增加灵活性和一般性给出一种新的模式匹配问题定义,其中通配符间隔可以独立设置,并基于模式分解设计出一种有效的计算匹配数量的算法.实验结果显示,与同类算法相比本算法在性能上具有更优的时间复杂度和空间复杂度.

Pattern matching is critical in some applications such as biological sequence analysis and text filtering.A wildcard gap matches any subsequence with a length in a specified interval,and introduces much adaptability to patterns.However,most existing works require the identical gaps in a pattern.In this paper,we define a new pattern matching problem where gaps are independently specified in order to improve the flexibility and generality.We develop an efficient algorithm to compute the number of all matches based on pattern decomposed.The experimental results show that our algorithm has better performance in the aspects of time complexity and space complexity compared with the algorithms in the same fields.