000 05034nam a22006135i 4500
001 978-3-319-19929-0
003 DE-He213
005 20200421111849.0
007 cr nn 008mamaa
008 150615s2015 gw | 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
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.
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 _aLecture Notes in Computer Science,
_x0302-9743 ;
_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 and Whole 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 _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 _aCicalese, Ferdinando.
_eeditor.
700 1 _aPorat, Ely.
_eeditor.
700 1 _aVaccaro, Ugo.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319199283
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9133
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-19929-0
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c55974
_d55974