comment on

One approach to save memory would be pack the strings using a custom mapping (A => 0x00, C => 0x01, G => 0x10, T => 0x11). This will allow you to store 4 characters in an 8-bit byte, thus consuming 9 bytes instead of 34. You probably want to do this anyway even if you sort with an external utility, since you'll improve bandwidth efficiencies the longer you can maintain the data in this compressed format.

Sadly your lengths are just two characters too many to hold everything in a nice 64-bit quantity.

• another intruder with the mooring in the heart of the Perl

In reply to Re: Sorting Gigabytes of Strings Without Storing Them by grinder
in thread Sorting Gigabytes of Strings Without Storing Them by neversaint

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


Your skill will accomplish what the force of many cannot
	PerlMonks