- enter 2 strings;
- press "Identical" button to find identical parts of 2 strings;
- more information about how it works could be found here - Suffix Trees: Longest Common Substring and Diff Implementation.
See also: my other Suffix Trees posts
Posts
City of New York is now a Browserling customer!
-
Success! The City of New York is now a Browserling customer!
It's another small step for a ling but one giant leap for ling kind.
What Is Browserling?
B...
15 hours ago
2 comments:
Illya, your work with suffix trees is being very helpful for me, since my final year project in college is about Ukkonen's algorithm.
I also have coded a Java version of Mark Nelson's implementation (before I found yours), but, although I have understood the algorithm, I'm having a hard time trying to understand why it's O(n).
Ukkonen's original paper is kinda confusing at some points. At page 15, I understand when he says that, excluding the canonize function, each phase takes time proportional to the number of visited states, but when he starting relating this to the depth of consecutive active points, I get lost.
Can you help me with this, maybe linking me to some better explanation?
Thanks again!
I tried the applet with the two following strings:
AA
AxAx
Only one A is highlighted.
In my understanding, the two A should be highlighted, no ?
Post a Comment