Titlebook: Combinatorial Pattern Matching; 8th Annual Symposium Alberto Apostolico,Jotun Hein Conference proceedings 1997 Springer-Verlag Berlin Heide

獨(dú)特性

MAL

Combinatorial Pattern Matching978-3-540-69214-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

毀壞

Smart Electromechanical Systemsthan for conventional Huffman trees, .(log..) for trees of depth .(log .), and decoding is faster, because a part of the bit-comparisons necessary for the decoding may be saved. Empirical results on large real-life distributions show a reduction of up to 50% and more in the number of bit operations.

facetious

Andrey E. Gorodetskiy,Irina L. Tarasova. of a pattern and subwords of a text whose lengths exceed a certain threshold. Moreover, arbitrary gap and substitution weights are allowed. In this paper, two new prefilter algorithms for the weighted local similarity search problem are presented. These overcome the disadvantages of a similar filter algorithm devised by Myers.