Checking whether a word is Hamming-isometric in linear time

DOI10.1016/j.tcs.2022.08.032OpenAlexW3174764587MaRDI QIDQ2676462

Marie-Pierre Béal, Maxime Crochemore

Publication date: 27 September 2022

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

Full work available at URL: https://arxiv.org/abs/2106.10541

zbMATH Keywords

pattern matching with mismatchesisometric words

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Isometric words based on swap and mismatch distance ⋮ Hypercubes and isometric words based on swap and mismatch distance

Cites Work

• Unnamed Item
• Unnamed Item
• The structures of bad words
• On pattern matching with \(k\) mismatches and few don't cares
• Proofs of two conjectures on generalized Fibonacci cubes
• Asymptotic number of isometric generalized Fibonacci cubes
• Generalized Fibonacci cubes
• Structure of Fibonacci cubes: a survey
• Bad pictures: some structural properties related to overlaps
• Quaternary \(n\)-cubes and isometric words
• A characterization of non-isometric binary words
• Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance
• Fast Algorithms for Finding Nearest Common Ancestors
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Faster algorithms for string matching with k mismatches
• Algorithms on Strings

This page was built for publication: Checking whether a word is Hamming-isometric in linear time