Lasse Bergroth

New Refinement Techniques for Longest Common Subsequence Algorithms

Harri Hakonen, Lasse Bergroth, Juri Väisänen, 2003, SPIRE.

New approximation algorithms for longest common subsequences

Harri Hakonen, Timo Raita, Lasse Bergroth, 1998, Proceedings. String Processing and Information Retrieval: A South American Symposium (Cat. No.98EX207).

Kahden merkkijonon pisimmän yhteisen alijonon ongelma ja sen ratkaiseminen

Lasse Bergroth, 2012 .

Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem

Lasse Bergroth, 2005, SPIRE.