Combinatorial pattern matching : 11th annual symposium, CPM 2000, Montreal, Canada, June 21-23, 2000 : proceedings
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
1848 |
| 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, 11th annual symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, proceedings, Raffaele Giancarlo, David Sankoff (eds.), Berlin, Springer, 2000, 1 vol. (XI-422 p.), Lecture notes in computer science, 3-540-67633-3 • Combinatorial Pattern Matching, Texte imprimé, 9783662201190 |
Tabla de Contenidos:
- Invited Lectures
- Identifying and Filtering Near-Duplicate Documents
- Machine Learning for Efficient Natural-Language Processing
- Browsing around a Digital Library: Today and Tomorrow
- Summer School Lectures
- Algorithmic Aspects of Speech Recognition: A Synopsis
- Some Results on Flexible-Pattern Discovery
- Contributed Papers
- Explaining and Controlling Ambiguity in Dynamic Programming
- A Dynamic Edit Distance Table
- Parametric Multiple Sequence Alignment and Phylogeny Construction
- Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment
- A Polynomial Time Approximation Scheme for the Closest Substring Problem
- Approximation Algorithms for Hamming Clustering Problems
- Approximating the Maximum Isomorphic Agreement Subtree Is Hard
- A Faster and Unifying Algorithm for Comparing Trees
- Incomplete Directed Perfect Phylogeny
- The Longest Common Subsequence Problem for Arc-Annotated Sequences
- Boyer Moore String Matching over Ziv-Lempel Compressed Text
- A Boyer Moore Type Algorithm for Compressed Pattern Matching
- Approximate String Matching over Ziv Lempel Compressed Text
- Improving Static Compression Schemes by Alphabet Extension
- Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments
- A Lower Bound for the Breakpoint Phylogeny Problem
- Structural Properties and Tractability Results for Linear Synteny
- Shift Error Detection in Standardized Exams
- An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC)
- The Combinatorial Partitioning Method
- Compact Suffix Array
- Linear Bidirectional On-Line Construction of Affix Trees
- Using Suffix Trees for Gapped Motif Discovery
- Indexing Text with Approximate q-Grams
- Simple Optimal String Matching Algorithm.-Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts
- Periods and Quasiperiods Characterization
- Finding Maximal Quasiperiodicities in Strings
- On the Complexity of Determining the Period of a String.