Abstract
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 "wellbehaved" 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.].
| Original language | English |
|---|---|
| Pages (from-to) | 495-503 |
| Number of pages | 9 |
| Journal | RAIRO - Theoretical Informatics and Applications |
| Volume | 48 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1 Jan 2015 |
Bibliographical note
Publisher Copyright:© EDP Sciences 2015.
Keywords
- Edit distance
- Hamming distance
- Metric space
ASJC Scopus subject areas
- Software
- General Mathematics
- Computer Science Applications
Fingerprint
Dive into the research topics of 'On minimal hamming compatible distances'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver