DNA function!

Hello guys! Can someone help me, i have no idea how can I realize the question below! Thanks for every help...!

Tasks:
Deoxyribonucleic acid (DNA) is a molecule describing the genetic information of an organism. It is made up of various combinations of four different smaller molecules: adenine, thymine, guanine, and cytosine. Because of this, DNA is frequently represented as a string of A, T, G, and C characters, corresponding to the four different molecules. For example, the human genome might be described as “ATATCGATCGATCG…” (continuing on for about 6 billion more characters).
In this assignment, you will store a DNA sequence as a singly-linked list of strings of length one, implemented using a Node structure.



1. Write a function percentage that inputs a linked list DNA sequence and a string of length 1
(one of ‘A’,‘C’,‘G’, ‘T’) , and produces the percentage (as a floating point number between
0 and 100) of times that character appears in the list, relative to the length of the list. Produce 0 for an empty DNA sequence.


2. DNA sequences can be very long. One way to (potentially) conserve space is to group together
sequences of common characters. For example, ‘AAAGTTTACACCT’ could be compressed as
‘A3G1T3A1C1A1C2T1’.
Write a function compress that inputs a linked list DNA sequence, and produces a new linked
list, in which the items in the Nodes are lists of length 2, [x,y], where x is one of the strings
‘A’,’C’,’G’,’T’, and y is the number of times that character appears in consecutive positions
in the sequence. For example, for the linked list image in Question 1, compress would produce the following linked list:

Well the first question is, do you know what a linked list is, and how to implement one?

If you don't know what a linked list is, have you at least typed "linked list" into google, and done some reading?

Aaagtttacacct
A3g1t3a1c1a1c2t1

Hey come on guys, I need your help and I will learn it! I know what a linked list is!

For the first question:

Linked list
@->‘A’ -> ‘T’ -> ‘T’ ->’G’

First Node structure for singly link list;

struct node
{
int info;
struct node *next;
}*start

//code code...

1) First i have to read my input scanf ...
2) create a new node while next == NULL
3) output of the inserted character...!



For the Second question;
Linked list array??
@->[‘A’,1] -> [‘T’,2] -> [‘T’, 3]->[’G’,4]

Try that again, only in monospace:


The "compressed" version is only longer by three characters. Not good, but not as bad as the default variable-width font made it look.

I would suggest an improvement: represent a single base without the count of "1", but by the base alone. That would yield:

No, not int. I would opt for char, but your assignment looks like they want you to use a "string of length one" -- which sounds as lame as the "compression" scheme -- so you'd have to make that field a char[2] array.


Yeah, that's about it. Except you will need to append the new node onto the end of the list. Then to output the entire list you would simply traverse the list from start to end. You would traverse it the same way to count the number of occurances of each base.


"Linked list array"? What is that supposed to be? Sounds like an array of start pointers to a number of different lists. That "lists of length 2" wording is just weird and confusing.

The base would be one field in the node and the number of sequential occurances would the the second field -- and, of course, the link to the next node would be the third field.

Whats that? the solution...??

A 16596 nucleotide sequence of mouse
"compresses" to 23352 characters.
The longest base repetitions is 8.
The dwise1_aol improvement reduces
the sequence to 15087 characters.
We all know that packing the data
2 bits per nucleotide would make higher
density. Except that I've found
references for 6 DNA bases.

Actually i start with the programm...! First I built a structure and then a function percentag(). Suggestios?

I suggest you work on the second part of Salem's first question, "Well the first question is, do you know what a linked list is, and how to implement one?"

In my sad life this is far and away the funniest thread of the week.

When you know it, then give me the answer! With report please and not in chinese! after you can laugh so much you want. I think you was not better when you start to program!

I have no idea! I would upload a pic, but it is not possible! The array are in nodes and letter are in char!

linked lists, click here!

allocate memory, click here