Suffix trees and weightless threads in python

A couple of groovy python links:

Suffix trees, and suffix trees in python. “Suffix trees are a data structure that makes it convenient to do string matching against an entire data set in O(N) time. This is really wonderful, but creating the suffix tree isn’t always that easy.”

Also, implementing “weightless threads” with Python generators. Nice.