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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.