A Survey of Longest Common Subsequence Algorithms.
Lasse Bergroth|Harri Hakonen|Timo Raita
| Anthology ID: | DBLP:conf/spire/BergrothHR00 |
|---|---|
| Volume: | Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coruña, Spain, September 27-29, 2000 |
| Year: | 2000 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | IEEE Computer Society |
| Pages: | 39-48 |
| URL: | https://doi.org/10.1109/SPIRE.2000.878178 |
| DOI: | https://doi.org/10.1109/SPIRE.2000.878178 |
| DBLP: | conf/spire/BergrothHR00 |
| BibTeX: |
@inproceedings{bergroth-2000-survey,
author = {Lasse Bergroth and
Harri Hakonen and
Timo Raita},
editor = {Pablo de la Fuente},
title = {{A Survey of Longest Common Subsequence Algorithms}},
booktitle = {{Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coru\~{n}a, Spain, September 27-29, 2000}},
pages = {39--48},
publisher = {IEEE Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SPIRE.2000.878178},
doi = {https://doi.org/10.1109/SPIRE.2000.878178}
}