Closest substring problems for regular languages

Yo-Sub Han, Sang-Ki Ko, Timothy Ng 0001, Kai Salomaa. Closest substring problems for regular languages. Theoretical Computer Science, 862:144-154, 2021. [doi]

Abstract

Abstract is missing.