RO  EN
IMCS/Publications/CSJM/Issues/CSJM v.26, n.2 (77), 2018/

Efficiency and Penalty Factors on Monoids of Strings

Authors: Mitrofan Choban, Ivan Budanaev
Keywords: invariant distance, measure of similarity, Levenshtein distance, Hamming distance, Graev method, penalty.

Abstract

In information theory, linguistics and computer science, metrics for measuring similarity between two given strings (sequences) are important. In this article we introduce efficiency, measure of similarity and penalty for given parallel decompositions of two strings. Relations between these characteristics are established. In this way, we continue the research from \cite{CB1, CB2}.

Mitrofan Choban
Tiraspol State University, Republic of Moldova
str. Iablochkin 5, Chisinau, Moldova
Phone: +373 69109553
E-mail:

Ivan Budanaev
Doctoral School of Mathematics and Information Science
Institute of Mathematics and Computer Sciences
Tiraspol State University, Republic of Moldova
str. Academiei, 3/2, MD-2028, Chisinau, Moldova
E-mail:

Fulltext

Adobe PDF document0.14 Mb