.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Combinatorial Pattern Matching
. Ed(S): Apostolica, Alberto; Takeda, Masayuki
€ 70.20
FREE Delivery in Ireland
Description for Combinatorial Pattern Matching
Paperback. These are the refereed proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching, CPM 2002. The papers cover theoretical and computational aspects of searching and matching strings and more complicated patterns - trees, regular expressions, graphs, point sets, and arrays. Editor(s): Apostolica, Alberto; Takeda, Masayuki. Series: Lecture Notes in Computer Science. Num Pages: 298 pages, biography. BIC Classification: PBV; UYQP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 16. Weight in Grams: 430.
The papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3–5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. They were selected from 37 abstracts s- mitted in response to the call for papers. In addition, there were invited lectures by Shinichi Morishita (University of Tokyo) and Hiroki Arimura (Kyushu U- versity). Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays, in various formats. The goal is to derive n- trivial combinatorial properties ... Read more
The papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3–5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. They were selected from 37 abstracts s- mitted in response to the call for papers. In addition, there were invited lectures by Shinichi Morishita (University of Tokyo) and Hiroki Arimura (Kyushu U- versity). Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays, in various formats. The goal is to derive n- trivial combinatorial properties ... Read more
Product Details
Format
Paperback
Publication date
2002
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
298
Condition
New
Series
Lecture Notes in Computer Science
Number of Pages
290
Place of Publication
Berlin, Germany
ISBN
9783540438625
SKU
V9783540438625
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Combinatorial Pattern Matching