Implementing the algorithm Burrows Wheeler Transform.
My implementation is basic and very slow, i'm use suffix array for the transformation
- python3 transform.py [input] [output]
- python3 reverse.py [input] [output] [key or 'all']
- The key is print when transformation
Original Size | Transform | Reverse |
---|---|---|
67601 bytes | 45s | ? (plus de 1:06heure) |