An Improved Algorithm to Find the Length of the Longest Common Subsequence of Two Strings.

Shufen Kuo|George R. Cross


Anthology ID:DBLP:journals/sigir/KuoC89
Year:1989
Venue:SIGIR Forum
Pages:89-99
URL:https://doi.org/10.1145/74697.74702
DOI:https://doi.org/10.1145/74697.74702
DBLP:journals/sigir/KuoC89
BibTeX:
@article{kuo-1989-improved, author = {Shufen Kuo and George R. Cross}, title = {{An Improved Algorithm to Find the Length of the Longest Common Subsequence of Two Strings}}, journal = {SIGIR Forum}, volume = {23}, number = {3-4}, pages = {89--99}, year = {1989}, url = {https://doi.org/10.1145/74697.74702}, doi = {https://doi.org/10.1145/74697.74702} }