Brenda S. Baker, Raffaele Giancarlo. Sparse Dynamic Programming for Longest Common Subsequence from Fragments. J. Algorithms, 42(2):231-254, 2002. [doi]
@article{BakerG02,
title = {Sparse Dynamic Programming for Longest Common Subsequence from Fragments},
author = {Brenda S. Baker and Raffaele Giancarlo},
year = {2002},
doi = {10.1006/jagm.2002.1214},
url = {http://dx.doi.org/10.1006/jagm.2002.1214},
tags = {programming},
researchr = {https://researchr.org/publication/BakerG02},
cites = {0},
citedby = {0},
journal = {J. Algorithms},
volume = {42},
number = {2},
pages = {231-254},
}