Zur Zeit liegt uns keine Inhaltsangabe vor.
Inhaltsverzeichnis
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.
