Contact Us Need Help? Call us 1800-987-323
Explore Departments
  Free shipping Australia wide

Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010 New York, NY, USA, June 21-23, 2010, Proceedings

  • Paperback
This book constitutes the refereed proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, held in New York, USA, in June 2010. The 28 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 53 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays with special focus on 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.
Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010 New York, NY, USA, June 21-23, 2010, Proceedings
$170.65 + free shipping
Ships from USA
Expected delivery Oct 10 – Oct 14
The papers contained in this volume were presented at the 21st Annual S- posium on Combinatorial Pattern Matching (CPM 2010) held at NYU-Poly, Brooklyn, New York during June 21-23, 2010. Allthe paperspresentedatthe conferenceareoriginalresearchcontributions. We received 53 submissions from 21 countries. Each paper was reviewed by at least three reviewers. The committee decided to accept 28 papers. The program also includes three invited talks by Zvi Galil from Tel Aviv University, Israel, Richard M. Karp from University of California at Berkeley, USA, and Je?rey S. Vitter from Texas A&M University, USA. The objective of the annual CPM meetings is to provide an international forum for research in combinatorial pattern matching and related applications. It addresses issues of searching and matching strings and more complicated p- terns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivialcombinatorialproperties of suchstructures and to exploit these properties in order to either achieve superior performance for the cor- sponding computational problems or pinpoint conditions under which searches cannot be performed e?ciently.
The meeting also deals with problems in c- putational biology, data compression and data mining, coding, information - trieval, natural language processing and pattern recognition. TheAnnual SymposiumonCombinatorialPatternMatchingstartedin 1990, andhassincetakenplaceeveryyear.PreviousCPM meetingswereheld inParis, London, Tucson, Padova, Asilomar, Helsinki, Laguna Beach, Aarhus, Pisc- away, Warwick, Montreal, Jerusalem, Fukuoka, Morelia, Istanbul, Jeju Island, Barcelona, London, Ontario, Pisa, and Lille.
Algorithms for Forest Pattern Matching.- Affine Image Matching Is Uniform -Complete.- Old and New in Stringology.- Small-Space 2D Compressed Dictionary Matching.- Bidirectional Search in a String with Wavelet Trees.- A Minimal Periods Algorithm with Applications.- The Property Suffix Tree with Dynamic Properties.- Approximate All-Pairs Suffix/Prefix Overlaps.- Succinct Dictionary Matching with No Slowdown.- Pseudo-realtime Pattern Matching: Closing the Gap.- Breakpoint Distance and PQ-Trees.- On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs.- Succinct Representations of Separable Graphs.- Implicit Hitting Set Problems and Multi-genome Alignment.- Bounds on the Minimum Mosaic of Population Sequences under Recombination.- The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection.- Phylogeny- and Parsimony-Based Haplotype Inference with Constraints.- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks.- Mod/Resc Parsimony Inference.- Extended Islands of Tractability for Parsimony Haplotyping.- Sampled Longest Common Prefix Array.- Verifying a Parameterized Border Array in O(n 1.5) Time.- Cover Array String Reconstruction.- Compression, Indexing, and Retrieval for Massive String Data.- Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality.- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach.- Algorithms for Three Versions of the Shortest Common Superstring Problem.- Finding Optimal Alignment and Consensus of Circular Strings.- Optimizing Restriction Site Placement for Synthetic Genomes.- Extension and Faster Implementation of the GRP Transform for Lossless Compression.- Parallel and Distributed Compressed Indexes.
Short Title
Edition Description
Series Number
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Publication Date
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Place of Publication
Country of Publication
Edited by
Amihood Amir, Laxmi Parida
Lecture Notes in Computer Science
21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings,
84 black & white illustrations, biography

Delivery is free to any Australian address. No matter where your item is going.


We use 100% PCI DSS compliant payment services. That means your payment information is always protected, and never gets seen by anyone.


Return any item within 30 days of delivery. It doesn’t matter why you want to return your item, you can free of charge!