Vincent van Ravesteijn wrote: > Right.. let's start with the biggest document that is around :)... > > To find the perfect solution takes a lot of work, but I'm afraid that it is > a bit slow to get to the real document data. So .. it would take a while.. > but it's almost finished. After that it should be speed up. > > The problem is largest when a large piece of text is added. A lot of small > changes will be found very quickly.
will you share which matching algorithm you have chosen? speed ups for this kind of problem must have been already addressed by people working on genetic material. just to avoid reinventing wheel... pavel
