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]
@article{CastelliBV13,
title = {A hybrid genetic algorithm for the repetition free longest common subsequence problem},
author = {Mauro Castelli and Stefano Beretta and Leonardo Vanneschi},
year = {2013},
doi = {10.1016/j.orl.2013.09.002},
url = {http://dx.doi.org/10.1016/j.orl.2013.09.002},
researchr = {https://researchr.org/publication/CastelliBV13},
cites = {0},
citedby = {0},
journal = {Oper. Res. Lett.},
volume = {41},
number = {6},
pages = {644-649},
}