Combinatorial Pattern Matching 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings /

This book constitutes the refereed proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, held in Palermi, Italy, in June 2011. The 36 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 70 submissions. The papers addre...

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

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Giancarlo, Raffaele (Επιμελητής έκδοσης), Manzini, Giovanni (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Σειρά:Lecture Notes in Computer Science, 6661
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02931nam a22005535i 4500
001 978-3-642-21458-5
003 DE-He213
005 20170112162831.0
007 cr nn 008mamaa
008 110627s2011 gw | s |||| 0|eng d
020 |a 9783642214585  |9 978-3-642-21458-5 
024 7 |a 10.1007/978-3-642-21458-5  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
082 0 4 |a 005.1  |2 23 
245 1 0 |a Combinatorial Pattern Matching  |h [electronic resource] :  |b 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings /  |c edited by Raffaele Giancarlo, Giovanni Manzini. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2011. 
300 |a XV, 480 p. 125 illus., 10 illus. in color.  |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 6661 
520 |a This book constitutes the refereed proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, held in Palermi, Italy, in June 2011. The 36 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 70 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 Data mining. 
650 0 |a Pattern recognition. 
650 0 |a Bioinformatics. 
650 1 4 |a Computer Science. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Data Structures. 
650 2 4 |a Data Mining and Knowledge Discovery. 
650 2 4 |a Pattern Recognition. 
650 2 4 |a Computational Biology/Bioinformatics. 
650 2 4 |a Bioinformatics. 
700 1 |a Giancarlo, Raffaele.  |e editor. 
700 1 |a Manzini, Giovanni.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642214578 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6661 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-21458-5  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)