Combinatorial pattern matching : 11th annual symposium, CPM 2000, Montreal, Canada, June 21-23, 2000 : proceedings
Đã lưu trong:
| Tác giả của công ty: | |
|---|---|
| Tác giả khác: | , |
| Định dạng: | Livre numérique |
| Ngôn ngữ: | Anglais |
| Được phát hành: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Loạt: | Lecture notes in computer science
1848 |
| Những chủ đề: | |
| Truy cập trực tuyến: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Chú thích: |
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 |
| LEADER | 04610nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 948884 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155196014 | ||
| 020 | |a 9783540451235 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 006.4015116 | ||
| 111 | 2 | |a Combinatorial pattern matching. |b Annual symposium |n (11 |d :2000 |c :Montreal, Canada). | |
| 245 | 1 | 0 | |a Combinatorial pattern matching : |b 11th annual symposium, CPM 2000, Montreal, Canada, June 21-23, 2000 : proceedings |c [edited by] Raffaele Giancarlo, David Sankoff. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1848 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 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 Informatique | ||
| 650 | |a Reconnaissance des formes (informatique) | ||
| 650 | |a Algorithmes | ||
| 650 | |a Perception des structures | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Informatique documentaire | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Giancarlo, Raffaele. |4 pbd | |
| 700 | 1 | |a Sankoff, David, |d 1942- |4 pbd | |
| 776 | 0 | |0 051992558 |t Combinatorial pattern matching |o 11th annual symposium, CPM 2000, Montreal, Canada, June 21-23, 2000 |o proceedings |f Raffaele Giancarlo, David Sankoff (eds.) |c Berlin |n Springer |d 2000 |p 1 vol. (XI-422 p.) |s Lecture notes in computer science |z 3-540-67633-3 | |
| 776 | 0 | |t Combinatorial Pattern Matching |b Texte imprimé |z 9783662201190 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-45123-4 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-QNQH6NC4-M |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:748058036 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45123-4 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:751509418 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45123-4 |z Accès INSA CVL | |
| 997 | |0 948884 |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/ | ||