Is there a way to compare strings without using an array?

Jeri has asked for the wisdom of the Perl Monks concerning the following question:

Replies are listed 'Best First'.
Re: Is there a way to compare strings without using an array? by MidLifeXis (Monsignor) on Oct 18, 2011 at 19:01 UTC
I need a little bit of clarification. Is this a correct interpretation of your question? given two strings find all duplicate characters order of matches is not important This also looks homeworkish. If so, please state as much. In any case, please show what you have tried. --MidLifeXis	[reply]
Re^2: Is there a way to compare strings without using an array? by Jeri (Scribe) on Oct 18, 2011 at 19:39 UTC
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.	[reply]
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
Re: Is there a way to compare strings without using an array? by jgamble (Pilgrim) on Oct 18, 2011 at 19:36 UTC
The keyword you're looking for is "Levenshtein". Google (or DuckDuckGo) will find you information on his algorithm. You'll also find modules that handle that in CPAN (put "Levenshtein" in the search box, keep the "in" box to "All").	[reply]
Re^2: Is there a way to compare strings without using an array? by Jeri (Scribe) on Oct 18, 2011 at 19:48 UTC
Actually I'm not sure this will work because my string will look something like this.. `648040620,637132715,649986572 etc.` Levenshtein could take into account some unwanted modifications, such as changing the entire 9 digit number by changing a single digit I need the numbers not to be considered as change-able	[reply] [d/l]
Re^3: Is there a way to compare strings without using an array? by CountZero (Bishop) on Oct 18, 2011 at 20:23 UTC
Wait ... you mean your proteins are not single letters? But actually a 9 digit number like `648040620`? Then the regex solution as mentioned above will not work and I think you better put your data in arrays and use List::Compare to calculate the set intersection and such. CountZero A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James	[reply] [d/l]
Re^4: Is there a way to compare strings without using an array? by Jeri (Scribe) on Oct 18, 2011 at 20:32 UTC
Re^5: Is there a way to compare strings without using an array? by tj_thompson (Monk) on Oct 18, 2011 at 21:04 UTC
Re^5: Is there a way to compare strings without using an array? by CountZero (Bishop) on Oct 19, 2011 at 16:12 UTC
Re^4: Is there a way to compare strings without using an array? by mrstlee (Beadle) on Oct 19, 2011 at 13:47 UTC
Re^4: Is there a way to compare strings without using an array? by Jeri (Scribe) on Oct 20, 2011 at 16:01 UTC
Re^2: Is there a way to compare strings without using an array? by Jeri (Scribe) on Oct 18, 2011 at 19:41 UTC
oooo thanks, this might just be what I need	[reply]
Re: Is there a way to compare strings without using an array? by Anonymous Monk on Oct 18, 2011 at 19:01 UTC
`say $line2 =~ /[$line1]/g; say $line1 =~ /[^$line2]/g, $line2 =~ /[^$line1]/g;` [download]	[reply] [d/l]
Re^2: Is there a way to compare strings without using an array? by CountZero (Bishop) on Oct 18, 2011 at 20:08 UTC
With duplicates removed and the output sorted: `use Modern::Perl; my $line1= 'CABGFEBFA'; my $line2= 'DBFDDF'; say sort keys %{{map {$_ => 1} $line2 =~ /[$line1]/g}}; say sort keys %{{map {$_ => 1} $line1 =~ /[^$line2]/g, $line2 =~ /[^$l +ine1]/g}};` [download] CountZero A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James	[reply] [d/l]
Re^2: Is there a way to compare strings without using an array? by Jeri (Scribe) on Oct 18, 2011 at 19:34 UTC
`say for $line1 =~ /[$line2]/g;` it complains... `Bareword "say" not allowed while "strict subs"` when I delete say, it complains... `syntax error at evan.pl line 8, near "$line1 =~"` What's the trick to this sting comparison? thanks!	[reply] [d/l] [select]
Re^3: Is there a way to compare strings without using an array? (say) by toolic (Bishop) on Oct 18, 2011 at 19:45 UTC
Bareword "say" not allowed while "strict subs" perldoc -f say `use feature 'say';` [download]	[reply] [d/l]
Re^4: Is there a way to compare strings without using an array? (say) by Jeri (Scribe) on Oct 18, 2011 at 19:51 UTC
Re^4: Is there a way to compare strings without using an array? (say) by Jeri (Scribe) on Oct 18, 2011 at 20:00 UTC
Re^5: Is there a way to compare strings without using an array? (say) by jeffa (Bishop) on Oct 18, 2011 at 21:44 UTC
Some notes below your chosen depth have not been shown here
Re^5: Is there a way to compare strings without using an array? (say) by ikegami (Patriarch) on Oct 18, 2011 at 22:49 UTC


Syntactic Confectionery Delight
	PerlMonks