ItemScopus

An Analysis of Levenshtein Distance Using Dynamic Programming Method

Title
An Analysis of Levenshtein Distance Using Dynamic Programming Method
Description
Lecture Notes in Networks and Systems Vol.540 pp.525-532
Creator
Arockiya Jerson J.; Preethi N.
Source
<a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85149819721&doi=10.1007%2f978-981-19-6088-8_46&partnerID=40&md5=dbd536625539a80ba9dda578cb9a0e89" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85149819721&doi=10.1007%2f978-981-19-6088-8_46&partnerID=40&md5=dbd536625539a80ba9dda578cb9a0e89</a>
Date
2023-01-01

Collection

Conference Papers

Citation

Arockiya Jerson J.; Preethi N., “An Analysis of Levenshtein Distance Using Dynamic Programming Method,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 8, 2025, https://archives.christuniversity.in/items/show/10359.

Output Formats