We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 63e8b64 commit bb3b757Copy full SHA for bb3b757
README.md
@@ -2,7 +2,7 @@ Suffix Trees in Python
2
================================
3
4
Based off of Mark Nelson's C++ implementation of Ukkonen's algorithm. Ukkonen's
5
-algorithm gives a O(n) + O(k) contruction time for a suffix tree, where n is
+algorithm gives a O(n) + O(k) construction time for a suffix tree, where n is
6
the length of the string and k is the size of the alphabet of that string.
7
Ukkonen's is an online algorithm, processing the input sequentially and producing
8
a valid suffix tree at each character.
0 commit comments