| Combinatorial Pattern Matching: Fifth Annual Symposium, CPM '94, Asilomar, Ca, Usa, June 5 - 8, 1994. Proceedings 1994 Edition Contributor(s): Crochemore, Maxime (Editor), Gusfield, Dan (Editor) |
|
 |
ISBN: 3540580948 ISBN-13: 9783540580942 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback - Other Formats Published: May 1994 Annotation: This volume presents the proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, held at Asilomar, California, in June 1994. The 26 selected papers in this volume are organized in chapters on Alignments, Various Matchings, Combinatorial Aspects, and Bio-Informatics. Combinatorial Pattern Matching addresses issues of searching and matching of strings and more complicated patterns, as for example trees. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performance for the corresponding computational problems. In recent years, combinatorial pattern matching has developed into a full-fledged area of algorithmics and is expected to grow even further during the next years. |
| Additional Information |
| BISAC Categories: - Computers | Optical Data Processing - Computers | Computer Science - Computers | Information Theory |
| Dewey: 006.401 |
| Series: Lecture Notes in Computer Science |
| Physical Information: 0.72" H x 6.14" W x 9.21" (1.06 lbs) 331 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: This volume presents the proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, held at Asilomar, California, in June 1994. The 26 selected papers in this volume are organized in chapters on Alignments, Various Matchings, Combinatorial Aspects, and Bio-Informatics. Combinatorial Pattern Matching addresses issues of searching and matching of strings and more complicated patterns, as for example trees. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performance for the corresponding computational problems. In recent years, combinatorial pattern matching has developed into a full-fledged area of algorithmics and is expected to grow even further during the next years. |