LEADER 05043nam  22007455  450 
001 996465756903316
005 20200705172923.0
010   $a3-540-69214-2
024 7 $a10.1007/3-540-63220-4
035   $a(CKB)1000000000234668
035   $a(SSID)ssj0000321921
035   $a(PQKBManifestationID)11255109
035   $a(PQKBTitleCode)TC0000321921
035   $a(PQKBWorkID)10281860
035   $a(PQKB)11116121
035   $a(DE-He213)978-3-540-69214-0
035   $a(PPN)155233343
035   $a(EXLCZ)991000000000234668
100   $a20121227d1997      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aCombinatorial Pattern Matching$b[electronic resource] $e8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings /$fedited by Alberto Apostolico, Jotun Hein
205   $a1st ed. 1997.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997.
215   $a1 online resource (VIII, 284 p.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1264
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-63220-4 
327   $aAn improved pattern matching algorithm for strings in terms of straight-line programs -- Episode matching -- Efficient algorithms for approximate string matching with swaps -- On the complexity of pattern matching for highly compressed two-dimensional texts -- Estimating the probability of approximate matches -- Space- and time-efficient decoding with canonical huffman trees -- On weak circular squares in binary words -- An easy case of sorting by reversals -- External inverse pattern matching -- Distributed generation of suffix arrays -- Direct construction of compact directed acyclic word graphs -- Approximation algorithms for the fixed-topology phylogenetic number problem -- A new algorithm for the ordered tree inclusion problem -- On incremental computation of transitive closure and greedy alignment -- Aligning coding DNA in the presence of frame-shift errors -- A filter method for the weighted local similarity search problem -- Trie-based data structures for sequence assembly -- Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices -- Banishing bias from consensus sequences -- On the Nadeau-Taylor theory of conserved chromosome segments -- Iterative versus simultaneous multiple sequence alignment -- Modern comparative lexicostatistics.
330   $aThis book constitutes the refereed proceedings of the Eighth Annual Symposium on Combinatorial Pattern Matching, CPM 97, held in Aarhus, Denmark, in June/July 1997. The volume presents 20 revised full papers carefully selected from 32 submissions received; also included are abstracts of two invited contributions. The volume is devoted to the issue of searching and matching strings and more complicated patterns, such as trees, regular expressions, graphs, point sets and arrays. The results presented are particularly relevant to molecular biology, but also to information retrieval, pattern recognition, compiling, data compression and program analysis.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v1264
606   $aComputers
606   $aPattern recognition
606   $aAlgorithms
606   $aInformation storage and retrieval
606   $aComputer science?Mathematics
606   $aCombinatorics
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   $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032
606   $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
615  0$aComputers.
615  0$aPattern recognition.
615  0$aAlgorithms.
615  0$aInformation storage and retrieval.
615  0$aComputer science?Mathematics.
615  0$aCombinatorics.
615 14$aTheory of Computation.
615 24$aPattern Recognition.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aInformation Storage and Retrieval.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aCombinatorics.
676   $a004.0151
702   $aApostolico$b Alberto$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aHein$b Jotun$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465756903316
996   $aCombinatorial Pattern Matching$9772744
997   $aUNISA