Distances on Strings and Permutations

Michel Marie Deza and Elena Deza
Additional contact information
Michel Marie Deza: Ecole Normale Supérieure
Elena Deza: Moscow State Pedagogical University

Chapter Chapter 11 in Encyclopedia of Distances, 2014, pp 213-225 from Springer

Abstract: Abstract An alphabet is a finite set 𝒜 $$\mathcal{A}$$ , | 𝒜 | ≥ 2 $$\vert \mathcal{A}\vert \geq 2$$ , elements of which are called characters (or symbols).

Keywords: Edit Distance; Vote Rule; Condorcet Winner; Kolmogorov Complexity; Editing Operation (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-44342-2_11

Ordering information: This item can be ordered from
http://www.springer.com/9783662443422

DOI: 10.1007/978-3-662-44342-2_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().