Combinatorial pattern matching : 5th annual symposium, CPM 94, Asilomar, CA, USA, June 5-8, 1994 : proceedings
This volume presents the proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, held at Asilomar, California, in June 1994. The 26 selected papers in this volume are organized in chapters on Alignments, Various Matchings, Combinatorial Aspects, and Bio-Informatics. Combinatoria...
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
807 |
| 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, 5th annual symposium, CPM 94, Asilomar, CA, USA, June 5-8, 1994, proceedings, Maxime Crochemore, Dan Gusfield (eds), 1994, Berlin, Springer, 1 vol. (325 p.), Lecture notes in computer science, 0-387-58094-8 • Combinatorial Pattern Matching, Texte imprimé, 9783662191415 |
Taula de continguts:
- A space efficient algorithm for finding the best non-overlapping alignment score
- The parameterized complexity of sequence alignment and consensus
- Computing all suboptimal alignments in linear space
- Approximation algorithms for multiple sequence alignment
- A context dependent method for comparing sequences
- Fast identification of approximately matching substrings
- Alignment of trees An alternative to tree edit
- Parametric recomputing in alignment graphs
- A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms
- A text compression scheme that allows fast searching directly in the compressed file
- An alphabet-independent optimal parallel search for three dimensional pattern
- Unit route upper bound for string-matching on hypercube
- Computation of squares in a string
- Minimization of sequential transducers
- Shortest common superstrings for strings of random letters
- Maximal common subsequences and minimal common supersequences
- Dictionary-matching on unbounded alphabets: Uniform length dictionaries
- Proximity matching using fixed-queries trees
- Query primitives for tree-structured data
- Multiple matching of parameterized patterns
- Approximate string matching with don't care characters
- Matching with matrix norm minimization
- Approximate string matching and local similarity
- Polynomial-time algorithms for computing characteristic strings
- Recent methods for RNA modeling using stochastic context-free grammars
- Efficient bounds for oriented chromosome inversion distance.