Combinatorial Pattern Matching
21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings,
1st Edition
Published on 1. June 2010
Book
Paperback/Softback
XIII, 362 pages
978-3-642-13508-8 (ISBN)
Description
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.
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.
More details
Series
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
84 s/w Abbildungen
XIII, 362 p. 84 illus.
Dimensions
Height: 0 mm
Width: 0 mm
Weight
568 gr
ISBN-13
978-3-642-13508-8 (9783642135088)
DOI
10.1007/978-3-642-13509-5
Schweitzer Classification
Other editions
Additional editions
Amihood Amir | Laxmi Parida
Combinatorial Pattern Matching
21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings,
E-Book
06/2010
Springer
€53.49
Available for download
Content
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 andDistributed Compressed Indexes.