[Biojava-dev] a question on NeedlemanWunsch.java

[simpleyrx]

Dear experts

     In  NeedlemanWunsch.java code ,

 for (i = 1; i <= squery.length(); i++)
          for (j = 1; j <= ssubject.length(); j++) {
            E[i][j] = Math.min(E[i][j - 1], CostMatrix[i][j - 1] + insert)
                + gapExt;
            F[i][j] = Math.min(F[i - 1][j], CostMatrix[i - 1][j] + delete)
                + gapExt;
            CostMatrix[i][j] = min(E[i][j], F[i][j], CostMatrix[i - 1][j - 1]
                - matchReplace(squery, ssubject, i, j));
          }

  In some papers , they used Math.max instead of Min.  I wonder why ?



--


Renxiang Yan