Combinatorial Pattern Matching 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings /

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finalnd, in July 2012. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers ad...

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

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Kärkkäinen, Juha (Επιμελητής έκδοσης), Stoye, Jens (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012.
Σειρά:Lecture Notes in Computer Science, 7354
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02966nam a22005775i 4500
001 978-3-642-31265-6
003 DE-He213
005 20151204152351.0
007 cr nn 008mamaa
008 120612s2012 gw | s |||| 0|eng d
020 |a 9783642312656  |9 978-3-642-31265-6 
024 7 |a 10.1007/978-3-642-31265-6  |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 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings /  |c edited by Juha Kärkkäinen, Jens Stoye. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2012. 
300 |a XIII, 454 p. 82 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 7354 
520 |a This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finalnd, in July 2012. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 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 non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. 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 Kärkkäinen, Juha.  |e editor. 
700 1 |a Stoye, Jens.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642312649 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 7354 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-31265-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)