SEQUITUR algorithm

From Wikipedia, the free encyclopedia

You have new messages (last change).

Sequitur is an algorithm that uses a grammar formed from a sequence of discrete symbols to represent a problem. This algorithm can be used in data compression software applications.

[edit] External links

This article is uncategorized.
Please help improve this article by adding it to one or more categories, in addition to a stub category. (how?) Please remove this tag after categorizing. This article has been tagged since November 2006.


 This software-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../s/e/q/SEQUITUR_algorithm_9fbe.html"
In other languages