Isometric words based on swap and mismatch distance
From MaRDI portal
Publication:6067324
DOI10.1007/978-3-031-33264-7_3arXiv2303.03086OpenAlexW4377081592MaRDI QIDQ6067324
Marcella Anselmo, Manuela Flores, Sabrina Mantaci, Marina Madonia, Dora Giammarresi, Giuseppa Castiglione
Publication date: 16 November 2023
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.03086
Cites Work
- Unnamed Item
- Unnamed Item
- The structures of bad words
- Proofs of two conjectures on generalized Fibonacci cubes
- The approximate swap and mismatch edit distance
- Asymptotic number of isometric generalized Fibonacci cubes
- The index of a binary word
- Overlap matching.
- Alignment-free sequence comparison using absent words
- On \(k\)-ary \(n\)-cubes and isometric words
- Quaternary \(n\)-cubes and isometric words
- Characterization and measure of infinite two-dimensional strong prefix codes
- Swap and mismatch edit distance
- A characterization of non-isometric binary words
- Checking whether a word is Hamming-isometric in linear time
- An Improved Algorithm For Approximate String Matching
- Minimal forbidden words and symbolic dynamics
- Some Investigations on Similarity Measures Based on Absent Words