public void computeLCS()
    {
        for (int i = 1; i < seq1.length; i++) {
            for (int j = 1; j < seq2.length; j++) {
                if (seq1[i] == seq2[j]) {
                    length[i][j] = length[i-1][j-1] + 1;
                    indices[i][j] = I * (i-1) + j-1;
                } else if (length[i-1][j] >= length[i][j-1]) {
                    length[i][j] = length[i-1][j];
                    indices[i][j] = -(I * (i-1) + j); 
                } else {
                    length[i][j] = length[i][j-1];
                    indices[i][j] =  -(I * (i) + j-1);
                }
            }
        }
    }