| 書目名稱 | Combinatorial Pattern Matching |
| 副標(biāo)題 | 22nd Annual Symposiu |
| 編輯 | Raffaele Giancarlo,Giovanni Manzini |
| 視頻video | http://file.papertrans.cn/231/230010/230010.mp4 |
| 概述 | Fast track conference proceedings.Unique visibility.State of the art research |
| 叢書名稱 | Lecture Notes in Computer Science |
| 圖書封面 |  |
| 描述 | This book constitutes the refereed proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, held in Palermi, Italy, in June 2011. .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. |
| 出版日期 | Conference proceedings 2011 |
| 關(guān)鍵詞 | approximation algorithms; computational complexity; graph algoithms; graph computation; search algorithm |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-21458-5 |
| isbn_softcover | 978-3-642-21457-8 |
| isbn_ebook | 978-3-642-21458-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer Berlin Heidelberg 2011 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-12 16:29
發(fā)表于 2025-3-21 18:50:44
