Abstract
Isometric words combine the notion of edit distance together with properties of words not appearing as factors in other words. An edit distance is a metric between words that quantifies how two words differ by counting the number of edit operations needed to transform one word into the other one. A word f is said isometric with respect to an edit distance if, for any pair of f-free words u and v, there exists a transformation of minimal length from u into v via the related edit operations such that all the intermediate words are also f-free. The adjective “isometric” comes from the fact that, if the Hamming distance is considered (i.e., only replacement operations are used), then isometric words are connected with the definitions of isometric subgraphs of hypercubes. We discuss known results and some interesting generalizations and open problems.
Partially supported by INdAM-GNCS Project 2023, 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
Notes
- 1.
In the literature, these isometric words are sometimes called good words while the non-isometric are called bad words.
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. In: Drewes, F., Volkov, M. (eds.) DLT 2023. LNCS, vol. 13911, pp. 23–35. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-33264-7_3
Anselmo, M., Castiglione, G., Flores, M., Giammarresi, D., Madonia, M., Mantaci, S.: Hypercubes and isometric words based on swap and mismatch distance. In: Drewes, F., Volkov, M. (eds.) DCFS 2023. LNCS, vol. 13911, pp. 21–35. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-33264-7_3
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: 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.: Non-expandable non-overlapping sets of pictures. Theoret. Comput. Sci. 657, 127–136 (2017)
Anselmo, M., Giammarresi, D., Madonia, M.: Sets of pictures avoiding overlaps. Int. J. Found. Comput. Sci. 30(6–7), 875–898 (2019)
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
Béal, M., Crochemore, M.: Checking whether a word is Hamming-isometric in linear time. Theor. Comput. Sci. 933, 55–59 (2022)
Béal, M.-P., Mignosi, F., Restivo, A.: Minimal forbidden words and symbolic dynamics. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 555–566. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-60922-9_45
Castiglione, G., Mantaci, S., Restivo, A.: Some investigations on similarity measures based on absent words. Fundam. Informaticae 171(1–4), 97–112 (2020)
Charalampopoulos, P., Crochemore, M., Fici, G., Mercas, R., Pissis, S.P.: Alignment-free sequence comparison using absent words. Inf. Comput. 262, 57–68 (2018)
Codara, P., D’Antona, O.M.: Generalized Fibonacci and Lucas cubes arising from powers of paths and cycles. Discret. Math. 339(1), 270–282 (2016)
Epifanio, C., Forlizzi, L., Marzi, F., Mignosi, F., Placidi, G., Spezialetti, M.: On the \(k\)-hamming and \(k\)-edit distances. CORR arXiv:abs/2303.09144 (2023)
Faro, S., Pavone, A.: An efficient skip-search approach to swap matching. Comput. J. 61(9), 1351–1360 (2018)
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.: The index of a binary word. Theor. Comput. Sci. 452, 100–106 (2012)
Klavžar, S., Shpectorov, S.V.: Asymptotic number of isometric generalized Fibonacci cubes. Eur. J. Comb. 33(2), 220–226 (2012)
Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168–173 (1974)
Wei, J.: The structures of bad words. Eur. J. Comb. 59, 204–214 (2017)
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
Castiglione, G., Flores, M., Giammarresi, D. (2023). Isometric Words and Edit Distance: Main Notions and New Variations. In: Manzoni, L., Mariot, L., Roy Chowdhury, D. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2023. Lecture Notes in Computer Science, vol 14152. Springer, Cham. https://doi.org/10.1007/978-3-031-42250-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-42250-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-42249-2
Online ISBN: 978-3-031-42250-8
eBook Packages: Computer ScienceComputer Science (R0)
