V. I. Levenshtein, “Binary codes capable of correcting deletions, insertions, and reversals”, Dokl. Akad. Nauk SSSR, 163:4 (1965), 845

This publication is cited in the following 28 articles:

V. O. Yankovskiy, “Isometry groups of formal languages for generalized Levenshtein distances”, Math. Notes, 116:2 (2024), 373–381
I. V. Vorobyev, “Covering codes for the fixed length Levenshtein metric”, Problems Inform. Transmission, 59:2 (2023), 86–98
A. V. Goloveshkin, S. S. Mikhalkovich, “Robust algorithmic binding to arbitrary fragment of program code”, Program Systems: Theory and Applications, 13:1 (2022), 35–62
A. V. Borisov, A. V. Bosov, D. V. Zhukov, A. V. Ivanov, “Informatsionnye aspekty obespecheniya bezopasnosti na transporte: poisk i otbor informatsii”, Sistemy i sredstva inform., 31:2 (2021), 80–88
G. Maringer, N. A. Polyanskii, I. V. Vorobyev, L. Welter, “Feedback insertion-deletion codes”, Problems Inform. Transmission, 57:3 (2021), 212–240
S. V. Dronov, “Struktura kollektiva blizhaishikh sosedei v semeistve razbienii konechnogo mnozhestva”, PDM, 2020, no. 47, 5–15
A. Yu. Saparov, A. P. Beltyukov, S. G. Maslov, “Utochnenie rezultatov raspoznavaniya matematicheskikh formul s ispolzovaniem rasstoyaniya Levenshteina”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 30:3 (2020), 513–529
K. A. Skornyakov, A. S. Laskina, D. Yu. Turdakov, “Dvukhshagovyi metod ob'edineniya novostei v syuzhety”, Trudy ISP RAN, 32:4 (2020), 165–174
A. K. Rychikhin, “O metodakh otsenki kachestva mashinnogo perevoda”, Sistemy i sredstva inform., 29:4 (2019), 106–118
M. M. Choban, I. A. Budanaev, “Distances on free semigroups and their applications”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2018, no. 1, 92–119
V. S. Vykhovanets, Ts. Du, S. A. Sakulin, “Obzor algoritmov foneticheskogo kodirovaniya”, UBS, 73 (2018), 67–94
E. P. Ofitserov, “Klassifikatsiya posledovatelnostei na osnove korotkikh motivov”, Chebyshevskii sb., 19:1 (2018), 187–199
B. F. Melnikov, M. A. Trenina, A. S. Kochergin, “Podkhod k uluchsheniyu algoritmov rascheta rasstoyanii mezhdu tsepochkami DNK (na primere algoritma Nidlmana - Vunsha)”, Izvestiya vysshikh uchebnykh zavedenii. Povolzhskii region. Fiziko-matematicheskie nauki, 2018, no. 1, 46–59
R. K. Tetuev, M. I. Pyatkov, A. N. Pankratov, “Parallelnyi algoritm globalnogo vyravnivaniya protyazhennykh aminokislotnykh i nukleotidnykh posledovatelnostei”, Matem. biologiya i bioinform., 12:1 (2017), 137–150
D. S. Chivilikhin, V. I. Ulyantsev, A. A. Shalyto, “Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas”, Autom. Remote Control, 77:3 (2016), 473–484
M. S. Malevannyy, S. S. Mikhalkovich, “Context-based model for concern markup of a source code”, Trudy ISP RAN, 28:2 (2016), 63–78
M. Yu. Zaikin, V. S. Dolgopolov, O. L. Obukhova, I. V. Solovev, “Tekhnologiya predotvrascheniya dublirovaniya bibliograficheskikh opisanii v baze dannykh nauchnykh publikatsii BIAS IPI RAN”, Sistemy i sredstva inform., 25:1 (2015), 168–185
A. G. D'yachkov, A. N. Kuzina, N. A. Polyansky, A. Macula, V. V. Rykov, “DNA codes for nonadditive stem similarity”, Problems Inform. Transmission, 50:3 (2014), 247–269
M. M. Gershkovich, T. K. Biryukova, “Zadachi identifikatsii informatsionnykh ob'ektov v raspredelennykh massivakh dannykh”, Sistemy i sredstva inform., 24:1 (2014), 224–243
A. A. Karpov, “An automatic multimodal speech recognition system with audio and video information”, Autom. Remote Control, 75:12 (2014), 2190–2200