• NetDAP: −approximate pattern matching with length constraints

    29 days ago - By Springer

    Abstract
    Pattern matching with gap constraints has been applied to compute the support of a pattern in a sequence, which is an essential task of the repetitive sequential pattern mining. Compared with exact PM, approximate PM allows data noise between the pattern and the matched subsequence. Therefore, more valuable patterns can be found. Approximate PM with gap constraints mainly adopts the Hamming distance to measure the approximation degree which only reflects the number of different characters between two sequences, but ignores the distance between different characters. Hence, this...
    Read more ...