Published October 21, 2026 | Version v1

lzcomplexity

  • 1. EDMO icon Karlsruhe Institute of Technology (South Campus)
  • 2. ROR icon University of Havana
  • 3. ROR icon Max Planck Institute for the Physics of Complex Systems
  • 1. ROR icon University of Havana

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:

  1. A Python library (import lzcomplexity).
  2. Two standalone command-line tools — lzcomplexity and lzdistance.

Common applications: neuroscience time-series, DNA analysis, anomaly detection, structural pattern analysis.

Files

Files (4.9 MB)

Name Size
md5:11a5c2a13c1ffb4c99026a7170552af8
1.4 MB Download
md5:48d472609e3586a2fa3747cb9f31c45b
1.2 MB Download
md5:400c933ed7f7d8ddd2f4b5121406bef5
1.3 MB Download
md5:5c67a257ad858cf24d86f4487b6ce87e
1.0 MB Download

Additional details

Software

Repository URL
https://github.com/pleros-ai/lzcomplexity
Programming language
C++ , Python , Rust