000 | 05516nam a22006615i 4500 | ||
---|---|---|---|
001 | 978-3-319-19929-0 | ||
003 | DE-He213 | ||
005 | 20240730170938.0 | ||
007 | cr nn 008mamaa | ||
008 | 150615s2015 sz | s |||| 0|eng d | ||
020 |
_a9783319199290 _9978-3-319-19929-0 |
||
024 | 7 |
_a10.1007/978-3-319-19929-0 _2doi |
|
050 | 4 | _aQ337.5 | |
050 | 4 | _aTK7882.P3 | |
072 | 7 |
_aUYQP _2bicssc |
|
072 | 7 |
_aCOM016000 _2bisacsh |
|
072 | 7 |
_aUYQP _2thema |
|
082 | 0 | 4 |
_a006.4 _223 |
245 | 1 | 0 |
_aCombinatorial Pattern Matching _h[electronic resource] : _b26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings / _cedited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro. |
250 | _a1st ed. 2015. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2015. |
|
300 |
_aXIX, 412 p. 69 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v9133 |
|
505 | 0 | _aOn the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling -- A Framework for Space-Efficient String Kernels -- Composite Repetition-Aware Data Structures -- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis -- Longest Common Extensions in Trees -- Longest Common Extensions in Sublinear Space -- Ranked Document Retrieval with Forbidden Pattern -- Parameterized Complexity of Superstring Problems -- On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem -- Fast String Dictionary Lookup with One Error -- On the Readability of Overlap Digraphs -- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem -- Range Minimum Query Indexes in Higher Dimensions -- Alphabet-Dependent String Searching with Wexponential Search Trees -- Lempel Ziv Computation in Small Space (LZ-CISS) -- Succinct Non-overlapping Indexing -- Encodings of Range Maximum-Sum Segment Queries and Applications -- Compact Indexes for Flexible Top-k Retrieval -- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding -- Combinatorial RNA Design: Designability and Structure-Approximating Algorithm -- Dictionary Matching with Uneven Gaps -- Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process -- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets -- String Powers in Trees -- Online Detection of Repetitions with Backtracking -- Greedy Conjecture for Strings of Length 4 -- Tighter Bounds for the Sum of Irreducible LCP Values -- Parallel External Memory Suffix Sorting -- On Maximal Unbordered Factors -- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree -- Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints -- A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS Algorithm -- Encoding Nearest Larger Values -- Sorting by Cuts, Joins andWhole Chromosome Duplications. | |
520 | _aThis book constitutes the refereed proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015, held on Ischia Island, Italy, in June/July 2015. The 34 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 83 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 |
_aPattern recognition systems. _93953 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aArtificial intelligence _xData processing. _921787 |
|
650 | 0 |
_aBioinformatics. _99561 |
|
650 | 1 | 4 |
_aAutomated Pattern Recognition. _931568 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aData Science. _934092 |
650 | 2 | 4 |
_aComputational and Systems Biology. _931619 |
700 | 1 |
_aCicalese, Ferdinando. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _996410 |
|
700 | 1 |
_aPorat, Ely. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _996412 |
|
700 | 1 |
_aVaccaro, Ugo. _eeditor. _0(orcid) _10000-0003-4085-7300 _4edt _4http://id.loc.gov/vocabulary/relators/edt _996413 |
|
710 | 2 |
_aSpringerLink (Online service) _996415 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783319199283 |
776 | 0 | 8 |
_iPrinted edition: _z9783319199306 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v9133 _996416 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-319-19929-0 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c87305 _d87305 |