Isometric words and edit distance: main notions and new variations
From MaRDI portal
Publication:6546059
Recommendations
Cites work
- A characterization of non-isometric binary words
- Alignment-free sequence comparison using absent words
- Asymptotic number of isometric generalized Fibonacci cubes
- Characterization and measure of infinite two-dimensional strong prefix codes
- Checking whether a word is Hamming-isometric in linear time
- Fun slot machines and transformations of words avoiding factors
- Generalized Fibonacci and Lucas cubes arising from powers of paths and cycles
- Hypercubes and isometric words based on swap and mismatch distance
- Minimal forbidden words and symbolic dynamics
- Non-expandable non-overlapping sets of pictures
- On \(k\)-ary \(n\)-cubes and isometric words
- Proofs of two conjectures on generalized Fibonacci cubes
- Quaternary n-cubes and isometric words
- Sets of pictures avoiding overlaps
- Some Investigations on Similarity Measures Based on Absent Words
- Swap and mismatch edit distance
- The index of a binary word
- The String-to-String Correction Problem
- The structures of bad words
Cited in
(6)- Checking whether a word is Hamming-isometric in linear time
- Isometric words based on swap and mismatch distance
- Hypercubes and isometric words based on swap and mismatch distance
- Characterization of isometric words based on swap and mismatch distance
- Isometric sets of words and generalizations of the Fibonacci cubes
- A family of partial cubes with minimal Fibonacci dimension
This page was built for publication: Isometric words and edit distance: main notions and new variations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546059)
