LEADER 05894nam 22008655 450 001 996198521103316 005 20230329173147.0 010 $a3-319-19929-3 024 7 $a10.1007/978-3-319-19929-0 035 $a(CKB)3710000000436889 035 $a(SSID)ssj0001558453 035 $a(PQKBManifestationID)16183011 035 $a(PQKBTitleCode)TC0001558453 035 $a(PQKBWorkID)14818880 035 $a(PQKB)10320531 035 $a(DE-He213)978-3-319-19929-0 035 $a(MiAaPQ)EBC6283209 035 $a(MiAaPQ)EBC5587239 035 $a(Au-PeEL)EBL5587239 035 $a(OCoLC)911617210 035 $a(PPN)186399472 035 $a(EXLCZ)993710000000436889 100 $a20150615d2015 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching$b[electronic resource] $e26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings /$fedited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XIX, 412 p. 69 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9133 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-19928-5 327 $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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9133 606 $aPattern recognition systems 606 $aAlgorithms 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence?Data processing 606 $aBioinformatics 606 $aAutomated Pattern Recognition 606 $aAlgorithms 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 606 $aComputational and Systems Biology 615 0$aPattern recognition systems. 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence?Data processing. 615 0$aBioinformatics. 615 14$aAutomated Pattern Recognition. 615 24$aAlgorithms. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 615 24$aComputational and Systems Biology. 676 $a005.1 702 $aCicalese$b Ferdinando$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPorat$b Ely$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aVaccaro$b Ugo$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996198521103316 996 $aCombinatorial Pattern Matching$9772744 997 $aUNISA