Technical notes

Edit distance problem(By modified LCS): If input is >> A AAAA Then output is >> ------A AAAA where --- means insert. Delete can be handle in same way and replace also. Complex one is>> ATCGA TGAC out >> A T C G A - -  T  - G A C Now the code is in perl and is given bellow.... *********************************************************************************** main(@ARGV); my $co = 0; my($x,$y); sub main {   my @line;   my @a;   my @b;   my $c = 0;   open(MYDATA,"in.txt");   while($line = <MYDATA>)   {     chomp($line);     if($c == 0)     {        @a = split'',$line;     }     else     {        @b = split'',$line;     }     ++$c;   }   close MYDATA;    lcs(\@a,\@b);  ...