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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Amir, Amihood (Επιμελητής έκδοσης), Parida, Laxmi (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Lecture Notes in Computer Science, 6129
• Θέματα: Computer science.; Computer programming.; Data structures (Computer science).; Algorithms.; Data mining.; Pattern recognition.; Life sciences.; Computer Science.; Pattern Recognition.; Life Sciences, general.; Programming Techniques.; Algorithm Analysis and Problem Complexity.; Data Structures.; Data Mining and Knowledge Discovery.

Πίνακας περιεχομένων:

• 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.