On k-ary n-cubes and isometric words

DOI10.1016/J.TCS.2022.10.007MaRDI QIDQ2089690zbMATH OpenOpenAlexFDO

Authors Marcella Anselmo, Manuela Flores, Maria Madonia

Publication date 24 October 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.10.007

zbMATH Keywords

\(k\)-ary \(n\)-cubesHamming and Lee distanceindex of a wordoverlapwords avoiding factors

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Quaternary n-cubes and isometric words
• Circular embeddability of isometric words
• Lee distance and topological properties of k-ary n-cubes
• Hypercubes and isometric words based on swap and mismatch distance
• Checking whether a word is Hamming-isometric in linear time

Cites work

• A characterization of non-isometric binary words
• A survey of the theory of hypercube graphs
• Asymptotic number of isometric generalized Fibonacci cubes
• Bad pictures: some structural properties related to overlaps
• Circular embeddability of isometric words
• Generalized Fibonacci cubes
• Lee distance and topological properties of k-ary n-cubes
• On \(k\)-ary \(n\)-cubes: Theory and applications.
• On isomorphism classes of generalized Fibonacci cubes
• Proof of a conjecture on 2-isometric words
• Proofs of two conjectures on generalized Fibonacci cubes
• Quaternary n-cubes and isometric words
• Structure of Fibonacci cubes: a survey
• The index of a binary word
• The structures of bad words
• Upper bounds on the queue number of \(k\)-ary \(n\)-cubes

Cited in

(26)

• Quaternary n-cubes and isometric words
• Checking whether a word is Hamming-isometric in linear time
• scientific article; zbMATH DE number 5722472 (Why is no real title available?)
• Solution to a conjecture on words that are bad and 2-isometric
• scientific article; zbMATH DE number 5237248 (Why is no real title available?)
• Isometric words based on swap and mismatch distance
• Hypercubes and isometric words based on swap and mismatch distance
• Isometric words and edit distance: main notions and new variations
• Density of k-ary words with 0, 1, 2-error overlaps
• Partial cubes and Fibonacci dimension: insights and perspectives
• Characterization of isometric words based on swap and mismatch distance
• On the Weihrauch degree of the additive Ramsey theorem
• Hilbert's tenth problem for term algebras with a substitution operator
• Complemented subsets and Boolean-valued, partial functions
• Defining long words succinctly in FO and MSO
• On the first-order parts of problems in the Weihrauch degrees
• Algorithmically random series
• Ideal presentations and numberings of some classes of effective quasi-Polish spaces
• Lower bounds on () and other properties of -register machines
• Reifying dynamical algebra: maximal ideals in countable rings, constructively
• Maps for learning indexable classes
• On the necessity of some topological spaces
• Computing the index of non-isometric k-ary words with Hamming and Lee distance
• Isometric sets of words and generalizations of the Fibonacci cubes
• A family of partial cubes with minimal Fibonacci dimension
• Transformations between minimally f-free words

This page was built for publication: On \(k\)-ary \(n\)-cubes and isometric words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089690)