As a meta point, beware the XY problem:
http://meta.stackexchange.com/a/66378
In other words, you'll typically get better answers faster if you start
with the broad context, like
On Friday, December 5, 2014 5:13:49 PM UTC-8, David Koslicki wrote:
>>
>> I have strings (on the alphabet {A,C,T,G}) of length 30 to 50. I am
>> trying to hash them to save on space (as I have a few million to billion of
>> them).
>>
>
And then suggest ideas for how to solve it that you've thought of that
don't quite work yet, like
> I know I should be using a bloom filter (
>> http://en.wikipedia.org/wiki/Bloom_filter) or some other such
>> space-saving data structure, but I'm too lazy/busy/inexperienced to do it
>> by hand.
>>
> or
> > Is there a built in function that will undo hash()?
>>>>>>
>>>>>
