000 | 03381nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-642-38905-4 | ||
003 | DE-He213 | ||
005 | 20200421111155.0 | ||
007 | cr nn 008mamaa | ||
008 | 130517s2013 gw | s |||| 0|eng d | ||
020 |
_a9783642389054 _9978-3-642-38905-4 |
||
024 | 7 |
_a10.1007/978-3-642-38905-4 _2doi |
|
050 | 4 | _aQ337.5 | |
050 | 4 | _aTK7882.P3 | |
072 | 7 |
_aUYQP _2bicssc |
|
072 | 7 |
_aCOM016000 _2bisacsh |
|
082 | 0 | 4 |
_a006.4 _223 |
245 | 1 | 0 |
_aCombinatorial Pattern Matching _h[electronic resource] : _b24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings / _cedited by Johannes Fischer, Peter Sanders. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013. |
|
300 |
_aX, 259 p. 58 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
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 | 0 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aNumerical analysis. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aPattern recognition. | |
650 | 0 | _aBioinformatics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aPattern Recognition. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aNumeric Computing. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aComputational Biology/Bioinformatics. |
700 | 1 |
_aFischer, Johannes. _eeditor. |
|
700 | 1 |
_aSanders, Peter. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642389047 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v7922 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-38905-4 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c53457 _d53457 |