000 | 03612nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-540-69054-2 | ||
003 | DE-He213 | ||
005 | 20240423132559.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1998 gw | s |||| 0|eng d | ||
020 |
_a9783540690542 _9978-3-540-69054-2 |
||
024 | 7 |
_a10.1007/BFb0030776 _2doi |
|
050 | 4 | _aQ337.5 | |
050 | 4 | _aTK7882.P3 | |
072 | 7 |
_aUYQP _2bicssc |
|
072 | 7 |
_aCOM016000 _2bisacsh |
|
072 | 7 |
_aUYQP _2thema |
|
082 | 0 | 4 |
_a006.4 _223 |
245 | 1 | 0 |
_aCombinatorial Pattern Matching _h[electronic resource] : _b9th Annual Symposium, CPM'98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings / _cedited by Martin Farach-Colton. |
250 | _a1st ed. 1998. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1998. |
|
300 |
_aIX, 259 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 ; _v1448 |
|
505 | 0 | _aA fast bit-vector algorithm for approximate string matching based on dynamic programming -- A bit-parallel approach to suffix automata: Fast extended string matching -- A dictionary matching algorithm fast on the average for terms of varying length -- A very fast string matching algorithm for small alphabets and long patterns -- Approximate word sequence matching over Sparse Suffix Trees -- Efficient parallel algorithm for the editing distance between ordered trees -- Reporting exact and approximate regular expression matches -- An approximate oracle for distance in metric spaces -- A rotation invariant filter for two-dimensional string matching -- Constructing suffix arrays for multi-dimensional matrices -- Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version -- Comparison of coding DNA -- Fixed topology alignment with recombination -- Aligning alignments -- Efficient special cases of pattern matching with swaps -- Aligning DNA sequences to minimize the change in protein -- Genome halving. | |
520 | _aThis book constitutes the refereed proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, CPM 98, held in Piscataway, NJ, USA, in July 1998. The 17 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers address all current issues in combinatorial pattern matching dealing with a variety of classical objects to be matched as well as with DNA coding. | ||
650 | 0 | _aPattern recognition systems. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aComputer science. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 1 | 4 | _aAutomated Pattern Recognition. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aDiscrete Mathematics. |
700 | 1 |
_aFarach-Colton, Martin. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540647393 |
776 | 0 | 8 |
_iPrinted edition: _z9783662189894 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1448 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0030776 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c189346 _d189346 |