TY  - BOOK
AU  - Ferragina,Paolo
AU  - Landau,Gad M.
ED  - SpringerLink (Online service)
TI  - Combinatorial Pattern Matching: 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008 Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783540690689
AV  - QA76.9.A43 
U1  - 005.1 23
PY  - 2008///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Data structures (Computer science)
KW  - Computer software
KW  - Data mining
KW  - Text processing (Computer science
KW  - Optical pattern recognition
KW  - Bioinformatics
KW  - Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Pattern Recognition
KW  - Document Preparation and Text Processing
KW  - Data Mining and Knowledge Discovery
KW  - Computational Biology/Bioinformatics
KW  - Data Structures
N1  - Invited Talks -- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations -- Lower Bounds for Succinct Data Structures -- The Changing Face of Web Search -- Contributed Papers -- Two-Dimensional Pattern Matching with Combined Scaling and Rotation -- Searching for Gapped Palindromes -- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems -- Finding Largest Well-Predicted Subset of Protein Structure Models -- HP Distance Via Double Cut and Join Distance -- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots -- Faster Algorithm for the Set Variant of the String Barcoding Problem -- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics -- Analysis of the Size of Antidictionary in DCA -- Approximate String Matching with Address Bit Errors -- On-Line Approximate String Matching with Bounded Errors -- A Black Box for Online Approximate Pattern Matching -- An(other) Entropy-Bounded Compressed Suffix Tree -- On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices -- Computing Inverse ST in Linear Complexity -- Dynamic Fully-Compressed Suffix Trees -- A Linear Delay Algorithm for Building Concept Lattices -- Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares -- Fast Algorithms for Computing Tree LCS -- Why Greed Works for Shortest Common Superstring Problem -- Constrained LCS: Hardness and Approximation -- Finding Additive Biclusters with Random Background -- An Improved Succinct Representation for Dynamic k-ary Trees -- Towards a Solution to the “Runs” Conjecture -- On the Longest Common Parameterized Subsequence
N2  - This book constitutes the refereed proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008, held in Pisa, Italy, in June 2008. The 25 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 78 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as coding and data compression, computational biology, data mining, information retrieval, natural language processing, pattern recognition, string algorithms, string processing in databases, symbolic computing and text searching
UR  - http://dx.doi.org/10.1007/978-3-540-69068-9
ER  -