LEADER 05723nam 22007695 450 001 996466161903316 005 20200702105053.0 010 $a3-540-49412-X 024 7 $a10.1007/3-540-60044-2 035 $a(CKB)1000000000234293 035 $a(SSID)ssj0000321914 035 $a(PQKBManifestationID)11257603 035 $a(PQKBTitleCode)TC0000321914 035 $a(PQKBWorkID)10280996 035 $a(PQKB)10394845 035 $a(DE-He213)978-3-540-49412-6 035 $a(PPN)15516757X 035 $a(EXLCZ)991000000000234293 100 $a20121227d1995 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching$b[electronic resource] $e6th Annual Symposium, CPM 95, Espoo, Finland, July 5 - 7, 1995. Proceedings /$fedited by Zvi Galil, Esko Ukkonen 205 $a1st ed. 1995. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995. 215 $a1 online resource (VIII, 412 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v937 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-60044-2 327 $aComputing similarity between RNA strings -- Of chicken teeth and mouse eyes, or generalized character compatibility -- Efficient string matching on coded texts -- Fast approximate matching using suffix trees -- Common subsequences and supersequences and their expected length -- Pattern matching in directed graphs -- Constant-space string matching with smaller number of comparisons: sequential sampling -- Multi-dimensional pattern matching with dimensional wildcards -- Minimizing phylogenetic number to find good evolutionary trees -- Making the shortest-paths approach to sum-of-pairs multiple sequence alignment more space efficient in practice -- An efficient algorithm for developing topologically valid matchings -- Polynomial-time algorithm for computing translocation distance between genomes -- On the complexity of comparing evolutionary trees -- Suffix cactus: A cross between suffix tree and suffix array -- Pattern-matching for strings with short descriptions -- Pairwise alignment with scoring on tuples -- Matching a set of strings with variable length don't cares -- Three-dimensional pattern matching in protein structure analysis -- Genome analysis: Pattern search in biological macromolecules -- Matching patterns of an automaton -- New results and open problems related to non-standard stringology -- String matching in hypertext -- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree -- A new flexible algorithm for the longest common subsequence problem -- Smaller representations for finite-state transducers and finite-state automata -- Multiple sequence comparison: A peptide matching approach -- On a technique for parsing a string -- Dictionary look-up with small errors -- On the editing distance between undirected acyclic graphs and related problems. 330 $aThis volume presents the proceedings of the 6th International Symposium on Combinatorial Pattern Matching, CPM '95, held in Espoo, Finland in July 1995. CPM addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, extended expressions, etc. The aim is to derive non-trivial combinatorial properties in order to improve the performance of the corresponding computational problems. This volume presents 27 selected refereed full research papers and two invited papers; it addresses all current aspects of CPM and its applications such as the design and analysis of algorithms for pattern matching problems in strings, graphs, and hypertexts, as well as in biological sequences and molecules. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v937 606 $aComputers 606 $aPattern recognition 606 $aAlgorithms 606 $aNatural language processing (Computer science) 606 $aInformation storage and retrieval 606 $aCoding theory 606 $aInformation theory 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 $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 615 0$aComputers. 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 14$aTheory of Computation. 615 24$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. 676 $a004.0151 702 $aGalil$b Zvi$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aUkkonen$b Esko$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466161903316 996 $aCombinatorial Pattern Matching$9772744 997 $aUNISA