Python counting bases fasta file

[illinu]

New to python but trying to learn, here I wrote a program to count the nucleotides in a fasta file. The approach is that when the line does not contain a ">" symbol then the program counts nucleotides one by one and adds it to the variable sum. The program does not work and I don't know why. Please help!

#!/usr/bin/env python
import sys

# Takes fasta file and counts total bases

infile = open(sys.argv[0], "rU")
sum = 0
line = infile.readlines()
while ">" not in lline:

for i in line:

sum += 1

print (sum)

usage: $ python countbases.py infile.fasta

[Cogitare]

Perhaps this

It would be helpful if you gave more information about how the program fails. However, one issue I think is this line:

infile = open(sys.argv[0], "rU")

Should be:

infile = open(sys.argv[1], "rU")

In this case sys.argv[0] = your script name, whereas sys.argv[1] = infile.fasta. See here for more information:

http://stackoverflow.com/questions/5222408/python-sys-argv0-meaning-in-official-documentation

[illinu]

It would be helpful if you gave more information about how the program fails. However, one issue I think is this line:

infile = open(sys.argv[0], "rU")

Should be:

infile = open(sys.argv[1], "rU")

In this case sys.argv[0] = your script name, whereas sys.argv[1] = infile.fasta. See here for more information:
http://stackoverflow.com/questions/5...-documentation

Thank you. I also tried with sys.argv[1]
The program does not return any error, it just does not return anything. If I run it in Idle, it crashes and if I run it in terminal, it jumps to the next line as if it was running but it stays there forever. I am trying with very small test files and if it worked it should go fairly fast instead of staying hanged for a long time.

[dpryan]

New to python but trying to learn, here I wrote a program to count the nucleotides in a fasta file. The approach is that when the line does not contain a ">" symbol then the program counts nucleotides one by one and adds it to the variable sum. The program does not work and I don't know why. Please help!

#!/usr/bin/env python
import sys

# Takes fasta file and counts total bases

infile = open(sys.argv[0], "rU")
sum = 0
line = infile.readlines()
while ">" not in lline:

for i in line:

sum += 1

print (sum)

usage: $ python countbases.py infile.fasta

Aside from the argv[0], issue, you're also looking for things in "lline" rather than "line"...

[illinu]

Aside from the argv[0], issue, you're also looking for things in "lline" rather than "line"...

That's a typo here , in the program it's ok. So you're saying that apart from that the program seems ok and it should work?

[dpryan]

Well, you're also trying to iterate through a list in an odd way that I'm not sure would work. You might take a rather more efficient approach:

#!/usr/bin/env python
import sys

f = open(sys.argv[1], "rU")
total=0
for line in f :
    if(line[0] == ">") :
        continue

    total += len(line)-1
print("%s has %i nucleotides" % (sys.argv[1], total))

With readlines(), you end up reading the whole file into a list, which is really memory inefficient if you're dealing with a whole genome.

[illinu]

Impressed! it works like a charm

Thanks a million

[dpryan]

No problem. In a real version, you'd probably want to use argparse (so you can easily give help and usage information) and check to see that the fasta file exists before running further. You also might want to add the number of bases per chromosome, likely only printed if the user specifies.

[brentp]

import sys
print sum(len(l.rstrip()) for l in open(sys.argv[1]) if l[0] != ">")

[CHObot]

Yet another way (and more general) is to use the BioPython module. You will want to get familiar with handling sequences like this anyway, it is much more convenient to have a data structure. It would be this:

import sys
from Bio import SeqIO

for seq_record in SeqIO.parse(sys.argv[1], "fasta"):
    print seq_record.id
    print len(seq_record)

And that would handle multifasta files (with multiple sequences in them) which you will no doubt encounter eventually.