Maxime Crochemore Livres

This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases. Algorithms are described in a C-like language, with correctness proofs and complexity analysis, to make them ready to implement. The book will be an important resource for students and researchers in theoretical computer science, computational linguistics, computational biology, and software engineering.

InhaltsverzeichnisShift-And Approach to Pattern Matching in LZW Compressed Text.A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text.Pattern Matching in Text Compressed by Using Antidictionaries.On the Structure of Syntenic Distance.Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem.Hybridization and Genome Rearrangement.On the Complexity of Positional Sequencing by Hybridization.GESTALT: Genomic Steiner Alignments.Bounds on the Number of String Subsequences.Approximate Periods of Strings.Finding Maximal Pairs with Bounded Gap.A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes.A New Indexing Method for Approximate String Matching.The Compression of Subsegments of Images Described by Finite Automata.Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays.Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions.Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology.Fast Multi-dimensional Approximate Pattern Matching.Finding Common RNA Secondary Structures from RNA Sequences.Finding Common Subsequences with Arcs and Pseudoknots.Computing Similarity between RNA Structures.