Talk:Longest common substring: Difference between revisions
m
Thundergnat moved page Talk:Longest Common Substring to Talk:Longest common substring: Follow normal task title capitalization policy
(→Generalized Suffix Trees: Reply.) |
Thundergnat (talk | contribs) m (Thundergnat moved page Talk:Longest Common Substring to Talk:Longest common substring: Follow normal task title capitalization policy) |
||
| (One intermediate revision by one other user not shown) | |||
Line 15:
I have added a reference to generalized suffix trees which is a O(n) time method for solving this for n strings.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:31, 19 February 2015 (UTC)
:Yes, generalised suffix trees would certainly provide a more efficient algorithm for solving this problem. But from what I've seen, they also take longer to code than the time I happen to have available. Still, it'd be cool to see one implemented if anyone did have the time. --[[User:Geoffhacker|Geoffhacker]] ([[User talk:Geoffhacker|talk]]) 19:43, 24 February 2015 (UTC)
:I see that you have created the first necessary subtask in that algorithm, building a suffix tree. Good idea, leverage the crowd! --[[User:Geoffhacker|Geoffhacker]] ([[User talk:Geoffhacker|talk]]) 19:53, 24 February 2015 (UTC)
| |||