print "Input the K value \n";
$k = <>;
chomp $k;

print "Input T\n";
$t = <>;
chomp $t;

%Qkmer = ();                      
$i = 1;

$query=' ';
while ($line=<IN>) {
chomp($line);
 if ($line=~ m/^>/ ) {
 next;
}
$query=$query.$line;
$line=~ s/(^|\n)[\n\s]*/$1/g;

 while (length($line) >= $k) {
   $line =~ m/(.{$k})/;
   if (! defined $Qkmer{$1}) {#every key not deined as the first match
     $Qkmer{$1} = $i;
   }
   $i++;
   $line = substr($line, 1, length($line) -1);
 }
}

open(MYDATA, '<', "data.txt");

while ($line=<MYDATA>) { \
  chomp($line);
  %Skmer = ();           # This initializes the hash called Skmer.
  $j = 1;

  if ($line=~ m/^>/ ) { #if the line starts with >
    next; #start on next line #separated characters
  }
  $line=~ s/^\s+|\s+$//g ; #remove all spaces from file
  while (length($line) >= $k) {
    $line =~ m/(.{$k})/;#match any k characters and only k characters 
+in dna
    $Skmer{$1} = $j; #set the key position to $j and increase for each
+ new key
    $j++;
    $line = substr($line, 1, length($line) -1); #this removes the firs
+t character in the current string
  }

  ###(56)###for($Skmerkey(keys %Skmer)){
    $i=$Skmer{$Skmerkey};
    if(defined $Qkmer($Skmerkey)){
      $j=$Qkmer($Skmerkey);
      }
      $S1=$line;
      $S2=$query;
      @arrayS1= split(//, $S1);
      @array2= split(//, $S2);

      $l=0;
      while($arrayS1[$i-$l] eq $arrayS2[$j-$l]){
        $l++;
      }
      $start=$i-$l;
      $m=0;
      while ($arrayS1[$i+$k+$m] eq $arrayS2[$j+$k+$m]) {
        $m++;
      }
      $length=$l+$k+$m;
      $match= substr($S1, $start, $length);

      if($length>$t){
        $longest=length($match);
        print "Longest: $match of length $longest \n";
      }
  }

}###(83)###

[download]
The input files contain only strings of letters. For example. From a match of a word of length $k in file 1 in file 2, I check from that match in file 2 to left and to right of word for further matches. The final output is the longest match between File 1 and File 2 based on $k. Now I get With this code, I get a syntax error and I am not sure why because it looks correct to me: ``` syntax error at testk.pl line 56, near "$Skmerkey(" syntax error at testk.pl line 83, near "}" ``` Thank you.

In reply to FInding the longest match from an initial match between two files by Allie_grater

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.