Search

In information theory, linguistics and computer science are important distinct string metrics for measuring the difference between two given strings (sequences). In distinct domains of research are well known the distances of Hamming and Graev-Levenshtein between two strings. For any string distance there are distinct geometrical compute problems. Some of them are as follows: - the calculation of the median of two strings; - the calculation of the weighted means of two strings; - the problem of the convexity of the weighted mean set. In the present article the above geometrical problems are examined for the Hamming and Graev-Levenshtein string distances. [ABSTRACT FROM AUTHOR]

In information theory, linguistics and computer science are important distinct string metrics for measuring the difference between two given strings (sequences). In distinct domains of research are well known the distances of Hamming and Graev between two strings. For any string distance there are distinct geometrical compute problems, one of them being the calculation of the bisector of two strings. In the present article the problem of the bisector of two strings is examined for the Hamming and Graev string distances. [ABSTRACT FROM AUTHOR]