Finding Longest Common Subsequences: New anytime A$^*$ Search Results

Marko Djukanovic, Günther Raidl, Christian Blum
January 2020
PDF bib

Abstract

Full Citation:

Marko Djukanovic, Günther R. Raidl, Christian Blum. Finding Longest Common Subsequences: New anytime A$^*$ Search Results. Applied Soft Computing, volume 95, number 106400, 2020.

Type
Journal Article
Günther Raidl
Günther Raidl

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