Re^2: Is there a way to compare strings without using an array?

Yes, that is correct and no it isn't a hw problem. I have individual protein families, each containing a various number of proteins. These proteins are not unique to a protein family. They can be in many families. I'm trying to find the best way to perform total protein coverage with the least number of protein families. I'm using a greedy algorithm. Instead of storing all 5million (rough guess) or so proteins in an array and checking them off once I've retrieved them I would like to put them in a really long string to save some space. I haven't tried using a string yet, because I've been working with a hash array combination.

Comment on Re^2: Is there a way to compare strings without using an array?

Replies are listed 'Best First'.
Re^3: Is there a way to compare strings without using an array? by Ea (Chaplain) on Oct 19, 2011 at 16:27 UTC
In which case, have you looked at BioPerl yet? It might have more tools that you'll be interested in. There's a large community at www.bioperl.org perl -e 'print qq(Just another Perl Hacker\n)' # where's the irony switch?	[reply]
Re^4: Is there a way to compare strings without using an array? by Jeri (Scribe) on Oct 20, 2011 at 15:56 UTC
I will do just that today!	[reply]