Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171)

13-13 June 1997

Filter Results

Displaying Results 1 - 25 of 36
  • Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171)

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (170 KB)
    Freely Available from IEEE
  • Hashing on strings, cryptography, and protection of privacy

    Publication Year: 1997
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    Summary form only given. The issues of privacy and reliability of personal data are of paramount importance. If L is a list of people carrying some harmful defective gene, we want questions as to whether a person is in L to be reliably answered without compromising the data concerning anybody else. Reliability means that once the list is formed, nobody can play with the answer. Thus the answer sho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the role of data compression in new products

    Publication Year: 1997
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (59 KB)

    Summary form only given. Discusses the role of data compression in storage subsystems (including caches and controllers) and operating systems (code compression). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel decoder for LZ2 compression using the ID update heuristic

    Publication Year: 1997, Page(s):368 - 373
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    The LZ2 compression method seems hardly parallelizable since some related heuristics are known to be P-complete. In spite of such negative result, the decoding process can be parallelized efficiently for the next character heuristic. We show an other parallel decoding algorithm for LZ2 compression using the ID update heuristic. The algorithm works in O(log/sup 2/n) time with O(n/log(n)) processors... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Index of authors

    Publication Year: 1997, Page(s): 399
    Request permission for commercial reuse | PDF file iconPDF (52 KB)
    Freely Available from IEEE
  • Multi-string search in BSP

    Publication Year: 1997, Page(s):240 - 252
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    We have studied the worst-case complexity of the multi-string search problem in the bulk synchronous parallel (BSP) model (Valiant 1990). For this purpose, we have devised a very simple way to distribute the blind trie data structure among the p processors so that the communication cost is balanced. In the light of the very efficient algorithms and data structures known for external memory and the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constant-space string-matching in sublinear average time

    Publication Year: 1997, Page(s):230 - 239
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    Given two strings: pattern P of length m and text T of length n. The string-matching problem is to find all occurrences of the pattern P in the text T. We present a simple string-matching algorithm which works in average o(n) time with constant additional space for one-dimensional texts and two-dimensional arrays. This is the first attempt to the small-space string-matching problem in which sublin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Kolmogorov random graphs

    Publication Year: 1997, Page(s):78 - 96
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB)

    We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance of the number of (possibly overlapping) ordered labeled subgraphs of a labeled graph as a function of its randomness deficiency and (ii) a new elementary proof... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Code and parse trees for lossless source encoding

    Publication Year: 1997, Page(s):145 - 171
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1844 KB)

    This paper surveys the theoretical literature on fixed-to-variable-length lossless source code trees, called code trees, and on variable-length-to-fixed lossless source code trees, called parse trees. In particular, the following code tree topics are outlined in this survey: characteristics of the Huffman (1952) code tree; Huffman-type coding for infinite source alphabets and universal coding; the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Thresholding wavelets for image compression

    Publication Year: 1997, Page(s):374 - 389
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    The paper addresses the problem of thresholding wavelet coefficients in a transform-based algorithm for still image compression. Processing data before the quantization phase is a crucial step in a compression algorithm, especially in applications which require high compression ratios. In the paper, after a review on the applications of wavelets to image compression, a new solution to the problem ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Annotated statistical indices for sequence analysis

    Publication Year: 1997, Page(s):215 - 229
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    A statistical index for string x is a digital-search tree or trie that returns, for any query string ω and in a number of comparisons bounded by the length of ω, the number of occurrences of ω in x. Clever algorithms are available that support the construction and weighting of such indices in time and space linear in the length of x. This paper addresses the problem of annotating... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interleaving entropy codes

    Publication Year: 1997, Page(s):45 - 55
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    The paper addresses several issues involved in interleaving compressed output from multiple non-prefix codes or from a combination of prefix and non-prefix codes. The technique used throughout is decoder-synchronized encoding, in which the encoder manipulates the data stream to allow just-in-time decoding. We provide three extensions to block Melcode (a coder based on interleaved run-length codes)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Near-lossless image compression schemes based on weighted finite automata encoding and adaptive context modelling

    Publication Year: 1997, Page(s):66 - 77
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    We study high-fidelity image compression with a given tight bound on the maximum error magnitude. We propose a weighted finite automata (WFA) recursive encoding scheme on the adaptive context modelling based quantizing prediction residue images. By incorporating the proposed recursive WFA encoding techniques into the context modelling based nearly-lossless CALIC (context based adaptive lossless im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A progressive Ziv-Lempel algorithm for image compression

    Publication Year: 1997, Page(s):136 - 144
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    We describe an algorithm that gives a progression of compressed versions of a single image. Each stage of the progression is a lossy compression of the image, with the distortion decreasing in each stage, until the last image is losslessly compressed. Progressive encodings are useful in applications such as Web browsing and multicast, where the best rate/distortion tradeoff often is not known in a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A criterion for model selection using minimum description length

    Publication Year: 1997, Page(s):204 - 214
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    Rissanen (1978) proposed the idea that the goodness of fit of a parametric model of the probability density of a random variable could be thought of as an information coding problem. He argued that the best model was that which was able to describe the training data together with the model parameters using the fewest number of bits of information (Occam's razor). This paper builds upon that basic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized secret sharing and group-key distribution using short keys

    Publication Year: 1997, Page(s):30 - 44
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    We relate two basic primitives: generalized secret sharing and group-key distribution. We suggest cryptographic implementations for both and show that they are provably secure according to exact definitions and assumptions given in the present paper. Both solutions require small secret space (namely, short keys). We first consider secret sharing with arbitrary access structures which is a basic pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matching for run-length encoded strings

    Publication Year: 1997, Page(s):348 - 356
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    Measuring the similarity between two strings, through such standard measures as Hamming distance, edit distance, and longest common subsequence, is one of the fundamental problems in pattern matching. We consider the problem of finding the longest common subsequence of two strings. A well-known dynamic programming algorithm computes the longest common subsequence of strings X and Y in O(|X|·... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Text compression using recency rank with context and relation to context sorting, block sorting and PPM*

    Publication Year: 1997, Page(s):305 - 319
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    A block sorting compression scheme was developed and its relation to a statistical scheme was studied, but a theoretical analysis of its performance has not been studied fully. Context sorting is a compression scheme based on context similarity and it is regarded as an on-line version of block sorting and it is asymptotically optimal. However, the compression speed is slower and the real performan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the approximate pattern occurrences in a text

    Publication Year: 1997, Page(s):253 - 264
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    Consider a given pattern H and a random text T generated randomly according to the Bernoulli model. We study the frequency of approximate occurrences of the pattern H in a random text when overlapping copies of the approximate pattern are counted separately. We provide exact and asymptotic formulae for mean, variance and probability of occurrence as well as asymptotic results including the central... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A probabilistic approach to some asymptotics in source coding

    Publication Year: 1997, Page(s):97 - 106
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Renewal theory is a powerful tool in the analysis of source codes. In this paper, we use renewal theory to obtain some asymptotic properties of finite-state noiseless channels. We discuss the relationship between these results and earlier uses of renewal theory to analyze the Lempel-Ziv codes and the Tunstall code. As a new application of our results, we provide a simple derivation of the asymptot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vector quantization and density estimation

    Publication Year: 1997, Page(s):172 - 193
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1268 KB)

    The connection between compression and the estimation of probability distributions has long been known for the case of discrete alphabet sources and lossless coding. A universal lossless code which does a good job of compressing must implicitly also do a good job of modeling. In particular, with a collection of codebooks, one for each possible class or model, if codewords are chosen from among the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical implementation of the lossless compression algorithm

    Publication Year: 1997, Page(s):390 - 397
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    A combination of the LZ78 method with a new scheme of model contexting is introduced. In the proposed scheme the hashing function is also used. This approach speeds up the searching process and has an improvement over model contexting View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multialphabet coding with separate alphabet description

    Publication Year: 1997, Page(s):56 - 65
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    For lossless universal source coding of memoryless sequences with an a priori unknown alphabet size (multialphabet coding), the alphabet of the sequence must be described as well as the sequence itself. Usually an efficient description of the alphabet can be made only by taking into account some additional information. We show that these descriptions can be separated in such a way that the encodin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A universal upper bound on the performance of the Lempel-Ziv algorithm on maliciously-constructed data

    Publication Year: 1997, Page(s):123 - 135
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    We consider the performance of the Lempel-Ziv (1978) algorithm on finite strings and infinite sequences having unbalanced statistics. We show that such strings and sequences are compressed by the Lempel-Ziv algorithm. We show that the converse does not hold, i.e., that there are sequences with perfectly balanced asymptotic statistics that the Lempel-Ziv algorithm compresses optimally View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group testing problems with sequences in experimental molecular biology

    Publication Year: 1997, Page(s):357 - 367
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    Group testing is a basic paradigm for experimental design. In computational biology, group testing problems come up in designing experiments with sequences for mapping, screening libraries, etc. While a great deal of classical research has been done on group testing over the last fifty years, the current biological applications bring up many new issues in group testing which had not been previousl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.