The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Number of pages: 454
Weight: 702 g
Dimensions: 235 x 155 x 24 mm
Edition: 2012 ed.
You may also be interested in...
Please sign in to write a review