Lempel–Ziv complexity, also known as Lempel-Ziv (LZ) complexity, is a measure of the complexity of a string (or sequence) based on the concepts introduced by the Lempel-Ziv compression algorithms. It serves as an indication of the amount of information or the structure present in a sequence. The Lempel-Ziv complexity of a string is defined using the notion of "factors," which are contiguous substrings that the original string can be broken down into.
Articles by others on the same topic
There are currently no matching articles.