Motivation: given two permutations A and B of numbers from 1 to N, find their LCS efficiently. lcs (A, B) is equals to lis (C), pois todos os caracteres de cada sequência são distintos.

lcs (A, B) is equals to lis (C), pois todos os caracteres de cada sequência são distintos.

This paper re-examines the LCS problem using brute-force method to solve the difficulties, and the corresponding advantages; and then the merits of exhaustive method for two types of optimization; ...