Alfredo Braunstein wrote:
[*] There are many of them. Actually it is not really straightforward
because the data structure in LyX is not linear but rather a tree, but I
think this issue can be solved. Another possible problem is that best known
algorithm are worst case O(N^2) where N is the size of the doc. There are
variants that are much faster if the documents are similar (for instance a
O(N*D) algo where D is the "distance" between them), but this may be a
problem if we are trying to integrate it in an automatic context like cvs.
See
http://arxiv.org/abs/0708.4288
for a recent ph.d. dissertation that contains a bunch of improved
algorithms for doing tree diffs, and much more.
Regards,
Asger
