Pattern Matching in Trees and Strings
classification
💻 cs.DS
keywords
matchingalgorithmspatternstringcombinatorialcompressedconcretelydesign
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.