2005

doi dblp
Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem
Lasse Bergroth
String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings

2003

doi dblp
New Refinement Techniques for Longest Common Subsequence Algorithms
Lasse Bergroth | Harri Hakonen | Juri Väisänen
String Processing and Information Retrieval, 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings

2000

doi dblp
A Survey of Longest Common Subsequence Algorithms
Lasse Bergroth | Harri Hakonen | Timo Raita
Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coruña, Spain, September 27-29, 2000

1998

doi dblp
New Approximation Algorithms for Longest Common Subsequences
Lasse Bergroth | Harri Hakonen | Timo Raita
String Processing and Information Retrieval: A South American Symposium, SPIRE 1998, Santa Cruz de la Sierra Bolivia, September 9-11, 1998

Search