###C# Forms implementation.
- Based on code.google.com/archive/p/csharsuffixtree.
- Implements Ukkonen's linear time algorithm."
- Extends the original implementation by accepting stings of an arbitrary type using templates.
- Populate the tree view.
- Implement generalized construction.
- Implement Burrows Wheeler Transform.
- Implement Suffix Array
- I am looking for patterns and anomalies within program execution heap traces and snap shots.