Algorithms for estimating information distance with application to bioinformatics and linguistics

Abstract

We review unnormalized and normalized information distances based on incomputable notions of Kolmogorov complexity and discuss how Kolmogorov complexity can be approximated by data compression algorithms. We argue that optimal algorithms for data compression with side information can be successfully used to approximate the normalized distance. Next, we… (More)

Topics

  • Presentations referencing similar topics