In this paper we consider the weighted k-Hamming and k-Edit distances, that are natural generalizations of the classical Hamming and Edit distances. As main results of this paper we prove that for any k≥2 the DECIS-k-Hamming problem is P-SPACE-complete and the DECIS-k-Edit problem is NEXPTIME-complete.
Cite
@article{arxiv.2306.09144,
title = {On the $k$-Hamming and $k$-Edit Distances},
author = {Chiara Epifanio and Luca Forlizzi and Francesca Marzi and Filippo Mignosi and Giuseppe Placidi and Matteo Spezialetti},
journal= {arXiv preprint arXiv:2306.09144},
year = {2023}
}