000 | 04474nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-48450-9 | ||
003 | DE-He213 | ||
005 | 20160624102034.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1994 gw | s |||| 0|eng d | ||
020 |
_a9783540484509 _9978-3-540-48450-9 |
||
024 | 7 |
_a10.1007/3-540-58094-8 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aCombinatorial Pattern Matching _h[electronic resource] : _b5th Annual Symposium, CPM 94 Asilomar, CA, USA, June 5–8, 1994 Proceedings / _cedited by Maxime Crochemore, Dan Gusfield. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1994. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1994. |
|
300 |
_aIX, 331 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, _x0302-9743 ; _v807 |
|
505 | 0 | _aA space efficient algorithm for finding the best non-overlapping alignment score -- The parameterized complexity of sequence alignment and consensus -- Computing all suboptimal alignments in linear space -- Approximation algorithms for multiple sequence alignment -- A context dependent method for comparing sequences -- Fast identification of approximately matching substrings -- Alignment of trees — An alternative to tree edit -- Parametric recomputing in alignment graphs -- A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms -- A text compression scheme that allows fast searching directly in the compressed file -- An alphabet-independent optimal parallel search for three dimensional pattern -- Unit route upper bound for string-matching on hypercube -- Computation of squares in a string -- Minimization of sequential transducers -- Shortest common superstrings for strings of random letters -- Maximal common subsequences and minimal common supersequences -- Dictionary-matching on unbounded alphabets: Uniform length dictionaries -- Proximity matching using fixed-queries trees -- Query primitives for tree-structured data -- Multiple matching of parameterized patterns -- Approximate string matching with don't care characters -- Matching with matrix norm minimization -- Approximate string matching and local similarity -- Polynomial-time algorithms for computing characteristic strings -- Recent methods for RNA modeling using stochastic context-free grammars -- Efficient bounds for oriented chromosome inversion distance. | |
520 | _aThis volume presents the proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, held at Asilomar, California, in June 1994. The 26 selected papers in this volume are organized in chapters on Alignments, Various Matchings, Combinatorial Aspects, and Bio-Informatics. Combinatorial Pattern Matching addresses issues of searching and matching of strings and more complicated patterns, as for example trees. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performance for the corresponding computational problems. In recent years, combinatorial pattern matching has developed into a full-fledged area of algorithmics and is expected to grow even further during the next years. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aCoding theory. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aInformation storage and retrieval systems. | |
650 | 0 | _aOptical pattern recognition. | |
650 | 0 |
_aBiology _xData processing. |
|
650 | 0 | _aCombinatorics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aPattern Recognition. |
650 | 2 | 4 | _aInformation Storage and Retrieval. |
650 | 2 | 4 | _aCoding and Information Theory. |
650 | 2 | 4 | _aCombinatorics. |
650 | 2 | 4 | _aComputer Appl. in Life Sciences. |
700 | 1 |
_aCrochemore, Maxime. _eeditor. |
|
700 | 1 |
_aGusfield, Dan. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540580942 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v807 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-58094-8 |
942 |
_2EBK6478 _cEBK |
||
999 |
_c35772 _d35772 |