Description
Combinatorial Pattern Matching, 2014
25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings
Theoretical Computer Science and General Issues Series
Coordinators: Kulikov Alexander S., Kuznetsov Sergei O., Pevzner Pavel
Language: EnglishSubjects for Combinatorial Pattern Matching:
Keywords
algorithm; combinatorial algorithms; computational biology; data compression; data mining; 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; algorithm analysis and problem complexity; data structures
Publication date: 05-2014
283 p. · 15.5x23.5 cm · Paperback
283 p. · 15.5x23.5 cm · Paperback
Description
/li>Contents
/li>
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.
© 2024 LAVOISIER S.A.S.