in reply to a bit more help with pairwise comparisons between strings in arrays.

Just move the my %counts and the print of %counts into into the first foreach:

use strict; use warnings; my @site1 = qw( AATKKM AKTKKM ); my @site2 = qw( GGGGGG HHHHHH ); my $site1; my $site2; foreach $site1 (@site1) { my @site1_parts = split(//, $site1); my %counts; foreach $site2 (@site2) { my @site2_parts = split(//, $site2); my $i = @site1_parts; $counts{$site1_parts[$i].$site2_parts[$i]}++ while ($i--); } print($_, ': ', $counts{$_}, $/) foreach (sort keys %counts); print($/); } __END__ output ====== AG: 2 AH: 2 KG: 2 KH: 2 MG: 1 MH: 1 TG: 1 TH: 1 AG: 1 AH: 1 KG: 3 KH: 3 MG: 1 MH: 1 TG: 1 TH: 1

I got rid of MapCar since it wasn't needed. (Yeah, I know I'm the one who introduced MapCar in the first place.) I also switched to data that better illustrates the results.

If you don't want to discard the previous counts before the loops is over, you can use an AoH:

use strict; use warnings; my @site1 = qw( AATKKM AKTKKM ); my @site2 = qw( GGGGGG HHHHHH ); my $site1; my $site2; my @count_collection; foreach $site1 (@site1) { my @site1_parts = split(//, $site1); my %counts; foreach $site2 (@site2) { my @site2_parts = split(//, $site2); my $i = @site1_parts; $counts{$site1_parts[$i].$site2_parts[$i]}++ while ($i--); } push(@count_collection, \%counts); } foreach (@count_collection) { my $counts = $_; print($_, ': ', $counts->{$_}, $/) foreach (sort keys %$counts); print($/); } __END__ output ====== AG: 2 AH: 2 KG: 2 KH: 2 MG: 1 MH: 1 TG: 1 TH: 1 AG: 1 AH: 1 KG: 3 KH: 3 MG: 1 MH: 1 TG: 1 TH: 1

Replies are listed 'Best First'.
Re^2: a bit more help with pairwise comparisons between strings in arrays.
by replicant4 (Novice) on Oct 20, 2004 at 21:01 UTC
    Thanks ikegami. One final question, and I hope I am not bothering you too much. The way of the comparisons does not matter. Concerning the counts, count AG=countGA, so is it possible to have that as well, meaning that if AG, GA appears while comparing, to have count AG+2 instead of having countAG+1 and countGA+1 ? Once again you have been more than hekpfull, thanks a lot.

      You really should try to answer your questions before asking them.

      The simple way is to sort the two letters before concatenating them and using the result as the index:

      Add
      sub get_index { $_[0] lt $_[1] ? ($_[0].$_[1]) : ($_[1].$_[0]) }
      and replace
      $counts{$site1_parts[$i].$site2_parts[$i]}++ while ($i--);
      with
      $counts{get_index($site1_parts[$i], $site2_parts[$i])}++ while ($i--);

      my @site1 = qw( AGTTTT );
      my @site2 = qw( GAKKHT );
      gives
      AG: 2, HT: 1, KT: 2, TT: 1

        thanks again. I am a beginner at perl so I 've been trying to answer my questons, but it was no good. I have another one for you, which might be a bit trickier. I need to calculate the frequencies by which specific combinations appear. So after I do the pairwise combinations and store them into the @count _collection(that is all the possible times that specific combinations appear, then I have to do that for individual sites and calculate the frequency. In the code that is if a divide a specific counter (say counterAG) from %counts with how many times it appears in the AoH. That is I need to calulate countAG/total_count_AG. I don't know if this is possible, I suspect that since the keys of the hashes are similar, it can be done, but I am not sure how. Once again thanks for your patience and your time.