Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem.
| Anthology ID: | DBLP:conf/spire/Bergroth05 |
|---|---|
| Volume: | String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings |
| Year: | 2005 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 301-314 |
| URL: | https://doi.org/10.1007/11575832_34 |
| DOI: | https://doi.org/10.1007/11575832_34 |
| DBLP: | conf/spire/Bergroth05 |
| BibTeX: |
@inproceedings{bergroth-2005-utilizing,
author = {Lasse Bergroth},
editor = {Mariano P. Consens and
Gonzalo Navarro},
title = {{Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem}},
booktitle = {{String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {3772},
pages = {301--314},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11575832_34},
doi = {https://doi.org/10.1007/11575832_34}
}