Search:

I'd like to thank everyone for all of the help. But the length of this assignment is growing and growing each day (and I have several other assignments to do) and the codes get more complex as it...

I haven't learn about malloc yet, but that sounds like a nice function. Since I feel tired of creating a 2d array for each base.

This is what I did and it works.



/* DNA.c generates the base numbers, from the set of (A,C,G,T), from 1 to
5. Adak, April, 2009
*/

#include <stdio.h>
#include <string.h>

Performance is not the issue here. I'm going for correctness and ease of understanding.

Adak, oh it's a pretty long assignment. I have to read an input file containing thousands of DNA strands and count the value of each case (how many times it occur for base 1, base 2, base 3, etc.),...

No, you got it wrong.

Simple concept but hard to explain. Only 1 letter change at a time starting from the right. Once that letter complete its change (got all the way to T), then it "reset" and...

I don't understand the part in bold. Are you using an array? Can you give an example of how the codes would look like?

Ok here's what I got so far.

This is only for base 2.



#include <stdio.h>
#include <ctype.h>
#include <string.h>

Well, the pattern is...

For base 2:
First letter is A, then match with second letter ACGT (you'd get, AA, AC, AG, AT). Then first letter change to C, and match with second letter ACGT (you'd get...

Well, I want the program to use an algorithm to produce the sequence, instead of me manually input all the sequence. Imagine base 15, that would produce ~1 billion different sequences. That's...

I'm writing a program that generates the DNA sequence given a base number.

For example, if I give it base 1, the sequence would be: a, c, g, t. If I give it base 2, the sequence would be: aa, ac,...

I want to write a program that accepts input like this:

Input: 0001111+0110000

where the first 7 characters are digits (I'm try to make them look like a 7 bit binary number), the 8th character...