Pattern Matching in Trees and Strings

Simple item page
dc.creatorBille, Philip
dc.date2007-08-31
dc.date.accessioned2026-07-07T08:26:52Z
dc.date.available2026-07-07T08:26:52Z
dc.descriptionWe 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.
dc.descriptionPhD dissertation, 140 pages
dc.identifierhttps://arxiv.org/abs/0708.4288
dc.identifierhttp://arxiv.org/abs/0708.4288
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137087
dc.subjectData Structures and Algorithms
dc.titlePattern Matching in Trees and Strings
dc.typetext

Files

Collections

arXiv