书目名称 | Combinatorial Pattern Matching | 副标题 | 24th Annual Symposiu | 编辑 | Johannes Fischer,Peter Sanders | 视频video | | 概述 | Up-to-date results.Fast track conference proceedings.State-of-the-art report | 丛书名称 | Lecture Notes in Computer Science | 图书封面 |  | 描述 | 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. | 出版日期 | Conference proceedings 2013 | 关键词 | NP-Completeness; bit-parallelism; external memory algorithms; grammar-based compression; text indexes; al | 版次 | 1 | doi | https://doi.org/10.1007/978-3-642-38905-4 | isbn_softcover | 978-3-642-38904-7 | isbn_ebook | 978-3-642-38905-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 | issn_series | 0302-9743 | copyright | Springer-Verlag Berlin Heidelberg 2013 |
The information of publication is updating
|
|