Combinatorial pattern matching : 9th annual symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998 : proceedings
This book constitutes the refereed proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, CPM 98, held in Piscataway, NJ, USA, in July 1998. The 17 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers address all current issues...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
1448 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
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, 9th annual symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998, proceedings, Martin Farach-Colton (ed.), 1998, Berlin, Springer, 1 vol. (VIII-250 p.), Lecture notes in computer science, 3-540-64739-2 • Combinatorial Pattern Matching, Texte imprimé, 9783662189894 |
Obsah:
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- A bit-parallel approach to suffix automata: Fast extended string matching
- A dictionary matching algorithm fast on the average for terms of varying length
- A very fast string matching algorithm for small alphabets and long patterns
- Approximate word sequence matching over Sparse Suffix Trees
- Efficient parallel algorithm for the editing distance between ordered trees
- Reporting exact and approximate regular expression matches
- An approximate oracle for distance in metric spaces
- A rotation invariant filter for two-dimensional string matching
- Constructing suffix arrays for multi-dimensional matrices
- Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version
- Comparison of coding DNA
- Fixed topology alignment with recombination
- Aligning alignments
- Efficient special cases of pattern matching with swaps
- Aligning DNA sequences to minimize the change in protein
- Genome halving.