Combinatorial Pattern Matching 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 addre...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Kulikov, Alexander S. (Επιμελητής έκδοσης), Kuznetsov, Sergei O. (Επιμελητής έκδοσης), Pevzner, Pavel (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2014.
Σειρά:Lecture Notes in Computer Science, 8486
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03039nam a22006015i 4500
001 978-3-319-07566-2
003 DE-He213
005 20151030011143.0
007 cr nn 008mamaa
008 140612s2014 gw | s |||| 0|eng d
020 |a 9783319075662  |9 978-3-319-07566-2 
024 7 |a 10.1007/978-3-319-07566-2  |2 doi 
040 |d GrThAP 
050 4 |a Q337.5 
050 4 |a TK7882.P3 
072 7 |a UYQP  |2 bicssc 
072 7 |a COM016000  |2 bisacsh 
082 0 4 |a 006.4  |2 23 
245 1 0 |a Combinatorial Pattern Matching  |h [electronic resource] :  |b 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings /  |c edited by Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel Pevzner. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2014. 
300 |a XXII, 283 p. 38 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 8486 
505 0 |a Trees -- Regular expressions -- Graphs -- Point sets -- Arrays. 
520 |a 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. 
650 0 |a Computer science. 
650 0 |a Data structures (Computer science). 
650 0 |a Algorithms. 
650 0 |a Numerical analysis. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Pattern recognition. 
650 0 |a Bioinformatics. 
650 1 4 |a Computer Science. 
650 2 4 |a Pattern Recognition. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Numeric Computing. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Data Structures. 
650 2 4 |a Computational Biology/Bioinformatics. 
700 1 |a Kulikov, Alexander S.  |e editor. 
700 1 |a Kuznetsov, Sergei O.  |e editor. 
700 1 |a Pevzner, Pavel.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319075655 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 8486 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-07566-2  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)