A hybrid genetic algorithm for the repetition free longest common subsequence problem

Mauro Castelli, Stefano Beretta, Leonardo Vanneschi. A hybrid genetic algorithm for the repetition free longest common subsequence problem. Oper. Res. Lett., 41(6):644-649, 2013. [doi]

Authors

Mauro Castelli

This author has not been identified. Look up 'Mauro Castelli' in Google

Stefano Beretta

This author has not been identified. Look up 'Stefano Beretta' in Google

Leonardo Vanneschi

This author has not been identified. Look up 'Leonardo Vanneschi' in Google