Main » SPIRE » 2005 » String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings »

Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem

Lasse Bergroth


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:
spire_conference
Publisher:
Springer
Pages:
301–314
URL:
https://doi.org/10.1007/11575832_34
DOI:
10.1007/11575832_34
DBLP:
conf/spire/Bergroth05
BibTeX:
Download