M. Crochemore and T. Lecroq. Pattern matching and text compression algorithms. ACM Computing Surveys, 28(1):39--41, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....than the traditional ones. From quantitative point of view, the amount of information that can be stored in a database can be significantly larger. Also, thanks the advanced database compression technology (see, e.g. 1] as well as some very efficient text searching algorithms (see, e.g. [2]) finding a particular word is almost immediate. From functional point of view, the benefits of a technologybased dictionary are even more valuable. Objects and notions can be easily illustrated by pictures, schemes, diagrams, as well as by sound and even by video clips. Natural or synthesized ....

M. Crochemore, T. Lecroq, Pattern matching and text compression algorithms, in CRC Computer Science and Engineering Handbook, A. Tucker (ed.), CRC Press Inc. (1996) Chapter 8, pp. 162--202.

....increasing the length and the number of databases provides algorithms with compression performance that can be made arbitrarily close to being optimal, at the cost of increasing the encoding complexity. We also note that there is a wealth of approximate string matching algorithms (see [8] 1] 2][7] and the references therein) allowing for efficient implementations. The rest of the paper is organized as follows. In the next section we describe the algorithm in detail and present our main theoretical result, Theorem 1, stating its asymptotic optimality. In Section 3 we first give an informal ....

....match of length O(log m) And as in the lossless case, there is also a very extensive literature devoted to efficient algorithms for approximate string matching. Implementation details and algorithmic issues are discussed at length in the text [8] and, in the context of data compression, in [1] 2][7]. Although the above argument indicates that, in terms of encoding complexity, the two algorithms are asymptotically comparable, the upper bound for the number of databases provided by (3) T (m) t(m) 1] j Aj , reveals one the algorithms major practical limitations: That for finite ....

M. Crochemore and T. Lecroq. Pattern-matching and text-compression algorithms. ACM Computing Surveys, 28(1):39--41, 1996.

No context found.

M. Crochemore and T. Lecroq. Pattern matching and text compression algorithms. ACM Computing Surveys, 28(1):39--41, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC