Dissanayake, D. M. C.
(Faculty of Science, University of Kelaniya Sri Lanka, 2023)
The closest string problem is an NP-complete problem which appears more commonly in bioinformatics and coding theory. From a theorist’s point of view, more interesting applications are found in automata theory, specifically ...