Lempel–Ziv–Stac

Known as: Stac compression, Lempel-Ziv-Stac, STAC 
Lempel–Ziv–Stac (LZS, or Stac compression) is a lossless data compression algorithm that uses a combination of the LZ77 sliding-window compression… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Lyndon factorization and Lempel-Ziv (LZ) factorization are both important tools for analysing the structure and complexity of… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2017
2017
We present new algorithms for the sliding window Lempel-Ziv (LZ77) problem and the approximate rightmost LZ77 parsing problem… (More)
Is this relevant?
2015
2015
We present an algorithm that computes the Lempel-Ziv decomposition in O(n(log σ+log log n)) time and n log σ+ǫn bits of space… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
2014
We present a new on-line algorithm for computing the Lempel-Ziv factorization of a string that runs in O(N logN) time and uses… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
OBJECTIVE In this paper, electroencephalogram (EEG) signals of 20 schizophrenic patients and 20 age-matched control participants… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper is concerned with algorithms for prediction of discrete sequences over a finite alphabet, using variable order Markov… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
MOTIVATION Most existing approaches for phylogenetic inference use multiple alignment of sequences and assume some sort of an… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The complexity of the mobility tracking problem in a cellular environment has been characterized under an information-theoretic… (More)
  • figure 1
  • table 1
  • figure 2
  • table 3
  • figure 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The current explosion of stored information necessitates a new model of pattern matching, that of compressed matching. In this… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Abstruct-The problem of predicting the next outcome of an individual binary sequence using finite memory, is considered. The… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?