RUS  ENG
Full version
JOURNALS // Program Systems: Theory and Applications // Archive

Program Systems: Theory and Applications, 2017 Volume 8, Issue 4, Pages 347–357 (Mi ps286)

This article is cited in 4 papers

Mathematical Foundations of Programming

Model and axioms for similarity metrics

S. V. Znamenskij

Ailamazyan Program Systems Institute of Russian Academy of Sciences

Abstract: Modern applications usually combine different similarity metrics taking into account the algorithms complexity, the peculiarities of human perception, data resources and samples. The optimization requires a unified formal description of the basic similarity metrics.
The system of the similarity metric axioms is enchanced and its universal model is constructed which generalizes known models of similarity that do not reduce to the Euclidean metric.    The model is based on a weighted partially ordered set. (In Russian).

Key words and phrases: similarity of strings, sequence alignment, edit distance, LCS, Levenshtein metric.

UDC: 004.416

MSC: 97P20; 91C05, 91C20

Received: 14.12.2017
Accepted: 29.12.2017

DOI: 10.25209/2079-3316-2017-8-4-347-357



© Steklov Math. Inst. of RAS, 2025