Anonymous user
Talk:Longest common substring: Difference between revisions
→Duplicate?: Thanks. Looks good.
(→Duplicate?: don't think so) |
(→Duplicate?: Thanks. Looks good.) |
||
Line 7:
:All I know is, Longest Common Subsequence didn't solve my problem, but Longest Common Substring does. That's enough reason for me for it to co-exist. --[[User:Geoffhacker|Geoffhacker]] ([[User talk:Geoffhacker|talk]]) 21:17, 18 February 2015 (UTC)
:I originally thought this was a dup, and changed my mind. Seems quite different to me, and of much more interest to bioinformaticians than the other algorithm. --[[User:TimToady|TimToady]] ([[User talk:TimToady|talk]]) 06:16, 19 February 2015 (UTC)
Thanks for pointing out the difference Geoffhacker. Keep those new tasks rollin' ...<br>
--[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 11:51, 19 February 2015 (UTC)
| |||