LEADER 05565nam 22007575 450 001 996465597403316 005 20200702135434.0 010 $a3-540-68390-9 024 7 $a10.1007/3-540-61258-0 035 $a(CKB)1000000000234453 035 $a(SSID)ssj0000321913 035 $a(PQKBManifestationID)11227101 035 $a(PQKBTitleCode)TC0000321913 035 $a(PQKBWorkID)10282213 035 $a(PQKB)10578913 035 $a(DE-He213)978-3-540-68390-2 035 $a(PPN)155173278 035 $a(EXLCZ)991000000000234453 100 $a20121227d1996 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching$b[electronic resource] $e7th Annual Symposium, CPM '96, Laguna Beach, California, June 10-12, 1996. Proceedings /$fedited by Dan Hirschberg, Gene Meyers 205 $a1st ed. 1996. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996. 215 $a1 online resource (VIII, 400 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1075 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-61258-0 327 $aA faster algorithm for approximate string matching -- Boyer-Moore strategy to efficient approximate string matching -- Randomized efficient algorithms for compressed strings: the finger-print approach -- Filtration with q-samples in approximate string matching -- Computing discoveries in molecular biology -- Approximate dictionary queries -- Approximate multiple string search -- A 2 2/3-approximation algorithm for the shortest superstring problem -- Suffix trees on words -- The suffix tree of a tree and minimizing sequential transducers -- Perfect hashing for strings: Formalization and algorithms -- Spliced alignment: A new approach to gene recognition -- Original Synteny -- Fast sorting by reversal -- A double combinatorial approach to discovering patterns in biological sequences -- Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization -- Improved approximation algorithms for tree alignment -- The asymmetric median tree ? A new model for building consensus trees -- Constructing computer virus phylogenies -- Docking of conformationally flexible proteins -- Invariant patterns in crystal lattices: Implications for protein folding algorithms (extended abstract) -- Graph traversals, genes, and matroids: An efficient case of the travelling salesman problem -- Alphabet independent and dictionary scaled matching -- Analysis of two-dimensional approximate pattern matching algorithms -- Approximation algorithms for maximum two-dimensional pattern matching -- Efficient parallel algorithms for tree editing problems -- Approximate pattern matching in directed graphs -- Finite-state computability of annotations of strings and trees (extended abstract). 330 $aThis book constitutes the refereed proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, CPM '96, held in Laguna Beach, California, USA, in June 1996. The 26 revised full papers included were selected from a total of 48 submissions; also included are two invited papers. Combinatorial pattern matching has become a full-fledged area of algorithmics with important applications in recent years. The book addresses all relevant aspects of combinatorial pattern matching and its importance in information retrieval, pattern recognition, compiling, data compression, program analysis, and molecular biology and thus describes the state of the art in the area. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1075 606 $aComputers 606 $aPattern recognition 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aNatural language processing (Computer science) 606 $aInformation storage and retrieval 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aPattern Recognition$3https://scigraph.springernature.com/ontologies/product-market-codes/I2203X 606 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 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 615 0$aComputers. 615 0$aPattern recognition. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aNatural language processing (Computer science). 615 0$aInformation storage and retrieval. 615 14$aTheory of Computation. 615 24$aPattern Recognition. 615 24$aDiscrete Mathematics. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aNatural Language Processing (NLP). 615 24$aInformation Storage and Retrieval. 676 $a006.4/01/5116 702 $aHirschberg$b Dan$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMeyers$b Gene$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSymposium on Combinatorial Pattern Matching 906 $aBOOK 912 $a996465597403316 996 $aCombinatorial Pattern Matching$9772744 997 $aUNISA