Talk:Longest-common subsequence problem
|
|
The repeated use of the language "Computer scientists" with some verb (devised, agree) could be improved to just usign "Computer science".
Besides, the repeated contextual links to" Computer scientists" would make the user think they would click on Computer scientists to go to an entry of the computer scientists who invented, devised or agreed to the algorithm's solution, not to the literal entry "Computer scientists".
Besides this, a great entry. Hope I've helped.
| Contents |
Sequence or string?
I've read somewhere that the longest common substring is not necesarily the same as the longest common subsequence. Specifically a sequence apparently doesn't have to be contiguous. Is there any truth in this? Shinobu 23:30, 3 Apr 2005 (UTC)
Yes, you are correct: substrings are contiguous, subsequences need not be.
These wiki-links should be added somewhere
Unfortunately I haven't got the time to do so in a neat fashion right now. Anyway, here goes: suffix tree suffix array Bye! Shinobu 23:43, 4 Apr 2005 (UTC)
Removed C source
I removed the C source, partly because it should be on Wikisource and not here, partly because if we should have a source on this we should use a better method, partly because we already have pseudocode source and partly because it was not formatted correctly. Of course I encourage anyone to put an optimized suffix array version on Wikisource and add a link here. Shinobu 12:39, 17 Apr 2005 (UTC)
Hyphen
This article should be called "longest common subsequence problem", not "longest-common subsequence problem". There is absolutely no reason to have a hyphen there.
- I guess you're right. But before you decide to move this article remember that there is still some research going on that perhaps may force a rename to "Longest common substring problem" anyway. Stay tuned, Shinobu 16:46, 26 Apr 2005 (UTC)