Abstract
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 with edges linking words at tilde-distance 1. Then, we introduce and study some isometric subgraphs of the tilde-hypercube obtained by using special words called tilde-isometric words. The subgraphs keep only the vertices that avoid a given tilde-isometric word as a factor. An infinite family of tilde-isometric words is described; they are isometric with respect to the tilde-distance, but not to the Hamming distance. In the case of word 11, the subgraph is called tilde-Fibonacci cube, as a generalization of the classical Fibonacci cube. The tilde-hypercube and the tilde-Fibonacci cube can be recursively defined; the same holds for the number of their edges. This allows an asymptotic estimation of the number of edges in the tilde-Fibonacci cube, in comparison to the total number in the tilde-hypercube.
Partially supported by INdAM-GNCS Project 2022 and 2023, FARB Project ORSA229894 of University of Salerno, TEAMS Project and PNRR MUR Project PE0000013-FAIR University of Catania, PNRR MUR Project ITSERR CUP B53C22001770006 and FFR fund University of Palermo, MUR Excellence Department Project MatMod@TOV, CUP E83C23000330006, awarded to the Department of Mathematics, University of Rome Tor Vergata.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Amir, A., Eisenberg, E., Porat, E.: Swap and mismatch edit distance. Algorithmica 45(1), 109–120 (2006)
Anselmo, M., Castiglione, G., Flores, M., Giammarresi, D., Madonia, M., Mantaci, S.: Isometric words based on swap and mismatch distance. CORR abs/2303.03086 (2023)
Anselmo, M., Flores, M., Madonia, M.: Quaternary n-cubes and isometric words. In: Lecroq, T., Puzynina, S. (eds.) WORDS 2021. LNCS, vol. 12847, pp. 27–39. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-85088-3_3
Anselmo, M., Flores, M., Madonia, M.: Fun slot machines and transformations of words avoiding factors. In: 11th International Conference on Fun with Algorithms. LIPIcs, vol. 226, pp. 4:1–4:15 (2022)
Anselmo, M., Flores, M., Madonia, M.: On k-ary n-cubes and isometric words. Theor. Comput. Sci. 938, 50–64 (2022)
Anselmo, M., Giammarresi, D., Madonia, M., Selmi, C.: Bad pictures: some structural properties related to overlaps. In: Jirásková, G., Pighizzini, G. (eds.) DCFS 2020. LNCS, vol. 12442, pp. 13–25. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-62536-8_2
Azarija, J., Klavžar, S., Lee, J., Pantone, J., Rho, Y.: On isomorphism classes of generalized Fibonacci cubes. Europ. J. Comb. 51, 372–379 (2016)
Béal, M., Crochemore, M.: Checking whether a word is Hamming-isometric in linear time. Theor. Comput. Sci. 933, 55–59 (2022)
El-Amawy, A., Latifi, S.: Properties and performance of folded hypercubes. IEEE Trans. Parallel Distrib. Syst. 2(1), 31–42 (1991)
Faro, S., Pavone, A.: An efficient skip-search approach to swap matching. Comput. J. 61(9), 1351–1360 (2018)
Harary, F., Hayes, J., Wu, H.: A survey of the theory of hypercube graphs. Comput. Math. Appl. 15(4), 277–289 (1988)
Hsu, W.J.: Fibonacci cubes-a new interconnection topology. IEEE Trans. Parallel Distrib. Syst. 4(1), 3–12 (1993)
Ilić, A., Klavžar, S., Rho, Y.: Generalized Fibonacci cubes. Discrete Math. 312(1), 2–11 (2012)
Ilić, A., Klavžar, S., Rho, Y.: The index of a binary word. Theor. Comput. Sci. 452, 100–106 (2012)
Klavžar, S.: Structure of Fibonacci cubes: a survey. J. Comb. Optim. 25(4), 505–522 (2013)
Klavžar, S., Shpectorov, S.V.: Asymptotic number of isometric generalized Fibonacci cubes. Eur. J. Comb. 33(2), 220–226 (2012)
Munarini, E., Salvi, N.Z.: Structural and enumerative properties of the Fibonacci cubes. Discret. Math. 255(1–3), 317–324 (2002)
Sloane, N.: On-line encyclopedia of integer sequences. http://oeis.org/
Tzeng, N., Wei, S.: Enhanced hypercubes. IEEE Trans. Comput. 40(3), 284–294 (1991)
Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168–173 (1974)
Wagner, R.A.: On the complexity of the extended string-to-string correction problem. In: Rounds, W.C., Martin, N., Carlyle, J.W., Harrison, M.A. (eds.) Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 5–7 May 1975, Albuquerque, New Mexico, USA, pp. 218–223 (1975)
Wei, J.: The structures of bad words. Eur. J. Comb. 59, 204–214 (2017)
Wei, J.: Proof of a conjecture on 2-isometric words. Theor. Comput. Sci. 855, 68–73 (2021)
Wei, J., Yang, Y., Wang, G.: Circular embeddability of isometric words. Discret. Math. 343(10), 112024 (2020)
Wei, J., Yang, Y., Zhu, X.: A characterization of non-isometric binary words. Eur. J. Comb. 78, 121–133 (2019)
Wei, J., Zhang, H.: Proofs of two conjectures on generalized Fibonacci cubes. Eur. J. Comb. 51, 419–432 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 IFIP International Federation for Information Processing
About this paper
Cite this paper
Anselmo, M., Castiglione, G., Flores, M., Giammarresi, D., Madonia, M., Mantaci, S. (2023). Hypercubes and Isometric Words Based on Swap and Mismatch Distance. In: Bordihn, H., Tran, N., Vaszil, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2023. Lecture Notes in Computer Science, vol 13918. Springer, Cham. https://doi.org/10.1007/978-3-031-34326-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-031-34326-1_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-34325-4
Online ISBN: 978-3-031-34326-1
eBook Packages: Computer ScienceComputer Science (R0)
