| Issue |
RAIRO-Theor. Inf. Appl.
Volume 48, Number 5, December 2014
|
|
|---|---|---|
| Page(s) | 495 - 503 | |
| DOI | https://doi.org/10.1051/ita/2014022 | |
| Published online | 05 November 2014 | |
On minimal Hamming compatible distances
1 (Data Scientist) Facebook, Inc. Menlo
Park, CA
94025,
USA.
bakhtary@gmail.com
2 King Fahd University of Petroleum and
Minerals, Department of Mathematics and Statistics
PO Box 5046, Dhahran
31261, Saudi
Arabia.
othechi@yahoo.com; echi@kfupm.edu.sa
Received:
20
September
2013
Accepted:
26
May
2014
A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric and show this metric is minimal in the class of all “well-behaved” Hamming compatible metrics. This gives a negative answer to a question stated by Echi in his paper [O. Echi, Appl. Math. Sci. (Ruse) 3 (2009) 813–824.].
Mathematics Subject Classification: 54E35 / 68R01
Key words: Edit distance / Hamming distance / metric space
© EDP Sciences 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.