{"version":"1.0","type":"link","title":"Hirschberg's algorithm - Newikis","description":"In computer science, Hirschberg's algorithm, named after its inventor, Dan Hirschberg, is a dynamic programming algorithm that finds the optimal sequence alignment between two strings. Optimality is measured with the Levenshtein distance, defined to be the sum of the costs of insertions,…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}