“…Fischer and Paterson were the first to generalized pattern matching with wildcards (Fischer & Paterson, 1974): given a pattern P and a text T, either of which may contain wildcards, denoted by ¢, the goal is to locate all P's occurrences in T. ¢ can match any letter in a given alphabet, such as a¢¢c¢t. Unlike previous work, Chen, et al proposed a PMWL problem integrating two problems (Chen et al, 2006): one is complex local constraints which means the user can specify a different range of wildcards between each two consecutive letters of P, for example, a¢ [0,3]c¢ [1,3]t. Another one is global length constraints.…”