Combinatorial pattern matching 25th annual symposium, CPM 2014 Moscow, Russia, June 16-18, 2014 : proceedings / Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel Pevzner (eds.).

Portion of title CPM 2014
SeriesLecture notes in computer science, 0302-9743 ; 8486
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Lecture notes in computer science ; 8486.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Contents Trees -- Regular expressions -- Graphs -- Point sets -- Arrays.
Abstract 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. -- Source other than Library of Congress.
General noteInternational conference proceedings.
Bibliography noteIncludes bibliographical references and author index.
Access restrictionAvailable only to authorized users.
Technical detailsMode of access: World Wide Web
Genre/formElectronic books.
LCCN 2014939431
ISBN9783319075655 (pbk. : alk. paper)
ISBN3319075659 (pbk. : alk. paper)

Availability

Library Location Call Number Status Item Actions
Electronic Resources ✔ Available