Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings by Gregory KucherovCombinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings by Gregory Kucherov

Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009…

byGregory KucherovEditorEsko Ukkonen

Paperback | June 8, 2009

Pricing and Purchase Info

$125.55 online 
$150.50 list price save 16%
Earn 628 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching, CPM 2009, held in Lille, France in June 2009.The 27 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 63 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.
Title:Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009…Format:PaperbackDimensions:370 pages, 23.5 × 15.5 × 0.07 inPublished:June 8, 2009Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642024408

ISBN - 13:9783642024405

Look for similar items by category:

Reviews

Table of Contents

CPM's 20th Anniversary: A Statistical Retrospective.- Quasi-distinct Parsing and Optimal Compression Methods.- Generalized Substring Compression.- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques.- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure.- Linear Time Suffix Array Construction Using D-Critical Substrings.- On the Value of Multiple Read/Write Streams for Data Compression.- Reoptimization of the Shortest Common Superstring Problem.- LCS Approximation via Embedding into Local Non-repetitive Strings.- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings.- Fast Searching in Packed Strings.- New Complexity Bounds for Image Matching under Rotation and Scaling.- Online Approximate Matching with Non-local Distances.- Faster and Space-Optimal Edit Distance "1" Dictionary.- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard.- Modeling and Algorithmic Challenges in Online Social Networks.- Permuted Longest-Common-Prefix Array.- Periodic String Comparison.- Deconstructing Intractability: A Case Study for Interval Constrained Coloring.- Maximum Motif Problem in Vertex-Colored Graphs.- Fast RNA Structure Alignment for Crossing Input Structures.- Sparse RNA Folding: Time and Space Efficient Algorithms.- Multiple Alignment of Biological Networks: A Flexible Approach.- Graph Mining: Patterns, Generators and Tools.- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time.- The Structure of Level-k Phylogenetic Networks.- Finding All Sorting Tandem Duplication Random Loss Operations.- Average-Case Analysis of Perfect Sorting by Reversals.- Statistical Properties of Factor Oracles.- Haplotype Inference Constrained by Plausible Haplotype Data.- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).