On the k-Hamming and k-Edit Distances

06/15/2023

∙

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 ℙ-SPACE-complete and the DECIS-k-Edit problem is NEXPTIME-complete.

READ FULL TEXT

On the k-Hamming and k-Edit Distances

Hamming Distances in Vector Spaces over Finite Fields

Compositional and Abstraction-Based Approach for Synthesis of Edit Functions for Opacity Enforcement

An Algorithmic Bridge Between Hamming and Levenshtein Distances

Levenshtein Graphs: Resolvability, Automorphisms Determining Sets

Refinements of Levenshtein bounds in q-ary Hamming spaces

Geometry of Graph Edit Distance Spaces

Reti bayesiane per lo studio del fenomeno degli incidenti stradali tra i giovani in Toscana

On the k-Hamming and k-Edit Distances

Related Research

Hamming Distances in Vector Spaces over Finite Fields

Compositional and Abstraction-Based Approach for Synthesis of Edit Functions for Opacity Enforcement

An Algorithmic Bridge Between Hamming and Levenshtein Distances

Levenshtein Graphs: Resolvability, Automorphisms Determining Sets

Refinements of Levenshtein bounds in q-ary Hamming spaces

Geometry of Graph Edit Distance Spaces

Reti bayesiane per lo studio del fenomeno degli incidenti stradali tra i giovani in Toscana