On Thu, 2004-02-12 at 19:24, J. Wren Hunt wrote: > How about Huffman encoding? There's Algorithm::Huffman (run-length > encoding) Or you might try Compress::Zlib (file-based). How big roughly > are your strings? > > Wren
Some are as long as 25 - 30m. Most are under 6m. I'll look up the docs on your two suggestions, thanks! -- Sean Quinlan <[EMAIL PROTECTED]>
signature.asc
Description: This is a digitally signed message part
_______________________________________________ Boston-pm mailing list [EMAIL PROTECTED] http://mail.pm.org/mailman/listinfo/boston-pm
