BhariD has asked for the wisdom of the Perl Monks concerning the
following question:  Here is a part of the code that I have
pasted followed by my question. This program uses, perl and one
function below uses bioperl to obtain all the possible sequences
from a given degenerate iupac string  For example, I will use
the iupac string here as:   Here, A,C,G, or T are single
characters, everything else either carries 2, 3 or 4 characters
as follows:   Y => CT  D => AGT  B => CGT  V => ACG  H => ACT  R
=> AG  So we can see how many possible combinations can come out
of this iupac string probably >10000000 seqs with only A,C,G or
T characters  #!/usr/bin/perl use strict; use warnings; use
Bio::SeqIO; use Bio::SeqFeature::Primer; use Bio::Tools::IUPAC;
use Bio::Tools::SeqPattern; #some parameters for the equation to
compute Tm my $conc_primer = 0.25; my $conc_salt = 50; my
$mgconc = 0; my $iupac = 'NNYDBAVDVHVHNGGNR'; #this calls the
function to generate all possible seqs from iupac stri +ng my
@PotSeqs = find_degene