Feb 28, 2011, 12:48 AM
Post #1 of 7
This is regarding a small project, where i will have store 20 alpahbets in pairs(characters in the form of array in pasirs, like AA AB AC..like wise), and compare the input sequence like ABCDG.... with the pairs.
complex Perl program
To explain in detail:if the ssequence is ABCDG, then first two characters will be compared with the existing pairs( 20 characters in the form of array in pairs, like AA AB AC..like wise) if avaiable notify with count,
i.e AB compare with all pairs like AA ,AB .. then BC compare with AA, AB .....and so on..
To put it more simple..i need to hard cord 20 alphabets(A,B,C,D,...in combinations like AA,AB, it comes around 300+ combinations) , then compare the input sequence ABCDA...with these hard cored pairs..but the inpout sequence will be compared like 1-2, 2-3, 3-4(AB,BC,CD)....
Please help me, thanks in Advance.