# 0.4 Universal compression for context tree sources  (Page 3/3)

 Page 3 / 3

As a consequence of the structure of y, it is easy to see that it can be compressed with the following redundancy,

$r\lesssim \frac{|T|\left(r-1\right)}{2}\left(log,\left(,\frac{n}{|T|},+,O,\left(1\right),\right)\right)+|T|log\left(n\right),$

where the new $|T|log\left(n\right)$ term arises from coding the locations of transitions between segments (states of the tree) in the BWT output. Not only is the BWT convenient for compression, but it is amenable to fast computation. Both the BWT and its inverse can be implemented in $O\left(n\right)$ time. This combination of great compression and speed has made the BWT quite popular in compressors that have appeared since the late 1990s. For example, the bzip2 archiving package is very popular among network administrators.

That said, from a theoretical perspective the BWT suffers from an extraneous redundancy of $|T|log\left(n\right)$ bits. Until this gap was resolved, the theoretical community still preferred the semi-predictive method or another approach based on mixtures.

## Semi-predictive coding using the bwt

Another approach for using the BWT is to use $y$ only for learning the MDL tree source ${T}^{*}$ . To do so, note that when the BWT is run, it is possible to track the correspondences between contexts and segments of the BWT output. Therefore, information about per-segment symbol count is available, and can be easily applied to perform the tree pruning procedure that we have seen. Not only that, but some BWT computation algorithms (e.g., suffix tree approaches) maintain this information for all context depths and not just bounded $D$ . In short, the BWT allows to compute the minimizing tree ${T}^{*}$ in linear time  [link] .

Given the minimizing tree ${T}^{*}$ , it is not obvious how to determine which state generated each character of $y$ (respectively, $x$ ) in linear time. It has been shown by Martín et al.  [link] that this step can also be performed in linear time by developing a state machine whose states include the leaves of ${T}^{*}$ . The result is a two part code, where the first part computes the optimal ${T}^{*}$ via BWT, and the second part actually compresses $x$ by tracking which state of ${T}^{*}$ generated each of the symbols. To summarize, we have a linear complexity algorithm for compressing and decompressing a source while achieving the redundancy bounds for the class of tree sources.

## Context tree weighting

We discussed in [link] for the problem of encoding a transition between two known i.i.d. distributions that

$\frac{1}{n}\sum _{i=1}^{n}{p}_{{\theta }_{i}}\left(x\right)>\frac{1}{n}\underset{i}{max}\left\{{p}_{{\theta }_{i}}\left(x\right)\right\}.$

Therefore, a mixture over all parameter values yields a greater probability (and thus lower coding length) than the maximizing approach. Keep in mind that finding the optimal MDL tree source ${T}^{*}$ is analogous to the plug-in approach, and it would reduce the coding length if we could assign the probability as a mixture over all possible trees, where we assign trees with fewer leaves a greater weight. That is, ideally we want to implement

$Pr\left(x\right)=\sum _{T}{2}^{-|\text{code}\left(T\right)|}·{p}_{T}\left(x\right),$

where $|\text{code}\left(T\right)|$ is the length of the encoding procedure that we discussed for the tree structure $T$ , and ${p}_{T}\left(x\right)$ is the probability for the sequence $x$ under the model $T$ .

Willems et al. showed how to implement such a mixture in a simple way over the class of tree sources of bounded depth $D$ . As before, the algorithm proceeds in a bottom up manner from leaves toward the root. At leaves, the probability ${p}_{s}$ assigned to symbols that were generated within that context $s$ is the Krichevsky-Trofimov probability, ${p}_{KT}\left(s,x\right)$   [link] . For $s$ that is an internal node whose depth is less than $D$ , the approach by Willems et al.  [link] is to mix ( i ) the probabilities of keeping the branches for 0s and 1s and ( ii ) pruning,

${p}_{s}=\frac{1}{2}{p}_{K}T\left(s,x\right)+\frac{1}{2}{p}_{0s}·{p}_{1s}.$

It can be shown that this simple formula allows to implement a mixture over the class of bounded depth context tree sources, thus reducing the coding length w.r.t. the semi-predictive approach.

In fact, Willems later showed how to extend the context tree weighting (CTW) approach to tree sources of unbounded depth  [link] . Unfortunately, while the basic bounded depth CTW has complexity that is comparable to the BWT, the unboundedCTW has potentially higher complexity.

how can chip be made from sand
is this allso about nanoscale material
Almas
are nano particles real
yeah
Joseph
Hello, if I study Physics teacher in bachelor, can I study Nanotechnology in master?
no can't
Lohitha
where is the latest information on a no technology how can I find it
William
currently
William
where we get a research paper on Nano chemistry....?
nanopartical of organic/inorganic / physical chemistry , pdf / thesis / review
Ali
what are the products of Nano chemistry?
There are lots of products of nano chemistry... Like nano coatings.....carbon fiber.. And lots of others..
learn
Even nanotechnology is pretty much all about chemistry... Its the chemistry on quantum or atomic level
learn
da
no nanotechnology is also a part of physics and maths it requires angle formulas and some pressure regarding concepts
Bhagvanji
hey
Giriraj
Preparation and Applications of Nanomaterial for Drug Delivery
revolt
da
Application of nanotechnology in medicine
has a lot of application modern world
Kamaluddeen
yes
narayan
what is variations in raman spectra for nanomaterials
ya I also want to know the raman spectra
Bhagvanji
I only see partial conversation and what's the question here!
what about nanotechnology for water purification
please someone correct me if I'm wrong but I think one can use nanoparticles, specially silver nanoparticles for water treatment.
Damian
yes that's correct
Professor
I think
Professor
Nasa has use it in the 60's, copper as water purification in the moon travel.
Alexandre
nanocopper obvius
Alexandre
what is the stm
is there industrial application of fullrenes. What is the method to prepare fullrene on large scale.?
Rafiq
industrial application...? mmm I think on the medical side as drug carrier, but you should go deeper on your research, I may be wrong
Damian
How we are making nano material?
what is a peer
What is meant by 'nano scale'?
What is STMs full form?
LITNING
scanning tunneling microscope
Sahil
how nano science is used for hydrophobicity
Santosh
Do u think that Graphene and Fullrene fiber can be used to make Air Plane body structure the lightest and strongest. Rafiq
Rafiq
what is differents between GO and RGO?
Mahi
what is simplest way to understand the applications of nano robots used to detect the cancer affected cell of human body.? How this robot is carried to required site of body cell.? what will be the carrier material and how can be detected that correct delivery of drug is done Rafiq
Rafiq
if virus is killing to make ARTIFICIAL DNA OF GRAPHENE FOR KILLED THE VIRUS .THIS IS OUR ASSUMPTION
Anam
analytical skills graphene is prepared to kill any type viruses .
Anam
Any one who tell me about Preparation and application of Nanomaterial for drug Delivery
Hafiz
what is Nano technology ?
write examples of Nano molecule?
Bob
The nanotechnology is as new science, to scale nanometric
brayan
nanotechnology is the study, desing, synthesis, manipulation and application of materials and functional systems through control of matter at nanoscale
Damian
Got questions? Join the online conversation and get instant answers!