DC3 implementation uses regular sorting instead of radix sort, so it's O(n log n) instead of linear. Found a bug? E-mail me at bgwines@cs.stanford.edu to let me know and I'll get right on it :) Suffix ...
Casey, W., 2012: Modeling Malware with Suffix Trees. Carnegie Mellon University, Software Engineering Institute's Insights (blog), Accessed December 18, 2025, https ...
Who is this useful for? This repo could be useful if you're implementing Ukkonen's algorithm the first time, or perhaps if you're looking for a well-structured basic C# implementation to use as a ...
1 Department of Cell Therapy and Applied Genomics, King Hussein Cancer Center, Amman, Jordan 2 Department of Pathology and Molecular Medicine, McMaster University, Hamilton, ON, Canada Suffix trees ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback