Hua Lin, Mi Lu, Jesse Zhixi Fang. An optimal algorithm for the longest common subsequence problem. In Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, 2-5 December 1991, Dallas, Texas, USA. pages 630-639, IEEE Computer Society, 1991. [doi]
@inproceedings{LinLF91,
title = {An optimal algorithm for the longest common subsequence problem},
author = {Hua Lin and Mi Lu and Jesse Zhixi Fang},
year = {1991},
doi = {10.1109/SPDP.1991.218203},
url = {http://dx.doi.org/10.1109/SPDP.1991.218203},
researchr = {https://researchr.org/publication/LinLF91},
cites = {0},
citedby = {0},
pages = {630-639},
booktitle = {Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, SPDP 1991, 2-5 December 1991, Dallas, Texas, USA},
publisher = {IEEE Computer Society},
isbn = {0-8186-2310-1},
}