Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: How can one get all possible combinations of a string without changing positions & using window size?

by bioinformatics (Friar)
on Apr 21, 2013 at 01:21 UTC ( [id://1029693]=note: print w/replies, xml ) Need Help??


in reply to How can one get all possible combinations of a string without changing positions & using window size?

The reason is this portion of code:
foreach my $single (@sw) {

You don't have a closing bracket before:
for $a (1 .. 2) { # a has 2 levels: for $t (1 .. 2) { # t has 2 levels: for $g (1 .. 2) { # g has 2 levels: for $c (1 .. 2) { # c has 2 levels: $combi=sprintf($new_four,$a,$t,$g,$c,3-$a,3-$t,3-$g,3-$c); print"~$combi\n"; print $fh "~$combi\n";
It's the way the loops are arranged, that's all. You can see this more easily by using the perl debugger or print statements to see the values of $new_four at each iteration, etc.

Bioinformatics
  • Comment on Re: How can one get all possible combinations of a string without changing positions & using window size?
  • Select or Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1029693]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others about the Monastery: (3)
As of 2024-04-25 22:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found