Combinatorial pattern matching : 8th Annual Symposium, CPM 97 Aarhus, Denmark, June 30 July 2, 1997 : proceedings
This book constitutes the refereed proceedings of the Eighth Annual Symposium on Combinatorial Pattern Matching, CPM 97, held in Aarhus, Denmark, in June/July 1997. The volume presents 20 revised full papers carefully selected from 32 submissions received; also included are abstracts of two invited...
Shranjeno v:
| Korporativna značnica: | |
|---|---|
| Drugi avtorji: | , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
1264 |
| Teme: | |
| Online dostop: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Sporočilo: |
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, 8th Annual Symposium, CPM 97, Aarhus, Denmark, June 30-July 2, 1997, proceedings, Alberto Apostolico, Jotun Hein (eds.), 1997, Berlin, Springer, 1 vol. (VIII-274 p.), Lecture notes in computer science, 3-540-63220-4 • Combinatorial Pattern Matching, Texte imprimé, 9783662186244 |
Kazalo:
- An improved pattern matching algorithm for strings in terms of straight-line programs
- Episode matching
- Efficient algorithms for approximate string matching with swaps
- On the complexity of pattern matching for highly compressed two-dimensional texts
- Estimating the probability of approximate matches
- Space- and time-efficient decoding with canonical huffman trees
- On weak circular squares in binary words
- An easy case of sorting by reversals
- External inverse pattern matching
- Distributed generation of suffix arrays
- Direct construction of compact directed acyclic word graphs
- Approximation algorithms for the fixed-topology phylogenetic number problem
- A new algorithm for the ordered tree inclusion problem
- On incremental computation of transitive closure and greedy alignment
- Aligning coding DNA in the presence of frame-shift errors
- A filter method for the weighted local similarity search problem
- Trie-based data structures for sequence assembly
- Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices
- Banishing bias from consensus sequences
- On the Nadeau-Taylor theory of conserved chromosome segments
- Iterative versus simultaneous multiple sequence alignment
- Modern comparative lexicostatistics.