Combinatorial Pattern Matching

Beschreibung

This book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 51 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 problem 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.
Up-to-date results Fast track conference proceedings State-of-the-art report

Autor*in

Johannes Fischer

Themen in »Combinatorial Pattern Matching«

NP-Completeness bit-parallelism external memory algorithms grammar-based compression text indexes algorithm analysis and problem complexity data structures

Stimmen zu »Combinatorial Pattern Matching«

Details

Link teilen