Combinatorial Pattern Matching : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1 4, 2001 Proceedings
Enregistré dans:
| 主要作者: | |
|---|---|
| 企业作者: | |
| 其他作者: | |
| 格式: | Livre numérique |
| 语言: | Anglais |
| 出版: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| 丛编: | Lecture notes in computer science
2089 |
| 主题: | |
| 在线阅读: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
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, 12th annual symposium, CPM 2001, Jerusalem, Israel, July 1-4, 2001, proceedings, Amihood Amir, Gad M. Landau (eds.), 2001, Berlin, Springer, 1 vol. (VIII-271 p.), Lecture notes in computer science, 3-540-42271-4 • Combinatorial Pattern Matching, Texte imprimé, 9783540829430 |
| LEADER | 04037nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 949257 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155225030 | ||
| 020 | |a 9783540481942 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 245 | 0 | 0 | |a Combinatorial Pattern Matching : |b 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1 4, 2001 Proceedings |c by Gad M. Landau ; edited by Amihood Amir. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2089 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Regular Expression Searching over Ziv-Lempel Compressed Text -- Parallel Lempel Ziv Coding (Extended Abstract) -- Approximate Matching of Run-Length Compressed Strings -- What to Do with All this Hardware? (Invited Lecture) -- Efficient Experimental String Matching by Weak Factor Recognition* -- Better Filtering with Gapped q-Grams -- Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract) -- An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) -- A Very Elementary Presentation of the Hannenhalli-Pevzner Theory -- Tandem Cyclic Alignment -- An Output-Sensitive Flexible Pattern Discovery Algorithm -- Episode Matching* -- String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music -- Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract) -- Computing the Equation Automaton of a Regular Expression in O(s 2 ) Space and Time -- On-Line Construction of Compact Directed Acyclic Word Graphs* -- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications -- Multiple Pattern Matching Algorithms on Collage System -- Finding All Common Intervals of k Permutations -- Generalized Pattern Matching and the Complexity of Unavoidability Testing -- Balanced Suffix Trees (Invited Lecture) -- A Fast Algorithm for Optimal Alignment between Similar Ordered Trees -- Minimum Quartet Inconsistency Is Fixed Parameter Tractable -- Optimally Compact Finite Sphere Packings Hydrophobic Cores in the FCC. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Algorithmes | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Reconnaissance des formes (informatique) | ||
| 650 | |a Informatique | ||
| 650 | |a Codage | ||
| 650 | |a Perception des structures | ||
| 650 | |a Informatique documentaire | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Landau, Gad M. |4 aut | |
| 700 | 1 | |a Amir, Amihood. |4 pbd | |
| 711 | 2 | |a Combinatorial pattern matching. |b Annual symposium |n (12 |d :2001 |c :Jerusalem). |4 aut | |
| 776 | 0 | |0 058096698 |t Combinatorial pattern matching |o 12th annual symposium, CPM 2001, Jerusalem, Israel, July 1-4, 2001 |o proceedings |f Amihood Amir, Gad M. Landau (eds.) |d 2001 |c Berlin |n Springer |p 1 vol. (VIII-271 p.) |s Lecture notes in computer science |z 3-540-42271-4 | |
| 776 | 0 | |t Combinatorial Pattern Matching |b Texte imprimé |z 9783540829430 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-48194-X |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-5RN31X4G-D |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:74806043X |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-48194-X |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:751511951 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-48194-X |z Accès INSA CVL | |
| 997 | |0 949257 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||