The index of a binary word
From MaRDI portal
Publication:714791
DOI10.1016/J.TCS.2012.05.025zbMATH Open1251.68173OpenAlexW2082223566MaRDI QIDQ714791FDOQ714791
Authors: Aleksandar Ilić, Sandi Klavžar, Yoomi Rho 
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.025
Recommendations
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structure of Fibonacci cubes: a survey
- Generalized fibonacci cubes are mostly hamiltonian
- Title not available (Why is that?)
- Asymptotic number of isometric generalized Fibonacci cubes
- Generalized Fibonacci cubes
- Some operations preserving primitivity of words
- Prefix Reversals on Binary and Ternary Strings
Cited In (18)
- Infinite families of 2-isometric and not 3-isometric binary words
- Cube-complements of generalized Fibonacci cubes
- A characterization of non-isometric binary words
- A negative answer to a problem on generalized Fibonacci cubes
- The self-concatenation of isometric strings is isometric
- All good (bad) words consisting of 5 blocks
- Hypercubes and isometric words based on swap and mismatch distance
- Isometric words based on swap and mismatch distance
- Parity index of binary words and powers of prime words
- The structures of bad words
- Solution to a conjecture on words that are bad and 2-isometric
- Proofs of two conjectures on generalized Fibonacci cubes
- Circular embeddability of isometric words
- On isomorphism classes of generalized Fibonacci cubes
- Quaternary \(n\)-cubes and isometric words
- Isometric words and edit distance: main notions and new variations
- On \(k\)-ary \(n\)-cubes and isometric words
- Proof of a conjecture on 2-isometric words
This page was built for publication: The index of a binary word
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714791)
