Combinatorial pattern matching : ; proceedings 10th annual symposium, CPM 99, Warwick University, UK, July 22-24, 1999
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
1645 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Combinatorial pattern matching, 10th annual symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Maxime Crochemore, Mike Paterson, eds, 1999, Berlin, Springer, 1 vol. (VIII-293 p.), Lecture notes in computer science, 3-540-66278-2 • Combinatorial Pattern Matching, Texte imprimé, 9783662183809 |
Taula de continguts:
- 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.