Combinatorial Pattern Matching
Produktnummer:
186ab8c4d484c74107b52170a0623451e5
| Themengebiete: | algorithm analysis and problem complexity computational complexity data structures multiple pattern matching performance string algorithms |
|---|---|
| Veröffentlichungsdatum: | 22.06.2012 |
| EAN: | 9783642312649 |
| Sprache: | Englisch |
| Seitenzahl: | 454 |
| Produktart: | Kartoniert / Broschiert |
| Herausgeber: | Kärkkäinen, Juha Stoye, Jens |
| Verlag: | Springer Berlin |
| Untertitel: | 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012, Proceedings |
Produktinformationen "Combinatorial Pattern Matching"
This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finland, in July 2012. 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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen