登入
選單
返回
Google圖書搜尋
Combinatorial Pattern Matching
Alberto Apostolico
Maxime Crochemore
Zvi Galil
Udi Manber
其他書名
4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings
出版
Springer Berlin Heidelberg
, 1993-05-18
主題
Computers / Artificial Intelligence / Computer Vision & Pattern Recognition
Computers / Programming / Algorithms
Computers / Speech & Audio Processing
Computers / System Administration / Storage & Retrieval
Computers / Information Theory
Mathematics / Discrete Mathematics
Computers / Optical Data Processing
Computers / Software Development & Engineering / General
Computers / Artificial Intelligence / Natural Language Processing
Computers / Data Science / Data Warehousing
Language Arts & Disciplines / Library & Information Science / General
ISBN
354056764X
9783540567646
URL
http://books.google.com.hk/books?id=UlhJAQAAIAAJ&hl=&source=gbs_api
註釋
The papers contained in this volume were presented at the Fourth Annual Symposium on Combinatorial Pattern Matching, held in Padova, Italy, in June 1993. Combinatorial pattern matching addresses issues of searching and matching of strings and more complicated patterns such as trees, regular expressions, extended expressions, etc. The goal is to derive nontrivial 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, a steady flow of high-quality scientific studies of this subject has changed a sparse set of isolated results into a full-fledged area of algorithmics. The area is expected to grow even further due to the increasing demand for speedand efficiency that comes especially from molecular biology and the Genome project, but also from other diverse areas such as information retrieval, pattern recognition, compilers, data compression, and program analysis.