Main » SPIRE » 1998 » String Processing and Information Retrieval: A South American Symposium, SPIRE 1998, Santa Cruz de la Sierra Bolivia, September 9-11, 1998 »

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:
spire_conference
Publisher:
IEEE Computer Society
Pages:
32–40
URL:
https://doi.org/10.1109/SPIRE.1998.712980
DOI:
10.1109/SPIRE.1998.712980
DBLP:
conf/spire/BergrothHR98
BibTeX:
Download