Combinatorial pattern matching : 4th annual symposium, CPM 93, Padova, Italy, June 2 4, 1993 : proceedings

The papers contained in this volume were presented at the Fourth Annual Symposium on Combinatorial Pattern Matching, held in Padova, Italy, in June 1993. Combinatorial pattern matching addresses issues of searching and matching of strings and more complicated patterns such as trees, regular expressi...

תיאור מלא

שמור ב:
מידע ביבליוגרפי
מחבר תאגידי: Combinatorial pattern matching. Annual symposium :Padoue, Italie
מחברים אחרים: Galil, Zvi, 1947- (Directeur de la publication), Crochemore, Maxime, 1947- (Directeur de la publication), Apostolico, Alberto, 1948- (Directeur de la publication)
פורמט: Livre numérique
שפה:Anglais
יצא לאור: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
סדרה:Lecture notes in computer science 684
נושאים:
גישה מקוונת: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, 4th annual symposium, CPM 93, Padova, Italy, June 1993, proceedings, A. Apostolico, Maxime Crochemore, Zvi Galil ... [et al.], 1993, Berlin, Springer, 1 vol. (VIII-265 p.), Lecture notes in computer science, 3-540-56764-X
• Combinatorial Pattern Matching, Texte imprimé, 9783662177785
LEADER 04781nam a22004577a 4500
001 944045
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN15517276X
020 |a 9783540477327 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a Combinatorial pattern matching.  |b Annual symposium  |n (04  |d  :1993  |c  :Padoue, Italie). 
245 1 0 |a Combinatorial pattern matching :  |b 4th annual symposium, CPM 93, Padova, Italy, June 2 4, 1993 : proceedings   |c [edited by] A. Apostolico, M. Crochemore, Z. Galil... [et al.]. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 684  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a A linear time pattern matching algorithm between a string and a tree -- Tight comparison bounds for the string prefix-matching problem -- 3-D docking of protein molecules -- Minimal separators of two words -- Covering a string -- On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of k strings -- An algorithm for locating non-overlapping regions of maximum alignment score -- Exact and approximation algorithms for the inversion distance between two chromosomes -- The maximum weight trace problem in multiple sequence alignment -- An algorithm for approximate tandem repeats -- Two dimensional pattern matching in a digitized image -- Analysis of a string edit problem in a probabilistic framework -- Detecting false matches in string matching algorithms -- On suboptimal alignments of biological sequences -- A fast filtration algorithm for the substring matching problem -- A unifying look at d-dimensional periodicities and space coverings -- Approximate string-matching over suffix trees -- Multiple sequence comparison and n-dimensional image reconstruction -- A new editing based distance between unordered labeled trees. 
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 
520 |a The papers contained in this volume were presented at the Fourth Annual Symposium on Combinatorial Pattern Matching, held in Padova, Italy, in June 1993. Combinatorial pattern matching addresses issues of searching and matching of strings and more complicated patterns such as trees, regular expressions, extended expressions, etc. The goal is to derive nontrivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performance for the corresponding computational problems. In recent years, a steady flow of high-quality scientific studies of this subject has changed a sparse set of isolated results into a full-fledged area of algorithmics. The area is expected to grow even further due to the increasing demand for speedand efficiency that comes especially from molecular biology and the Genome project, but also from other diverse areas such as information retrieval, pattern recognition, compilers, data compression, and program analysis. 
650 |a Informatique 
650 |a Reconnaissance des formes (informatique) 
650 |a Algorithmes 
650 |a Codage 
650 |a Perception des structures 
650 |a Analyse combinatoire 
650 |a Informatique documentaire 
650 |a Actes de congrès 
700 1 |a Galil, Zvi,  |d 1947-  |4 pbd 
700 1 |a Crochemore, Maxime,  |d 1947-  |4 pbd 
700 1 |a Apostolico, Alberto,  |d 1948-  |4 pbd 
776 0 |0 01714311X  |t Combinatorial pattern matching  |o 4th annual symposium, CPM 93, Padova, Italy, June 1993  |o proceedings  |f A. Apostolico, Maxime Crochemore, Zvi Galil ... [et al.]  |d 1993  |c Berlin  |n Springer  |p 1 vol. (VIII-265 p.)  |s Lecture notes in computer science  |z 3-540-56764-X 
776 0 |t Combinatorial Pattern Matching  |b Texte imprimé  |z 9783662177785 
856 4 |q PDF  |u https://doi.org/10.1007/BFb0029791  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-NDZJNM2B-M  |z Accès sur la plateforme Istex 
856 4 |5 452349901:74792323X  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0029791  |z Accès Université d'Orléans 
856 4 |5 180339901:750935529  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0029791  |z Accès INSA CVL 
997 |0 944045  |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/