function [pos, dist] = encontrarMasParecido(p1,p2)
  largo1 = length(p1);
  largo2 = length(p2);
  if (largo2 > largo1) || (largo1 == 0) || (largo2 == 0)
    pos = -1;
    dist = -1;
  else
    pos = 1;
    dist = largo2;
    for i=1:(largo1 - largo2 + 1)
      %aux = [];
      aux = "";
      for j=i:i+ (largo2-1)
        aux = [aux p1(j)];
      end
      dH = distHamming(p2,aux);
      if dH < dist
        pos = i;
        dist = dH;
      endif
    end
  endif
endfunction