Combinatorial pattern matching : third annual symposium, Tucson, Arizona, USA, April 29-May 1, 1992 : proceedings

This volume contains the 22 papers accepted for presentation at the Third Annual Symposium on Combinatorial Pattern Matching held April 29 to May 1, 1992, in Tucson, Arizona; it constitutes the first conference proceedings entirely devoted to combinatorial pattern matching (CPM). CPM deals withissue...

Полное описание

Сохранить в:
Библиографические подробности
Соавтор: Combinatorial pattern matching. Annual symposium :Tucson, Ariz.
Другие авторы: Apostolico, Alberto, 1948- (Публикующий директор), Crochemore, Maxime, 1947- (Публикующий директор), Galil, Zvi, 1947- (Публикующий директор)
Формат: Livre numérique
Язык:Anglais
Опубликовано: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Серии:Lecture notes in computer science 644
Предметы:
Online-ссылка: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, third annual symposium, Tucson, Arizona, USA, April 29-May 1, 1992, proceedings, A. Apostolico, Maxime Crochemore, Zvi Galil ... [et al.], 1992, Berlin, Springer, 1 vol. (X-287 p.), Lecture notes in computer science, 3-540-56024-6
• Combinatorial Pattern Matching, Texte imprimé, 9783662166697
LEADER 04824nam a22004577a 4500
001 945091
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155214284
020 |a 9783540473572 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a Combinatorial pattern matching.  |b Annual symposium  |n (03  |d  :1992  |c  :Tucson, Ariz.). 
245 1 0 |a Combinatorial pattern matching :  |b third annual symposium, Tucson, Arizona, USA, April 29-May 1, 1992 : proceedings   |c [edited by] A. Apostolico, Maxime Crochemore, Zvi 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 644  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Probabilistic analysis of generalized suffix trees -- A language approach to string searching evaluation -- Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm -- Fast multiple keyword searching -- Heaviest increasing/common subsequence problems -- Approximate regular expression pattern matching with concave gap penalties -- Matrix longest common subsequence problem, duality and hilbert bases -- From regular expressions to DFA's using compressed NFA's -- Identifying periodic occurrences of a template with applications to protein structure -- Edit distance for genome comparison based on non-local operations -- 3-D substructure matching in protein Molecules -- Fast serial and parallel algorithms for approximate tree matching with VLDC's (Extended Abstract) -- Grammatical tree matching -- Theoretical and empirical comparisons of approximate string matching algorithms -- Fast and practical approximate string matching -- DZ A text compression algorithm for natural languages -- Multiple alignment with guaranteed error bounds and communication cost -- Two algorithms for the longest common subsequence of three (or more) strings -- Color Set Size problem with applications to string matching -- Computing display conflicts in string and circular string visualization -- Efficient randomized dictionary matching algorithms -- Dynamic dictionary matching with failure functions. 
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 This volume contains the 22 papers accepted for presentation at the Third Annual Symposium on Combinatorial Pattern Matching held April 29 to May 1, 1992, in Tucson, Arizona; it constitutes the first conference proceedings entirely devoted to combinatorial pattern matching (CPM). CPM deals withissues of searching and matching of strings and other more complicated patterns such as trees, regular expressions, extended expressions, etc. in order to derive combinatorial properties for such structures. As an interdisciplinary field of growing interest, CPM is related to research in information retrieval, pattern recognition, compilers, data compression, and program analysis as well as to results, problems and methods from combinatorial mathematics and molecular biology. 
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 Apostolico, Alberto,  |d 1948-  |4 pbd 
700 1 |a Crochemore, Maxime,  |d 1947-  |4 pbd 
700 1 |a Galil, Zvi,  |d 1947-  |4 pbd 
776 0 |0 015206912  |t Combinatorial pattern matching  |o third annual symposium, Tucson, Arizona, USA, April 29-May 1, 1992  |o proceedings  |f A. Apostolico, Maxime Crochemore, Zvi Galil ... [et al.]  |d 1992  |c Berlin  |n Springer  |p 1 vol. (X-287 p.)  |s Lecture notes in computer science  |z 3-540-56024-6 
776 0 |t Combinatorial Pattern Matching  |b Texte imprimé  |z 9783662166697 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-56024-6  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-4NBZ72MW-Q  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747913757  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-56024-6  |z Accès Université d'Orléans 
856 4 |5 180339901:750926511  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-56024-6  |z Accès INSA CVL 
997 |0 945091  |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/