Combinatorial Pattern Matching, 2011 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011, Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Giancarlo Raffaele, Manzini Giovanni
The 36 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 70 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.
Fast track conference proceedings
Unique visibility
State of the art research
Date de parution : 06-2011
Ouvrage de 480 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 52,74 €
Ajouter au panier