Pattern Matching for Superpositional Graphs
Name
Neeme Loorits
Abstract
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.
Graduation Thesis language
English
Graduation Thesis type
Master - Computer Science
Supervisor(s)
Mati Tombak
Defence year
2012