I am a beginner in perl programming. I have three sequences like $a=AAATGCCTT, $b=AAAAGCGTC and $c=AAAGGCGTC, which differ at positions 4, 7 and 9 but the rest are alike. Is it possible to use perl code to find the total number of positions where they differ and where they are alike? In this case, the answer will be 3 (dissimilar) and 6 (similar), respectively. Can any perlmonk suggest me which perl code will compare these sequences for matching?
#!usr/bin/perl-w use strict; my $a=AAATGCCTT; my $b=AAAAGCGTC; my $c=AAAGGCGTC; $match=??? $nonmatch=??? perl code??? print"\n No. of matched positions=$match.\n No. of non-matched positions=$nonmatch.\n"; exit;
The answer should look like:
No. of matched positions=3. No. of non-matched positions=6.
In reply to Is it possible to find the number of matching and non-matching positions in strings using perl code? by supriyoch_2008
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |