| Combinatorial Pattern Matching: 6th Annual Symposium, CPM 95, Espoo, Finland, July 5 - 7, 1995. Proceedings 1995 Edition Contributor(s): Galil, Zvi (Editor), Ukkonen, Esko (Editor) |
|
 |
ISBN: 3540600442 ISBN-13: 9783540600442 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback Published: June 1995 Annotation: This volume presents the proceedings of the 6th International Symposium on Combinatorial Pattern Matching, CPM '95, held in Espoo, Finland in July 1995. CPM addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, extended expressions, etc. The aim is to derive non-trivial combinatorial properties in order to improve the performance of the corresponding computational problems. This volume presents 27 selected refereed full research papers and two invited papers; it addresses all current aspects of CPM and its applications such as the design and analysis of algorithms for pattern matching problems in strings, graphs, and hypertexts, as well as in biological sequences and molecules. |
| Additional Information |
| BISAC Categories: - Computers | Optical Data Processing - Computers | Computer Science - Computers | Information Theory |
| Dewey: 006.4 |
| LCCN: 95030356 |
| Series: Lecture Notes in Computer Science |
| Physical Information: 0.87" H x 6.14" W x 9.21" (1.31 lbs) 412 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: This volume presents the proceedings of the 6th International Symposium on Combinatorial Pattern Matching, CPM '95, held in Espoo, Finland in July 1995. CPM addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, extended expressions, etc. The aim is to derive non-trivial combinatorial properties in order to improve the performance of the corresponding computational problems. This volume presents 27 selected refereed full research papers and two invited papers; it addresses all current aspects of CPM and its applications such as the design and analysis of algorithms for pattern matching problems in strings, graphs, and hypertexts, as well as in biological sequences and molecules. |