Costas S. Iliopoulos, M. Sohel Rahman. Algorithms for computing variants of the longest common subsequence problem. Theoretical Computer Science, 395(2-3):255-267, 2008. [doi]
@article{IliopoulosR08:1,
title = {Algorithms for computing variants of the longest common subsequence problem},
author = {Costas S. Iliopoulos and M. Sohel Rahman},
year = {2008},
doi = {10.1016/j.tcs.2008.01.009},
url = {http://dx.doi.org/10.1016/j.tcs.2008.01.009},
researchr = {https://researchr.org/publication/IliopoulosR08%3A1},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {395},
number = {2-3},
pages = {255-267},
}