LEADER 05518nam 22007935 450 001 996466082003316 005 20200707015059.0 010 $a3-540-47732-2 024 7 $a10.1007/BFb0029791 035 $a(CKB)1000000000233970 035 $a(SSID)ssj0000321918 035 $a(PQKBManifestationID)11250734 035 $a(PQKBTitleCode)TC0000321918 035 $a(PQKBWorkID)10281305 035 $a(PQKB)10324821 035 $a(DE-He213)978-3-540-47732-7 035 $a(PPN)15517276X 035 $a(EXLCZ)991000000000233970 100 $a20121227d1993 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching$b[electronic resource] $e4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings /$fedited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber 205 $a1st ed. 1993. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1993. 215 $a1 online resource (X, 270 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v684 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-56764-X 327 $aA 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. 330 $aThe 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v684 606 $aPattern recognition 606 $aAlgorithms 606 $aNatural language processing (Computer science) 606 $aInformation storage and retrieval 606 $aCoding theory 606 $aInformation theory 606 $aCombinatorics 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 $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 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aPattern recognition. 615 0$aAlgorithms. 615 0$aNatural language processing (Computer science). 615 0$aInformation storage and retrieval. 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aCombinatorics. 615 14$aPattern Recognition. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aNatural Language Processing (NLP). 615 24$aInformation Storage and Retrieval. 615 24$aCoding and Information Theory. 615 24$aCombinatorics. 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 $a996466082003316 996 $aCombinatorial Pattern Matching$9772744 997 $aUNISA