Combinatorial Pattern Matching

26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings
Herausgegeben:Cicalese, Ferdinando; Porat, Ely; Vaccaro, Ugo

• Broschiertes Buch

Produktbeschreibung

This 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.

Produktdetails

• Theoretical Computer Science and General Issues 9133
• Verlag: Springer / Springer International Publishing / Springer, Berlin
• Artikelnr. des Verlages: 978-3-319-19928-3
• 2015
• Seitenzahl: 432
• Erscheinungstermin: 26. Juni 2015
• Englisch
• Abmessung: 235mm x 155mm x 24mm
• Gewicht: 651g
• ISBN-13: 9783319199283
• ISBN-10: 3319199285
• Artikelnr.: 42710046

Inhaltsangabe

On 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 ISAlgorithm.- Encoding Nearest Larger Values.- Sorting by Cuts, Joins andWhole Chromosome Duplications.