Hello users!

I am newbie in that forum, but I am skilled user in term of compression/decompression algorithms.

I am currently looking for the "best" TEXT compression algorithm available so far - I need to compress text file with much repeated strings (but these strings are not grouped).

Explanation:

Input text file consist of these characters:

162434E125F11718191A262728292A35363738393A43444546 4748494A535455565758595A636465666768696A7374757677 78797A82838485868788898A92939495969798999AA2A3A4A5 A6A7A8A9AAB2B3B4B5B6B7B8B9BAC2C3C4C5C6C7C8C9CAD2D3 D4D5D6D7D8D9DAE2E3E4E5E6E7E8E9EAF2F3F4F5F6F7F8F9FA FFDA000C03010002110311003F0079BE20673D297EDC1875AC 6129EE78A9EDD5A68BCC43B9738047AD711A421CCEC77B339C F95179EE4E0EDE7BD574796E25FBACB1E01DC056ED96951896 40467643827DCD6AD9E991790B1328F9C119F4209C53A74DC9 9E8462A2AC44E6A270CA577731F4FB2D36DAEA0BA40F34D19C A939E0D7536D7524C41718E2B1DAC25B49385DCB9AD2B3663C 15229422A2B42C726DEE49B08C36D71BE37D415AF6DAD03E04 49924762DCFF00203F3AEB11BE5AF36F15DC2B6A8D36371676 CFD38C56757E033AF2B248BA7F11A50576C7E933CF1DC4D1B9 254AEE56FC40ABFAC6A11C7731194B2B88C2851D1F278FEB54 B46B88ED6DDDEE07EECFDC27A568DFC1E6341A94902B2DB025 54F7071CFE1CD71287BF72ECEE74463AF30EDA1911EABAA3A8 486FCC68830A8BD8554D6ADEFF00586592EE7596454091B018 C0049C1FCCD49AEDC470DC2CD0B0114AB91C7435930EAF2467 0CC1C7A1ADF9AEAC444E67135918D240F0CC52552A41C1CD58 8B4CBCBA42D6F6CEE9FDE02B5EE658751B6126C5F333803DFF 00CF1459EB00C4221F23A0C019AB1DAE8E6B1A6CCC69ACE7B6 C8B881D3201524511C992D9E78033F4ADE9EF5EEA231142EAD C15EB8A8344F0DDDEA376CBF208A294A487773C75C0A86064D 1ACA377A0BA368F77A9879C2E21538666E95D4691A77D92E96 78E647118230061B06ADC73893477B78AD4DB794A405030057 3835958F6AB310EA7EF038FC2A1EE2DD91185F53AAD6

I need something like this:

1(26)2(15)E(8) etc.

Explanation:
I need an algorithm that is capable to compress (or ´express´) repeated strings that are found in text document with much smaller strings - e.g. algorithm starts looking for the first string (in our case its "1") and continue after the end of the document is reached. After that, algorithm write the repetetion of each searched string (e.g. 1(26), A(40) etc.) instead of actual character.

In conclusion - input file - 250 KByte; output 1KByte

Time to compress or decompress is absolutely NOT important.

So, is there any compression algorithm that can achieve my specifications? I have found RLE (Run Lenght Encoding), but the algorithm is "resetted" after it detects a new string e.g. "AAAAAAAAAAAABBBBAAAAAAABB" is expressed as a "12A4B7A2B" instead of "19A6B".

Thanks a lot for your help.

Best regards,
CompressMaster