Hypercubes and isometric words based on swap and mismatch distance

DOI10.1007/978-3-031-34326-1_2arXiv2303.09898OpenAlexW4381895241MaRDI QIDQ6175084

Sabrina Mantaci, Manuela Flores, Giuseppa Castiglione, Dora Giammarresi, Marina Madonia, Marcella Anselmo

Publication date: 17 August 2023

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.09898

zbMATH Keywords

hypercubeisometric wordsswap and mismatch distance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Hypercubes and isometric words based on swap and mismatch distance

Cites Work

• Unnamed Item
• Unnamed Item
• The structures of bad words
• On isomorphism classes of generalized Fibonacci cubes
• Proofs of two conjectures on generalized Fibonacci cubes
• Asymptotic number of isometric generalized Fibonacci cubes
• Generalized Fibonacci cubes
• The index of a binary word
• Circular embeddability of isometric words
• A survey of the theory of hypercube graphs
• Structural and enumerative properties of the Fibonacci cubes
• Structure of Fibonacci cubes: a survey
• On \(k\)-ary \(n\)-cubes and isometric words
• Quaternary \(n\)-cubes and isometric words
• Characterization and measure of infinite two-dimensional strong prefix codes
• Proof of a conjecture on 2-isometric words
• Swap and mismatch edit distance
• A characterization of non-isometric binary words
• Checking whether a word is Hamming-isometric in linear time
• The String-to-String Correction Problem
• Hypercubes and isometric words based on swap and mismatch distance

This page was built for publication: Hypercubes and isometric words based on swap and mismatch distance