The hypercube of dimension n is the graph whose vertices are $$2^n$$ binary words length n, and there an edge between two them if they have Hamming distance 1. We consider edit based on swaps mismatches, to which we refer as tilde-distance, define tilde-hypercube with edges linking at tilde-distance Then, introduce study some isometric subgraphs obtained by using special called tilde-isometric ...
