Mustrite leidmine superpositsioonigraafides

Abstract

Käesolev magistritöö esitab algoritmi mustrite leidmiseks superpositsioonigraafides. Algoritm leiab mustrite arvu ajaga O(kn), kus n on teksti pikkus ja k mustri pikkus. Samasugune ajaline keerukus kehtib ka mustrite leidmisel lahutatavates permutatsioonides.This master's thesis presents a pattern matching algorithm for superpositional graphs which counts a number of matches with time complexity O(kn), where n is a length of a text and k is a length of a pattern. Consequently, the same time complexity is achieved for the case, when both text and pattern are separable permutations.