Combinatorial pattern matching : 15th annual symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004 : proceedings
Enregistré dans:
| Hovedforfatter: | |
|---|---|
| Institution som forfatter: | |
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
3109 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
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, 15th annual symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004, proceedings, Suleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusoz (eds.), Berlin, Springer, 2004, 1 vol. (XI-486 p.), Lecture notes in computer science, 3-540-22341-X • Combinatorial Pattern Matching, Texte imprimé, 9783662202333 |
| LEADER | 04658nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 971869 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155214357 | ||
| 020 | |a 9783540278016 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 100 | 1 | |a Sahinalp, Suleyman Cenk. | |
| 245 | 1 | 0 | |a Combinatorial pattern matching : |b 15th annual symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004 : proceedings |c [edited by] Suleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusoz. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 3109 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Sorting by Reversals in Subquadratic Time -- Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs -- Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity -- Optimizing Multiple Spaced Seeds for Homology Search -- Approximate Labelled Subtree Homeomorphism -- On the Average Sequence Complexity -- Approximate Point Set Pattern Matching on Sequences and Planes -- Finding Biclusters by Random Projections -- Real-Time String Matching in Sublinear Space -- On the k-Closest Substring and k-Consensus Pattern Problems -- A Trie-Based Approach for Compacting Automata -- A Simple Optimal Representation for Balanced Parentheses -- Two Algorithms for LCS Consecutive Suffix Alignment -- Efficient Algorithms for Finding Submasses in Weighted Strings -- Maximum Agreement and Compatible Supertrees -- Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem -- Small Phylogeny Problem: Character Evolution Trees -- The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices -- A Computational Model for RNA Multiple Structural Alignment -- Computational Design of New and Recombinant Selenoproteins -- A Combinatorial Shape Matching Algorithm for Rigid Protein Docking -- Multi-seed Lossless Filtration -- New Results for the 2-Interval Pattern Problem -- A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes -- Sparse Normalized Local Alignment -- Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences -- Maximal Common Connected Sets of Interval Graphs -- Performing Local Similarity Searches with Variable Length Seeds -- Reversal Distance without Hurdles and Fortresses -- A Fast Set Intersection Algorithm for Sorted Sequences -- Faster Two Dimensional Pattern Matching with Rotations -- Compressed Compact Suffix Arrays -- Approximate String Matching Using Compressed Suffix Arrays -- Compressed Index for a Dynamic Collection of Texts -- Improved Single and Multiple Approximate String Matching -- Average-Case Analysis of Approximate Trie Search. | |
| 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 Algorithmes | ||
| 650 | |a Perception des structures | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Informatique documentaire | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Muthukrishnan, S. |4 pbd | |
| 700 | 1 | |a Dogrusoz, Ugur. |4 pbd | |
| 711 | 2 | |a Annual Symposium on Combinatorial Pattern Matching |n (15th |d :2004 |c :Istanbul, Turkey). |4 aut | |
| 776 | 0 | |0 080633234 |t Combinatorial pattern matching |o 15th annual symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004 |o proceedings |f Suleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusoz (eds.) |c Berlin |n Springer |d 2004 |p 1 vol. (XI-486 p.) |s Lecture notes in computer science |z 3-540-22341-X | |
| 776 | 0 | |t Combinatorial Pattern Matching |b Texte imprimé |z 9783662202333 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b98377 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-KXNVG429-M |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750647817 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b98377 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:75399853X |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b98377 |z Accès INSA CVL | |
| 997 | |0 971869 |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/ | ||