http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings
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.
edited by Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel Pevzner.
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science