Search

In this work I present an algorithm for the delta compression problem referring to e ective representation of changes, which occur in a modi ed version of the le with respect to the original le. The algorithm uses the method of searching a dictionary to replace repeating strings of characters by short references to their previous occurrence. These matches are located in both les. Common pre xes of strings are obtained using suffix arrays, potentially interesting alternative to other procedures. The solution is divided in couple of easily modi able modules and changes are stored in own le format. In the work results of used techniques are briefly discussed and possible improvements of the project are proposed.

Animelib is Java library, which visualizes data structures. It is designated for user-friendly visualization of algorithms. User-friendlyness is done in two ways - programmer of algorithm has much less graphics code to write (none ideally), and user - viewer should be pleased with what he sees.