New Approximation Algorithms for Longest Common Subsequences.
Lasse Bergroth|Harri Hakonen|Timo Raita
| Anthology ID: | DBLP:conf/spire/BergrothHR98 |
|---|---|
| Volume: | String Processing and Information Retrieval: A South American Symposium, SPIRE 1998, Santa Cruz de la Sierra Bolivia, September 9-11, 1998 |
| Year: | 1998 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | IEEE Computer Society |
| Pages: | 32-40 |
| URL: | https://doi.org/10.1109/SPIRE.1998.712980 |
| DOI: | https://doi.org/10.1109/SPIRE.1998.712980 |
| DBLP: | conf/spire/BergrothHR98 |
| BibTeX: |
@inproceedings{bergroth-1998-new,
author = {Lasse Bergroth and
Harri Hakonen and
Timo Raita},
title = {{New Approximation Algorithms for Longest Common Subsequences}},
booktitle = {{String Processing and Information Retrieval: A South American Symposium, SPIRE 1998, Santa Cruz de la Sierra Bolivia, September 9-11, 1998}},
pages = {32--40},
publisher = {IEEE Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SPIRE.1998.712980},
doi = {https://doi.org/10.1109/SPIRE.1998.712980}
}