| # Code taken from http://www.node99.org/tutorials/ar/ and adjusted for Python 3 + filled in the missing pieces: | |
| # | |
| # + Python 2 tuple args -> Python 3 does not allow passing tuples; unpack with *args instead | |
| # + numpy.hstack -> numpy.vstack | |
| # + preprocess -> numpy.histogram + numpy.digitize | |
| # + mutual_information -> sklearn.metrics.normalized_mutual_information_score | |
| # + separate between the "discretized signal" and the original continuous dynamics | |
| import numpy as np | |
| import matplotlib.pyplot as plt |
| #!/usr/bin/env python | |
| # -*- coding: utf-8 | |
| """ | |
| Search longest common substrings using generalized suffix trees built with Ukkonen's algorithm | |
| Author: Ilya Stepanov <code at ilyastepanov.com> | |
| (c) 2013 | |
| """ |
This gist assumes: