Combinatorial Pattern Matching [electronic resource] : 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings /

Contributor(s):

Material type: Text

TextSeries: Theoretical Computer Science and General Issues ; 8486Publisher: Cham : Springer International Publishing : Imprint: Springer, 2014Edition: 1st ed. 2014Description: XXII, 283 p. 38 illus. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783319075662

Subject(s):

Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:

006.4 23

LOC classification:

Q337.5
TK7882.P3

Online resources:

Click here to access online

Contents:

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

In: Springer Nature eBookSummary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

No physical items for this record

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

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.

There are no comments on this title.

to post a comment.