0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Mathematical theory of computation

Buy Now

Combinatorial Pattern Matching - 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings (Paperback, 2000 ed.) Loot Price: R1,574
Discovery Miles 15 740
Combinatorial Pattern Matching - 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings (Paperback,...

Combinatorial Pattern Matching - 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings (Paperback, 2000 ed.)

Raffaele Giancarlo, David Sankoff

Series: Lecture Notes in Computer Science, 1848

 (sign in to rate)
Loot Price R1,574 Discovery Miles 15 740 | Repayment Terms: R148 pm x 12*

Bookmark and Share

Expected to ship within 18 - 22 working days

The papers contained in this volumewere presented at the 11thAnnual Sym- sium on CombinatorialPattern Matching, held June 21-23, 2000 at the Univ- sit edeMontr eal. They were selected from 44 abstracts submitted in response to the call for papers. In addition, there were invited lectures by Andrei Broder (AltaVista), Fernando Pereira (AT&T Research Labs), and Ian H. Witten (U- versity of Waikato). The symposium was preceded by a two-day summer school set up to - tract and train young researchers. The lecturers at the school were Greg Butler, ClementLam, andGusGrahne: BLAST Howdoyousearchsequencedatabases?, DavidBryant: Phylogeny, Ra aeleGiancarlo: Algorithmicaspectsof speech rec- nition, Nadia El-Mabrouk: Genome rearrangement, LaxmiParida: Flexib- pattern discovery, and Ian H. Witten: Adaptive text mining: inferring structure from sequences. 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. The goal is to derive non-trivial combi- torial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. Over recent years a steady ?ow of high-quality research on this subject has changed a sparse set of isolated results into a fully-?edged area of algorithmics

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Lecture Notes in Computer Science, 1848
Release date: 2001
First published: 2000
Editors: Raffaele Giancarlo • David Sankoff
Dimensions: 235 x 155 x 22mm (L x W x T)
Format: Paperback
Pages: 426
Edition: 2000 ed.
ISBN-13: 978-3-540-67633-1
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > Applications of computing > Pattern recognition
Promotions
LSN: 3-540-67633-3
Barcode: 9783540676331

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners