Hypercubes and Isometric Words based on Swap and Mismatch Distance

The hypercube of dimension n is the graph whose vertices are the 2^n binary words of length n, and there is an edge between two of them if they have Hamming distance 1. We consider an edit distance based on swaps and mismatches, to which we refer as tilde-distance, and define the tilde-hypercube wit...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Anselmo, Marcella, Castiglione, Giuseppa, Flores, Manuela, Giammarresi, Dora, Madonia, Maria, Mantaci, Sabrina
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Formal Languages and Automata Theory Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!