Combinatorial Pattern Matching

David Sankoff

ISBN 10: 3540676333 / ISBN 13: 9783540676331

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 2000, 2000

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 440 pp. Englisch.

Seller Inventory # 9783540676331

Bibliographic Details

• Title: Combinatorial Pattern Matching
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 2000
• Publication Date: 2000
• Language: English
• ISBN 10: 3540676333
• ISBN 13: 9783540676331
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 24D millimeters 235 millimeters width by 155 millimeters height by 24 millimeters depth
• Weight: 663 grams

About this title

Synopsis

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.