Closest substring problems for regular languages

DOI10.1007/978-3-319-98654-8_32MaRDI QIDQ5915558

Yo-Sub Han, Sang-Ki Ko, Kai Salomaa, Timothy Ng

Publication date: 22 November 2018

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-98654-8_32

zbMATH Keywords

computational complexity; regular languages; edit distance; closest substring problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)