LEADER 05573nam 22007935 450 001 996465491703316 005 20200629121618.0 010 $a3-540-47357-2 024 7 $a10.1007/3-540-56024-6 035 $a(CKB)1000000000233880 035 $a(SSID)ssj0000321920 035 $a(PQKBManifestationID)11277381 035 $a(PQKBTitleCode)TC0000321920 035 $a(PQKBWorkID)10280232 035 $a(PQKB)10906364 035 $a(DE-He213)978-3-540-47357-2 035 $a(PPN)155214284 035 $a(EXLCZ)991000000000233880 100 $a20121227d1992 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching$b[electronic resource] $eThird Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings /$fedited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber 205 $a1st ed. 1992. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1992. 215 $a1 online resource (XI, 293 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v644 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-56024-6 327 $aProbabilistic 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. 330 $aThis 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v644 606 $aPattern recognition 606 $aAlgorithms 606 $aDiscrete mathematics 606 $aNatural language processing (Computer science) 606 $aInformation storage and retrieval 606 $aCoding theory 606 $aInformation theory 606 $aPattern Recognition$3https://scigraph.springernature.com/ontologies/product-market-codes/I2203X 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 606 $aNatural Language Processing (NLP)$3https://scigraph.springernature.com/ontologies/product-market-codes/I21040 606 $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032 606 $aCoding and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15041 615 0$aPattern recognition. 615 0$aAlgorithms. 615 0$aDiscrete mathematics. 615 0$aNatural language processing (Computer science). 615 0$aInformation storage and retrieval. 615 0$aCoding theory. 615 0$aInformation theory. 615 14$aPattern Recognition. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics. 615 24$aNatural Language Processing (NLP). 615 24$aInformation Storage and Retrieval. 615 24$aCoding and Information Theory. 676 $a006.4 702 $aApostolico$b Alberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCrochemore$b Maxime$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGalil$b Zvi$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aManber$b Udi$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465491703316 996 $aCombinatorial Pattern Matching$9772744 997 $aUNISA