Open Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 60, 2026
|
|
|---|---|---|
| Article Number | 19 | |
| Number of page(s) | 16 | |
| DOI | https://doi.org/10.1051/ita/2026020 | |
| Published online | 04 June 2026 | |
- V.I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys.-Dokl. 10 (1966) 707–710. [Google Scholar]
- V.I. Levenshtein, Efficient reconstruction of sequences from their subsequences or supersequences. J. Combinat. Theory A 93 (2001) 310–332. [Google Scholar]
- R.W. Hamming, Error detecting and error correcting codes. Bell Syst. Tech. J. 29 (1950) 147–160. [Google Scholar]
- P. Bakhtary and O. Echi, On minimal Hamming compatible distances. RAIRO Theor. Inform. Appl. 48 (2014) 495–503. [Google Scholar]
- P.E. Ruth and M.E. Lladser, Levenshtein graphs: resolvability, automorphisms & determining sets. Discrete Math. 346 (2023) Paper No. 113310. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.