| |
| * | 2005 | |
|---|---|---|
| 4 | EE | Lasse Bergroth: Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem. SPIRE 2005: 301-314 |
| 2003 | ||
| 3 | EE | Lasse Bergroth, Harri Hakonen, Juri Väisänen: New Refinement Techniques for Longest Common Subsequence Algorithms. SPIRE 2003: 287-303 |
| 2000 | ||
| 2 | EE | Lasse Bergroth, Harri Hakonen, Timo Raita: A Survey of Longest Common Subsequence Algorithms. SPIRE 2000: 39-48 |
| 1998 | ||
| 1 | Lasse Bergroth, Harri Hakonen, Timo Raita: New Approximation Algorithms for Longest Common Subsequences. SPIRE 1998: 32-40 | |
| 1 | Harri Hakonen | [1] [2] [3] |
| 2 | Timo Raita | [1] [2] |
| 3 | Juri Väisänen | [3] |