in reply to Looking for Printing all possible combinations
Sorry this isn't newbie friendly:
open my $f1, '<', \<<''; string1 (C)C(T)A string2 T(A)GG(A)GGG(G) open my $f2, '<', \<<''; string1 1 C A string1 3 T C string2 5 A T string2 9 G A string2 2 A C my %h = map split, <$f1>; tr/()//d, $_ = [split //] for values %h; while (<$f2>) { local $" = ','; my ($k, $i, @combo) = split; $h{$k}[$i-1] = lc "{@combo}"; } for my $k (sort keys %h) { local $" = ''; while (<@{$h{$k}}>) { s/([a-z])/(\u$1)/g; print "$k $_\n"; } }
Outputs:
string1 (C)C(T)A string1 (C)C(C)A string1 (A)C(T)A string1 (A)C(C)A string2 T(A)GG(A)GGG(G) string2 T(A)GG(A)GGG(A) string2 T(A)GG(T)GGG(G) string2 T(A)GG(T)GGG(A) string2 T(C)GG(A)GGG(G) string2 T(C)GG(A)GGG(A) string2 T(C)GG(T)GGG(G) string2 T(C)GG(T)GGG(A)
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Looking for Printing all possible combinations
by sarkar (Initiate) on Feb 14, 2015 at 00:42 UTC | |
by choroba (Cardinal) on Feb 14, 2015 at 00:48 UTC | |
by sarkar (Initiate) on Feb 15, 2015 at 14:47 UTC | |
by choroba (Cardinal) on Feb 16, 2015 at 10:15 UTC |