thnks for the reply. But what u written is method to compute longest common substring. In my algo its give the algo but the problem is it does...
#include<stdio.h> #include<conio.h> #include<string.h> #include<time.h> #include<math.h> #include <stdlib.h> int sum(int,int); int main() {...
I am writing a program in c which compute the longest common subsequences between two strings. But the problem is that when the input string...
lcs problem Let, we have 3 sequences, 1 2 34 56 7 8 910 11 12 s1=a c t t c a g g c t a a s2=t t c t a a a g c a a t s3=a a...
The reason is very simple. As we know integer takes two bytes in memory. 2B means 2^4 bits i.e 16 bits. Now 1 bit is left out for the preceding...
I am writing a program which will find matching position of similar charecter between three sequences. 1 2 3 4 5 6 7 8 9...
my code is below, #include<stdio.h> #include<conio.h> #include<string.h> #include<time.h> #include<math.h> #include <stdlib.h> int main()...
sir,I understand your algo. But I already calculated the sum . I just want to find out those pairs which have equal sum but the difference between...
I have the set of matching pairs say p[0]=(0,1),p[1]=(1,2),p[2]=(4,0),p[3]=(0,5),p[4]=(2,4),p[5]=(3,3),p[6]=(5,1),p[7]=(1,7),p[8]=(2,6) now,I...
thanks DRK for reply...
I am doing a program which will delete the duplicate match pair from the matching pair list between two string.It will print all the arrays...
Separate names with a comma.
