Finding Longest Common Subsequences: New A* Anytime Results

Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.