Lasse Bergroth

According to our database, Lasse Bergroth authored at least 4 papers between 1998 and 2005.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2005

Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem.

Lasse Bergroth

Proceedings of the String Processing and Information Retrieval, 2005

2003

New Refinement Techniques for Longest Common Subsequence Algorithms.

Lasse Bergroth, Harri Hakonen, Juri Väisänen

Proceedings of the String Processing and Information Retrieval, 2003

2000

A Survey of Longest Common Subsequence Algorithms.

Lasse Bergroth, Harri Hakonen, Timo Raita

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

1998

New Approximation Algorithms for Longest Common Subsequences.

Lasse Bergroth, Harri Hakonen, Timo Raita

Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998