in reply to Search for identical substrings
... the length of my strings (3k characters), and the number of elements (300) leads to prohibitive times for my search. It took a week just to check one element of the array against every other element.
Can you confirm this please. Your current method took 1 week to do 299 LCSs. Which as you have (300 * 299)/2 = 44,850 to do, this would take 150 weeks to perform the processing?
If so, I think I can help you. I believe I can get that down to 67 hours. But, as this is so much quicker (than both your current method and a couple of others I have tried), I would very much like to verify my program against some known data.
So, if you could let us/me have say 5 of your 3k strings, and the LCS that your current method finds + the time taken, I could check what I have against your findings before exposing any stupidities to the world.
TIA.
Alternatively, I could provide my test data for you to try.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Search for identical substrings
by bioMan (Beadle) on Aug 18, 2005 at 16:19 UTC | |
by GrandFather (Saint) on Aug 19, 2005 at 00:18 UTC | |
by bioMan (Beadle) on Aug 19, 2005 at 17:18 UTC | |
by BrowserUk (Patriarch) on Aug 20, 2005 at 00:49 UTC | |
by bioMan (Beadle) on Aug 22, 2005 at 16:54 UTC | |
|