000 04324nam a22006375i 4500
001 978-3-540-69214-0
003 DE-He213
005 20240423132434.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540692140
_9978-3-540-69214-0
024 7 _a10.1007/3-540-63220-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aCombinatorial Pattern Matching
_h[electronic resource] :
_b8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings /
_cedited by Alberto Apostolico, Jotun Hein.
250 _a1st ed. 1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1997.
300 _aVIII, 284 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1264
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aPattern recognition systems.
650 0 _aAlgorithms.
650 0 _aInformation storage and retrieval systems.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 1 4 _aTheory of Computation.
650 2 4 _aAutomated Pattern Recognition.
650 2 4 _aAlgorithms.
650 2 4 _aInformation Storage and Retrieval.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aDiscrete Mathematics.
700 1 _aApostolico, Alberto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aHein, Jotun.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540632207
776 0 8 _iPrinted edition:
_z9783662186244
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1264
856 4 0 _uhttps://doi.org/10.1007/3-540-63220-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187749
_d187749