- Shopping Bag ( 0 items )
Other sellers (Paperback)
-
All (8) from $55.78
-
New (6) from $55.78
-
Used (2) from $78.25
More About This Textbook
Overview
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.
Product Details
Table of Contents
Algorithms for Forest Pattern Matching Kaizhong Zhang Yunkun Zhu 1
Affine Image Matching Is Uniform TC0-Complete Christian Hundt 13
Old and New in Stringology Zvi Galil 26
Small-Space 2D Compressed Dictionary Matching Shoshana Neuburger Dina Sokol 27
Bidirectional Search in a String with Wavelet Trees Thomas Schnattinger Enno Ohlebusch Simon Gog 40
A Minimal Periods Algorithm with Applications Zhi Xu 51
The Property Suffix Tree with Dynamic Properties Tsvi Kopelowitz 63
Approximate All-Pairs Suffix/Prefix Overlaps Niko Välimäki Susana Ladra Veli Mäkinen 76
Succinct Dictionary Matching with No Slowdown Djamal Belazzougui 88
Pseudo-realtime Pattern Matching: Closing the Gap Raphaël Clifford Benjamin Sach 101
Breakpoint Distance and PQ-Trees Haitao Jiang Cedric Chauve Binhai Zhu 112
On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs Minghui Jiang 125
Succinct Representations of Separable Graphs Guy E. Blelloch Arash Farzan 138
Implicit Hitting Set Problems and Multi-genome Alignment Richard M. Karp 151
Bounds on the Minimum Mosaic of Population Sequences under Recombination Yufeng Wu 152
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection Michal Nánási Tomáš Vinar Brona Brejová 164
Phylogeny- and Parsimony-Based Haplotype Inference with Constraints Michael Elberfeld Till Tantau 177
Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks Tetsuo Asano Jesper Jansson Kunihiko Sadakane Ryuhei Uehara Gabriel Valiente 190
Mod/Resc Parsimony Inference Igor Nor Danny Hermelin Sylvain Gharlat Jan Engeistadter Max Reuter Olivier Duron Marie-France Sagot 202
Extended Islands of Tractability for Parsimony Haplotyping Rudolf Fleischer Jiong Guo Rolf Niedermeier Johannes Uhlmann Yihui Wang Mathias Weller Xi Wu 214
Sampled Longest Common Prefix Array Jouni Sirén 227
Verifying a Parameterized Border Array in O(n1.5) Time Tomohiro I Shunsuke Inenaga Hideo Bannai Masayuki Takeda 238
Cover Array String Reconstruction Maxime Crochemore Costas S. Iliopoulos Solon P. Pissis German Tischler 251
Compression, Indexing, and Retrieval for Massive String Data Wing-Kai Hon Rahul Shah Jeffrey Scott Vitter 260
Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality Omar AitMous Frédérique Bassino Cyril Nicaud 275
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach Domenico Cantone Simone Faro Emanuele Giaquinta 288
Algorithms for Three Versions of the Shortest Common Superstring Problem Maxime Crochemore Marek Cygan Costas S. Iliopoulos Marcin Kubica Jakub Radoszeuiski Wojciech Rytter Tomasz Walen 299
Finding Optimal Alignment and Consensus of Circular Strings Taehyung Lee Joong Chae Na Heejin Park Kunsoo Park Jeong Seop Sim 310
Optimizing Restriction Site Placement for Synthetic Genomes Pablo Montes Heraldo Memelli Charles Ward Joondong Kim Joseph S.B. Mitchell Steven Skiena 323
Extension and Faster Implementation of the GRP Transform for Lossless Compression Hidetoshi Yakoo 338
Parallel and Distributed Compressed Indexes Luís M.S. Russo Gonzalo Navarro Arlindo L. Oliveira 348
Author Index 361