Hamming-Levenshtein gap of a string

DOI10.1051/ITA/2026020MaRDI QIDQ7298061zbMATH OpenFDO

Authors Monther R. Alfuraidan, Said Algarni, Othman Echi

Publication date 16 July 2026

Published in RAIRO. Theoretical Informatics and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/ITA/2026020

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorics on words (68R15) Algorithms on strings (68W32) Source coding (94A29)

Cites work

• Efficient reconstruction of sequences from their subsequences of supersequences
• Error detecting and error correcting codes
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• Levenshtein graphs: resolvability, automorphisms \& determining sets
• On minimal Hamming compatible distances

This page was built for publication: Hamming-Levenshtein gap of a string

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