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

Saved in:

Authors and Corporations:	Amir, Amihood (Author), Parida, Laxmi (Other)
Title:	Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings/ edited by Amihood Amir, Laxmi Parida
Type of Resource:	E-Book Conference Proceedings
Language:	English
published:	Berlin, Heidelberg Springer Berlin Heidelberg 2010
Series:	SpringerLink Lecture notes in computer science ; 6129
Subjects:	Computer science Data structures (Computer science) Computer software Optical pattern recognition Bioinformatics Computer Science Data mining Life sciences. Computer programming. Algorithms. Artificial intelligence Pattern recognition systems. Konferenzschrift > 2010 > New York, NY
Buchausg. u.d.T.:	Combinatorial pattern matching, Berlin : Springer, 2010, XIII, 362 S.
Source:	Verbunddaten SWB
Access Information:	Elektronischer Volltext - Campuslizenz

Description
Abstract:	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.
Physical Description:	Online-Ressource (XIII, 362p. 84 illus, digital)
ISBN:	9783642135095
DOI:	10.1007/978-3-642-13509-5