Combinatorial pattern matching : 4th annual symposium, CPM 93, Padova, Italy, June 2 4, 1993 : proceedings
The papers contained in this volume were presented at the Fourth Annual Symposium on Combinatorial Pattern Matching, held in Padova, Italy, in June 1993. Combinatorial pattern matching addresses issues of searching and matching of strings and more complicated patterns such as trees, regular expressi...
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , , |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
684 |
| Materias: | |
| Acceso en línea: | 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, 4th annual symposium, CPM 93, Padova, Italy, June 1993, proceedings, A. Apostolico, Maxime Crochemore, Zvi Galil ... [et al.], 1993, Berlin, Springer, 1 vol. (VIII-265 p.), Lecture notes in computer science, 3-540-56764-X • Combinatorial Pattern Matching, Texte imprimé, 9783662177785 |
Tabla de Contenidos:
- A linear time pattern matching algorithm between a string and a tree
- Tight comparison bounds for the string prefix-matching problem
- 3-D docking of protein molecules
- Minimal separators of two words
- Covering a string
- On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of k strings
- An algorithm for locating non-overlapping regions of maximum alignment score
- Exact and approximation algorithms for the inversion distance between two chromosomes
- The maximum weight trace problem in multiple sequence alignment
- An algorithm for approximate tandem repeats
- Two dimensional pattern matching in a digitized image
- Analysis of a string edit problem in a probabilistic framework
- Detecting false matches in string matching algorithms
- On suboptimal alignments of biological sequences
- A fast filtration algorithm for the substring matching problem
- A unifying look at d-dimensional periodicities and space coverings
- Approximate string-matching over suffix trees
- Multiple sequence comparison and n-dimensional image reconstruction
- A new editing based distance between unordered labeled trees.