Combinatorial Pattern Matching
Subtitle: 7th Annual Symposium, CPM '96, Laguna Beach, California, June 10-12, 1996. Proceedings (Lecture Notes in Computer Science)
Contributors: Dan Hirschberg (Editor); Gene Meyers (Editor)
Edition: 1 edition
Publisher: Springer
Published: May 8, 1996
Language: eng
Format: Paperback
Number of pages: 392
ISBN-13: 9783540612582
Subjects: Applied mathematics; Combinatorics & graph theory; Mathematical theory of computation; Pattern recognition; Computers - General Information; Algorithms (Computer Programming); Computers; Programming - General; Discrete Mathematics; Congresses; Computer Science; Data Processing - Optical Data Processing; Computers / Computer Science; Datenkomprimierung; Informationsabfrage; Kombinatorische Strukturen; Kombinatorischer Musterabgleich; Mustererkennung; Combinatorial Analysis; Computer algorithms
First sentence: Approximate string matching is one of the main problems in classical string algorithms, with applications to text searching, computational biology, pattern recognition, etc.
Description: "This book constitutes the refereed proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, CPM '96, held in Laguna Beach, California, USA, in June 1996. The 26 revised full papers included were selected from a total of 48 submissions; also included are two invited papers. Combinatorial pattern matching has become a full-fledged area of algorithmics with important applications in recent years. The book addresses all relevant aspects of combinatorial pattern matching and its importance in information retrieval, pattern recognition, compiling, data compression, program analysis, and molecular biology and thus describes the state of the art in the area."--PUBLISHER'S WEBSITE.