Combinatorial Pattern Matching

25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings

Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel Pevzner (Herausgeber)

Buch | Softcover

XXII, 283 Seiten

2014
Springer International Publishing (Verlag)
978-3-319-07565-5 (ISBN)

Artikel merken

This book constitutes the refereed proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014, held in Moscow, Russia, in June 2014. The 28 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 54 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 combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. The meeting also deals with problems in computational biology; data compression and data mining; coding; information retrieval; natural language processing; and pattern recognition.

Trees.- Regular expressions.- Graphs.- Point sets.- Arrays.

Erscheint lt. Verlag	21.5.2014
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XXII, 283 p. 38 illus.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	474 g
Themenwelt	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
Schlagworte	algorithm • Algorithm analysis and problem complexity • Combinatorial Algorithms • Computational Biology • Data Compression • Data Mining • data structures • Dynamic Programming • fixed-parameter • graph algorithms analysis • Graphs • Information Retrieval • Natural Language Processing • Network Flow • Parallel Algorithms • Pattern Matching • point sets • shared memory algorithms • Trees
ISBN-10	3-319-07565-9 / 3319075659
ISBN-13	978-3-319-07565-5 / 9783319075655
Zustand	Neuware