It looks like you're offline.
Open Library logo
additional options menu

MARC Record from harvard_bibliographic_metadata

Record ID harvard_bibliographic_metadata/ab.bib.13.20150123.full.mrc:765008243:2985
Source harvard_bibliographic_metadata
Download Link /show-records/harvard_bibliographic_metadata/ab.bib.13.20150123.full.mrc:765008243:2985?format=raw

LEADER: 02985nam a22005055a 4500
001 013699710-4
005 20130712192636.0
008 130517s2013 gw | s ||0| 0|eng d
020 $a9783642389054
020 $a9783642389054
020 $a9783642389047
024 7 $a10.1007/978-3-642-38905-4$2doi
035 $a(Springer)9783642389054
040 $aSpringer
050 4 $aQ337.5
050 4 $aTK7882.P3
072 7 $aUYQP$2bicssc
072 7 $aCOM016000$2bisacsh
082 04 $a006.4$223
100 1 $aFischer, Johannes.
245 10 $aCombinatorial Pattern Matching :$b24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings /$cedited by Johannes Fischer, Peter Sanders.
260 $aBerlin, Heidelberg :$bSpringer Berlin Heidelberg :$bImprint: Springer,$c2013.
300 $aX, 259 p. 58 illus.$bdigital.
490 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v7922
505 0 $asearching and matching strings and more complicated patterns.-  trees, regular expressions, graphs, point sets, and arrays.-  non-trivial combinatorial properties of such structures.- problems in computational biology -- data compression and data mining -- coding -- information retrieval -- natural language processing -- pattern recognition.
520 $aThis book constitutes the refereed proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, held in Bad Herrenalb (near Karlsruhe), Germany, in June 2013. The 21 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 51 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 problem 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 20 $aPattern perception.
650 10 $aComputer science.
650 0 $aData structures (Computer science)
650 0 $aComputer science.
650 0 $aComputer software.
650 0 $aElectronic data processing.
650 0 $aComputational complexity.
650 0 $aOptical pattern recognition.
650 0 $aBioinformatics.
650 24 $aAlgorithm Analysis and Problem Complexity.
650 24 $aNumeric Computing.
650 24 $aDiscrete Mathematics in Computer Science.
650 24 $aData Structures.
650 24 $aComputational Biology/Bioinformatics.
700 1 $aSanders, Peter.
776 08 $iPrinted edition:$z9783642389047
830 0 $aLecture Notes in Computer Science ;$v7922.
988 $a20130604
906 $0VEN