Combinatorial Pattern Matching

25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings
2014
ISBN: 978-3-319-07565-5
Verlag: Springer International Publishing

Buch, Englisch, Band 8486, 283 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 4686 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Kulikov, Alexander S.

Pevzner, Pavel

Kuznetsov, Sergei O.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Data Mining
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Mustererkennung, Biometrik
• Naturwissenschaften Biowissenschaften Angewandte Biologie Bioinformatik
• Mathematik | Informatik EDV | Informatik Angewandte Informatik Bioinformatik
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Information Retrieval
• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Spracherkennung, Sprachverarbeitung

Inhaltsverzeichnis

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