Algorithms for Re-Pair compression |
|
| Abstract | We have studied the Re-Pair compression algorithm to determine whether it can be improved. We have implemented a basic prototype program, and from that created and tested several alternate versions, all with the purpose of improving some part of the algorithm. We have achieved good results and our best version has approximately cut the original running time in half, while losing almost nothing in compression effectiveness, and even lowering memory use significantly. |
| Type | Master's thesis [Academic thesis] |
| Year | 2015 |
| Publisher | Technical University of Denmark, Department of Applied Mathematics and Computer Science |
| Address | Richard Petersens Plads, Building 324, DK-2800 Kgs. Lyngby, Denmark, compute@compute.dtu.dk |
| Series | DTU Compute M.Sc.-2015 |
| Note | |
| Electronic version(s) | [pdf] |
| Publication link | http://www.compute.dtu.dk/English.aspx |
| BibTeX data | [bibtex] |
| IMM Group(s) | Computer Science & Engineering |