#103 (comment)
it looks like cur_seqs is set to [] and gets returned.
|
cur_seqs = [] |
|
# Go through each sequence again and and generate ambiguous bases |
|
for seq in amb_seqs: |
|
#print("nt: {0}".format(nt)) |
|
# build up permutations for the current ambiguous base |
|
for base in amb_bases: |
|
#print("base: {0}".format(base)) |
|
#print("seq[:i] + base + seq[i+1:]".format(seq[:i], base, seq[i+1:])) |
|
cur_seqs.append(seq[:i] + base + seq[i+1:]) |
|
#print("cur_seqs: {0}".format(cur_seqs)) |
|
amb_seqs = cur_seqs |
|
if len(amb_seqs) > MAX_PERMS: |
|
sys.stderr.write("Sequence {0} has {1} ambiguous bases that would produce {2} permutations and was skipped\n".format(seq_id, len(a_bases), total_perms)) |
|
return [] |
|
#print("amb_seqs: {0}".format(amb_seqs)) |
|
return amb_seqs |
should be able to check total_perms or return [seq_str] if cur_seqs is empty
#103 (comment)
it looks like
cur_seqsis set to [] and gets returned.bio_bits/bio_bits/fasta.py
Lines 97 to 112 in 8976ba4
should be able to check
total_permsor return[seq_str]ifcur_seqsis empty