|Keep It Simple, Stupid|
Re^5: Finding Nearly Identical Setsby BrowserUk (Pope)
|on Sep 29, 2016 at 12:04 UTC||Need Help??|
Through out the message, there are 10 markers - I am extracting and only interested in 9 of them.
Well, if the markers are encoded as digits, the code I posted elsewhere will still work.
It would reduce memory a lot, (and make the random generation for testing a bit easier and quicker), if they were encoded as 0..8 rather 1..9.
At any one time, I think I would have around 500K of the nearly 900 million possible.
With method I've demonstrated, that becomes a moot point, as it will continue to work -- with the same memory requirement, right up to the point of having all 900M in play.
The real problem comes with the compounding effect of the edits. If you have 500k 9-digit knowns, then there are 67,108,864,000,000 possible 1-digit substitutions for them. Of course, there are still only 900M possible 9-digit sets, so each of those can be a substitute for ~75,000 actuals. Your problem will be to determine which of the actuals it is a match for.
The code I posted elsewhere is flawed. I completely forgot to test for the substitutions in that version. I've corrected that and am currently doing a test to check I didn't screw something else up. When its done, and assuming I didn't, I post the new version as a reply to the existing. (This is just a heads up for you not to waste any of your time on that version.)
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority". I knew I was on the right track :)
In the absence of evidence, opinion is indistinguishable from prejudice.