Pattern Matching in Trees and Strings
Abstract
Description
We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we study algorithms for tree matching, string matching, and string matching in compressed texts.
PhD dissertation, 140 pages
PhD dissertation, 140 pages