Blick ins Buch

Combinatorial Pattern Matching

23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012, Proceedings

Juha Kärkkäinen, Jens Stoye (Herausgeber)

Buch | Softcover

XIII, 454 Seiten

2012 | 2012
Springer Berlin (Verlag)
978-3-642-31264-9 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finland, in July 2012. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.

Erscheint lt. Verlag	22.6.2012
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XIII, 454 p. 82 illus.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	702 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
	Mathematik / Informatik ► Mathematik
	Naturwissenschaften ► Biologie
Schlagworte	Algorithm analysis and problem complexity • Computational Complexity • data structures • multiple pattern matching • Performance • String Algorithms
ISBN-10	3-642-31264-0 / 3642312640
ISBN-13	978-3-642-31264-9 / 9783642312649
Zustand	Neuware