 |
|
|
Item Details
| Title:
|
COMBINATORIAL PATTERN MATCHING
10TH ANNUAL SYMPOSIUM, CPM 99, WARWICK UNIVERSITY, UK, JULY 22-24, 1999 PROCEEDINGS |
| Volume: |
10th |
| By: |
Maxime Crochemore (Editor), Mike Paterson (Editor) |
| Format: |
Paperback |
| List price:
|
£62.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
3540662782 |
| ISBN 13: |
9783540662785 |
| Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Pub. date: |
14 July, 1999 |
| Edition: |
1999 ed. |
| Series: |
Lecture Notes in Computer Science v. 1645 |
| Pages: |
304 |
| Description: |
The refereed proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching. Papers address various issues in the field dealing with classical objects like trees, graphs, point sets, and arrays, as well as with DNA/RNA coding, WWW issues, information retrieval and data compression. |
| Synopsis: |
The papers contained in this volume were presented at the Tenth Annual S- posium on Combinatorial Pattern Matching, held July 22 { 24, 1999 at the University of Warwick, England. They were selected from 26 abstracts subm- ted in response to the call for papers. In addition, invited lectures were given by JoanFeigenbaumfromAT&TLabsResearch(Massivegraphs:algorithms,app- cations, and open problems) and David Jones from the Department of Biology, University of Warwick (Optimizing biological sequences and protein structures using simulated annealing and genetic algorithms). The symposium was preceded by a two-day summer school set up to attract and train young researchers. The lecturers of the school were Alberto Ap- tolico (Computational Theories of Surprise), Joan Feigenbaum (Algorithmics of network-generatedmassivedatasets),Leszek Gasieniecand PaulGoldberg (The complexity of gene placement), David Jones (An introduction to computational molecularbiology), Arthur Lesk (Structuralalignmentandmaximalsubstructure extraction),Cenk Sahinalp(Questformeasuringdistancebetweenstrings:exact, approximate, and probabilistic algorithms), and Jim Storer.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. |
| Illustrations: |
biography |
| Publication: |
Germany |
| Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|