Pattern Matching in Trees and Strings

@misc{citeulike:1615727, 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.}, author = {Bille, Philip }, citeulike-article-id = {1615727}, eprint = {0708.4288}, keywords = {algorithm}, month = {Aug}, posted-at = {2007-09-03 11:13:03}, priority = {2}, title = {Pattern Matching in Trees and Strings}, url = {http://arxiv.org/abs/0708.4288}, year = {2007} }

TY - ELEC ID - citeulike:1615727 L3 - citeulike-article-id:1615727 TI - Pattern Matching in Trees and Strings N2 - 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. KW - algorithm AU - Bille, Philip PY - 2007/Aug/31/ UR - http://arxiv.org/abs/0708.4288 ER -