Pattern Matching in Trees and Strings

Abstract

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

References in corpus (2)

• Fast and Compact Regular Expression Matching
• New Algorithms for Regular Expression Matching