Combinatorial Pattern Matching 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999 Proceedings /
Combinatorial Pattern Matching 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999 Proceedings / [electronic resource] :
edited by Maxime Crochemore, Mike Paterson.
- 1st ed. 1999.
- VIII, 304 p. online resource.
- Lecture Notes in Computer Science, 1645 1611-3349 ; .
- Lecture Notes in Computer Science, 1645 .
Shift-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.
9783540484523
10.1007/3-540-48452-3 doi
Pattern recognition systems.
Computer programming.
Data structures (Computer science).
Information theory.
Algorithms.
Artificial intelligence--Data processing.
Computer science--Mathematics.
Discrete mathematics.
Automated Pattern Recognition.
Programming Techniques.
Data Structures and Information Theory.
Algorithms.
Data Science.
Discrete Mathematics in Computer Science.
Q337.5 TK7882.P3
006.4
Shift-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.
9783540484523
10.1007/3-540-48452-3 doi
Pattern recognition systems.
Computer programming.
Data structures (Computer science).
Information theory.
Algorithms.
Artificial intelligence--Data processing.
Computer science--Mathematics.
Discrete mathematics.
Automated Pattern Recognition.
Programming Techniques.
Data Structures and Information Theory.
Algorithms.
Data Science.
Discrete Mathematics in Computer Science.
Q337.5 TK7882.P3
006.4