%0 Journal Article %1 Levenshtein_SPD66 %A Levenshtein, Vladimir Iosifovich %D 1966 %J Soviet Physics Doklady %K edit-distance c1966 DPA Sellers strings c19xx jrnl comparison LCSS deletion errorcorrectingcode sequence metric string indel similarity editdistance delete codes c196x string-to-string insert dynamicprogrammingalgorithm LCS %N 8 %P 707--710 %T Binary codes capable of correcting deletions, insertions and reversals. %V 10 %X Seems to be the first person to define what became known as the (simple) edit-distance and show it to be a metric. Paper mostly about constructing optimal codes to transmit such corrections.

@article{Levenshtein_SPD66, abstract = {Seems to be the first person to define what became known as the (simple) edit-distance and show it to be a metric. Paper mostly about constructing optimal codes to transmit such corrections.}, added-at = {2010-03-31T13:58:51.000+0200}, author = {Levenshtein, Vladimir Iosifovich}, biburl = {https://www.bibsonomy.org/bibtex/220546d80ce76f58c6ef6ece9dd5f5056/cbrewster}, interhash = {55f7ad93fcb9ae3ed999afaa6e24937d}, intrahash = {20546d80ce76f58c6ef6ece9dd5f5056}, journal = {Soviet Physics Doklady}, keywords = {edit-distance c1966 DPA Sellers strings c19xx jrnl comparison LCSS deletion errorcorrectingcode sequence metric string indel similarity editdistance delete codes c196x string-to-string insert dynamicprogrammingalgorithm LCS}, month = {#feb#}, note = {Doklady Akademii Nauk SSSR, V163 No4 845-848 1965}, number = 8, pages = {707--710}, timestamp = {2010-03-31T13:58:51.000+0200}, title = {Binary codes capable of correcting deletions, insertions and reversals.}, volume = 10, year = 1966 }