hi gang, having problems with a program i am trying to write..
im going to try my best to explain this. I am terrible at explaining when i am nervous. ops:
In some programs i have written, i have been looking at repeats. Which has been pretty straight forward... But i have decided now to try and looking for mismatches in sequences.
A mismatch for example:
Say you have a sequence:
S1 = ATGCTATG
S2 = ATGCGAGC
As you can see, from the two sequences there are some characters that match,but some that dont..... ie.. T - G, G-C .... this is called a mismatch....
I myself is still trying to get my head around this different way of thinking...
Here is an example of what a program of mismatches might output:
If you had a sequence: "AGTGTAGTAG"
I hope this makes it a little bit clearer what iam up against...Code:AG - 3 repeats found 1 mismatch //because AG and TG ...G and G in same position GT - 3 repeats found 0 mismatch AGT - 2 repeats found 1 mismatch //coz AGT and TGT GT are similar... TA - 2 repeats found 1 mismatch //coz GA are similar AGTA - 1 repeats found b] 2 mismatch [/b] //AGTG,TGTA , GT's are in position
I have written a program before to find perfect repeats...basically it goes through each sequence and compares each string and outputs the number of times it has been repeated..
i can show my implementation if wanted,but im really stuck and some guidance would be really appreciated