lzcomplexity
Authors/Creators
Description
lzcomplexity is a high-performance C++ library developed for complexity analysis using entropic metrics such as entropy density, effective measure complexity, and informational distance. The algorithms used to estimate the metrics employing Lempel-Ziv factorization [Lempel, A., & Ziv, J. (1976). "On the complexity of finite sequences"]. The LZ76 complexity c(S) is the minimum number of factors needed to represent a sequence, where each factor is either a new symbol or the longest previously-seen substring. From c(S) you get a non-parametric entropy-rate estimator — h ≈ c(S)·log_k(n)/n — that converges to the true entropy rate of ergodic sources [Kontoyiannis, I., et. al. (1998). "Nonparametric entropy estimation for stationary processes and random fields"].
The library ships two things:
- A Python library (
import lzcomplexity). - Two standalone command-line tools —
lzcomplexityandlzdistance.
Common applications: neuroscience time-series, DNA analysis, anomaly detection, structural pattern analysis.
Files
Additional details
Software
- Repository URL
- https://github.com/pleros-ai/lzcomplexity
- Programming language
- C++ , Python , Rust